./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP --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 fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:05:07,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:05:07,595 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:05:07,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:05:07,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:05:07,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:05:07,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:05:07,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:05:07,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:05:07,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:05:07,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:05:07,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:05:07,656 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:05:07,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:05:07,658 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:05:07,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:05:07,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:05:07,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:05:07,660 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:05:07,661 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:05:07,661 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:05:07,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:05:07,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:05:07,663 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:05:07,663 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:05:07,664 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:05:07,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:05:07,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:05:07,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:05:07,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:07,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:05:07,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:05:07,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:05:07,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:05:07,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:05:07,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:05:07,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:05:07,671 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:05:07,671 INFO L153 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_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/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_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP 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 -> fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 [2023-11-06 23:05:07,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:05:08,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:05:08,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:05:08,024 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:05:08,025 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:05:08,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix000.opt.i [2023-11-06 23:05:11,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:05:11,429 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:05:11,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/sv-benchmarks/c/pthread-wmm/mix000.opt.i [2023-11-06 23:05:11,454 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data/1d647235c/2b4131fac0e44e9f84fe8f5934299e7b/FLAG4e994b66d [2023-11-06 23:05:11,473 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data/1d647235c/2b4131fac0e44e9f84fe8f5934299e7b [2023-11-06 23:05:11,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:05:11,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:05:11,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:11,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:05:11,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:05:11,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:11" (1/1) ... [2023-11-06 23:05:11,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d6fcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:11, skipping insertion in model container [2023-11-06 23:05:11,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:11" (1/1) ... [2023-11-06 23:05:11,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:05:12,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:12,116 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:05:12,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:12,212 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:05:12,213 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:05:12,220 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:05:12,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12 WrapperNode [2023-11-06 23:05:12,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:12,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:12,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:05:12,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:05:12,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,283 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2023-11-06 23:05:12,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:12,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:05:12,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:05:12,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:05:12,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:05:12,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:05:12,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:05:12,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:05:12,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (1/1) ... [2023-11-06 23:05:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:12,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:12,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:05:12,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:05:12,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:05:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:05:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:05:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:05:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:05:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:05:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:05:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:05:12,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:05:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:05:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:05:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:05:12,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:05:12,466 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:05:12,636 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:05:12,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:05:13,074 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:05:13,312 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:05:13,312 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:05:13,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:13 BoogieIcfgContainer [2023-11-06 23:05:13,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:05:13,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:05:13,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:05:13,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:05:13,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:05:11" (1/3) ... [2023-11-06 23:05:13,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ddf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:13, skipping insertion in model container [2023-11-06 23:05:13,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:12" (2/3) ... [2023-11-06 23:05:13,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ddf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:13, skipping insertion in model container [2023-11-06 23:05:13,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:13" (3/3) ... [2023-11-06 23:05:13,327 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-11-06 23:05:13,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:05:13,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-06 23:05:13,347 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:05:13,408 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:05:13,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 222 flow [2023-11-06 23:05:13,537 INFO L124 PetriNetUnfolderBase]: 3/105 cut-off events. [2023-11-06 23:05:13,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:13,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-06 23:05:13,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 107 transitions, 222 flow [2023-11-06 23:05:13,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 216 flow [2023-11-06 23:05:13,552 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:05:13,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 105 transitions, 216 flow [2023-11-06 23:05:13,572 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 105 transitions, 216 flow [2023-11-06 23:05:13,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 216 flow [2023-11-06 23:05:13,625 INFO L124 PetriNetUnfolderBase]: 3/105 cut-off events. [2023-11-06 23:05:13,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:13,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-06 23:05:13,628 INFO L119 LiptonReduction]: Number of co-enabled transitions 1500 [2023-11-06 23:05:18,183 INFO L134 LiptonReduction]: Checked pairs total: 4236 [2023-11-06 23:05:18,184 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-11-06 23:05:18,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:05:18,220 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;@51a8ee1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:05:18,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 23:05:18,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:05:18,222 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:05:18,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:18,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:18,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:05:18,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:18,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 527, now seen corresponding path program 1 times [2023-11-06 23:05:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625524338] [2023-11-06 23:05:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625524338] [2023-11-06 23:05:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625524338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:05:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624922461] [2023-11-06 23:05:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:18,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:05:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:05:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:05:18,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2023-11-06 23:05:18,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:18,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:18,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2023-11-06 23:05:18,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:18,608 INFO L124 PetriNetUnfolderBase]: 287/499 cut-off events. [2023-11-06 23:05:18,608 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 23:05:18,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 499 events. 287/499 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2145 event pairs, 287 based on Foata normal form. 24/412 useless extension candidates. Maximal degree in co-relation 991. Up to 489 conditions per place. [2023-11-06 23:05:18,618 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-06 23:05:18,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-11-06 23:05:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:05:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:05:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2023-11-06 23:05:18,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908256880733945 [2023-11-06 23:05:18,635 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 214 transitions. [2023-11-06 23:05:18,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 214 transitions. [2023-11-06 23:05:18,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:18,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 214 transitions. [2023-11-06 23:05:18,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:18,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:18,656 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:18,658 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 214 transitions. [2023-11-06 23:05:18,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-11-06 23:05:18,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:18,664 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-11-06 23:05:18,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-06 23:05:18,670 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-06 23:05:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-11-06 23:05:18,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:18,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:18,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:05:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:05:18,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:18,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash 497728642, now seen corresponding path program 1 times [2023-11-06 23:05:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124900089] [2023-11-06 23:05:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124900089] [2023-11-06 23:05:19,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124900089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:19,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:05:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199983027] [2023-11-06 23:05:19,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:19,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:19,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:19,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:19,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:05:19,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2023-11-06 23:05:19,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:19,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2023-11-06 23:05:19,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:19,228 INFO L124 PetriNetUnfolderBase]: 235/438 cut-off events. [2023-11-06 23:05:19,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:19,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 438 events. 235/438 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2018 event pairs, 27 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 852. Up to 337 conditions per place. [2023-11-06 23:05:19,234 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 22 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-11-06 23:05:19,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 120 flow [2023-11-06 23:05:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:05:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-06 23:05:19,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47553516819571867 [2023-11-06 23:05:19,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-06 23:05:19,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-06 23:05:19,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:19,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-06 23:05:19,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,245 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 311 transitions. [2023-11-06 23:05:19,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 120 flow [2023-11-06 23:05:19,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:05:19,247 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-11-06 23:05:19,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-06 23:05:19,248 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-11-06 23:05:19,248 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-11-06 23:05:19,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:19,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:19,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:05:19,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:19,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1608976314, now seen corresponding path program 1 times [2023-11-06 23:05:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015823678] [2023-11-06 23:05:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015823678] [2023-11-06 23:05:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015823678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:19,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460839226] [2023-11-06 23:05:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:19,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:19,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 218 [2023-11-06 23:05:19,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:19,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 218 [2023-11-06 23:05:19,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:19,758 INFO L124 PetriNetUnfolderBase]: 306/519 cut-off events. [2023-11-06 23:05:19,759 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-06 23:05:19,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 519 events. 306/519 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1952 event pairs, 115 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 1082. Up to 431 conditions per place. [2023-11-06 23:05:19,764 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 34 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2023-11-06 23:05:19,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 184 flow [2023-11-06 23:05:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:05:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-11-06 23:05:19,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43944954128440367 [2023-11-06 23:05:19,768 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-11-06 23:05:19,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-11-06 23:05:19,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:19,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-11-06 23:05:19,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,776 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 5 states and 479 transitions. [2023-11-06 23:05:19,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 184 flow [2023-11-06 23:05:19,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:19,778 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 98 flow [2023-11-06 23:05:19,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-11-06 23:05:19,779 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-06 23:05:19,779 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 98 flow [2023-11-06 23:05:19,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:19,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:19,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:19,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:05:19,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:19,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1608976337, now seen corresponding path program 1 times [2023-11-06 23:05:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:19,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80362657] [2023-11-06 23:05:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:20,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80362657] [2023-11-06 23:05:20,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80362657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:20,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:20,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690642906] [2023-11-06 23:05:20,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:20,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:20,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:20,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 218 [2023-11-06 23:05:20,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:20,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 218 [2023-11-06 23:05:20,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:20,339 INFO L124 PetriNetUnfolderBase]: 306/576 cut-off events. [2023-11-06 23:05:20,339 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2023-11-06 23:05:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 576 events. 306/576 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2619 event pairs, 261 based on Foata normal form. 46/620 useless extension candidates. Maximal degree in co-relation 1422. Up to 331 conditions per place. [2023-11-06 23:05:20,344 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 30 selfloop transitions, 3 changer transitions 3/37 dead transitions. [2023-11-06 23:05:20,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 202 flow [2023-11-06 23:05:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-11-06 23:05:20,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41743119266055045 [2023-11-06 23:05:20,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-11-06 23:05:20,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-11-06 23:05:20,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:20,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-11-06 23:05:20,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,353 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 98 flow. Second operand 4 states and 364 transitions. [2023-11-06 23:05:20,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 202 flow [2023-11-06 23:05:20,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:05:20,357 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 92 flow [2023-11-06 23:05:20,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-11-06 23:05:20,359 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-11-06 23:05:20,359 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 92 flow [2023-11-06 23:05:20,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:20,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:20,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:05:20,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:20,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1822130119, now seen corresponding path program 1 times [2023-11-06 23:05:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538012304] [2023-11-06 23:05:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538012304] [2023-11-06 23:05:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538012304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861324105] [2023-11-06 23:05:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:20,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:05:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:05:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:05:20,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 218 [2023-11-06 23:05:20,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:20,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 218 [2023-11-06 23:05:20,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:20,769 INFO L124 PetriNetUnfolderBase]: 356/632 cut-off events. [2023-11-06 23:05:20,769 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2023-11-06 23:05:20,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1600 conditions, 632 events. 356/632 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2627 event pairs, 110 based on Foata normal form. 36/668 useless extension candidates. Maximal degree in co-relation 1590. Up to 437 conditions per place. [2023-11-06 23:05:20,775 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 32 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2023-11-06 23:05:20,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 218 flow [2023-11-06 23:05:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:05:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2023-11-06 23:05:20,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43394495412844036 [2023-11-06 23:05:20,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 473 transitions. [2023-11-06 23:05:20,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 473 transitions. [2023-11-06 23:05:20,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:20,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 473 transitions. [2023-11-06 23:05:20,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,809 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,809 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 92 flow. Second operand 5 states and 473 transitions. [2023-11-06 23:05:20,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 218 flow [2023-11-06 23:05:20,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 200 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 23:05:20,813 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 128 flow [2023-11-06 23:05:20,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-06 23:05:20,814 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-11-06 23:05:20,815 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 128 flow [2023-11-06 23:05:20,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:20,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:20,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:20,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:05:20,816 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:20,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1503480045, now seen corresponding path program 1 times [2023-11-06 23:05:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345515909] [2023-11-06 23:05:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345515909] [2023-11-06 23:05:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345515909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:21,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:21,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:21,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891079430] [2023-11-06 23:05:21,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:21,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:21,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:21,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 218 [2023-11-06 23:05:21,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:21,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 218 [2023-11-06 23:05:21,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:21,211 INFO L124 PetriNetUnfolderBase]: 275/533 cut-off events. [2023-11-06 23:05:21,211 INFO L125 PetriNetUnfolderBase]: For 379/379 co-relation queries the response was YES. [2023-11-06 23:05:21,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 533 events. 275/533 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2434 event pairs, 190 based on Foata normal form. 15/546 useless extension candidates. Maximal degree in co-relation 1406. Up to 411 conditions per place. [2023-11-06 23:05:21,217 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 27 selfloop transitions, 4 changer transitions 9/41 dead transitions. [2023-11-06 23:05:21,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 248 flow [2023-11-06 23:05:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:05:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-11-06 23:05:21,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504587155963303 [2023-11-06 23:05:21,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-11-06 23:05:21,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-11-06 23:05:21,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:21,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-11-06 23:05:21,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,226 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,226 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 128 flow. Second operand 5 states and 491 transitions. [2023-11-06 23:05:21,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 248 flow [2023-11-06 23:05:21,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 242 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-06 23:05:21,231 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 142 flow [2023-11-06 23:05:21,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2023-11-06 23:05:21,232 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-11-06 23:05:21,233 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 142 flow [2023-11-06 23:05:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:21,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:21,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:05:21,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:21,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2018248800, now seen corresponding path program 1 times [2023-11-06 23:05:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840955528] [2023-11-06 23:05:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840955528] [2023-11-06 23:05:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840955528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536716072] [2023-11-06 23:05:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:21,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:21,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:21,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 218 [2023-11-06 23:05:21,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:21,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 218 [2023-11-06 23:05:21,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:21,653 INFO L124 PetriNetUnfolderBase]: 216/435 cut-off events. [2023-11-06 23:05:21,654 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2023-11-06 23:05:21,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 435 events. 216/435 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1988 event pairs, 144 based on Foata normal form. 24/453 useless extension candidates. Maximal degree in co-relation 1146. Up to 401 conditions per place. [2023-11-06 23:05:21,658 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 17 selfloop transitions, 3 changer transitions 2/26 dead transitions. [2023-11-06 23:05:21,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 26 transitions, 171 flow [2023-11-06 23:05:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2023-11-06 23:05:21,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40711009174311924 [2023-11-06 23:05:21,661 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 355 transitions. [2023-11-06 23:05:21,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 355 transitions. [2023-11-06 23:05:21,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:21,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 355 transitions. [2023-11-06 23:05:21,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,666 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 142 flow. Second operand 4 states and 355 transitions. [2023-11-06 23:05:21,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 26 transitions, 171 flow [2023-11-06 23:05:21,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 153 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-11-06 23:05:21,670 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 95 flow [2023-11-06 23:05:21,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2023-11-06 23:05:21,672 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-11-06 23:05:21,672 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 95 flow [2023-11-06 23:05:21,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:21,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:21,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:05:21,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:21,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1529165726, now seen corresponding path program 1 times [2023-11-06 23:05:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549875823] [2023-11-06 23:05:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549875823] [2023-11-06 23:05:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549875823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:21,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916367777] [2023-11-06 23:05:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:21,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:21,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:21,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:05:21,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2023-11-06 23:05:21,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:21,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2023-11-06 23:05:21,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:21,969 INFO L124 PetriNetUnfolderBase]: 71/181 cut-off events. [2023-11-06 23:05:21,970 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-11-06 23:05:21,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 181 events. 71/181 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 697 event pairs, 22 based on Foata normal form. 22/202 useless extension candidates. Maximal degree in co-relation 467. Up to 128 conditions per place. [2023-11-06 23:05:21,972 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-11-06 23:05:21,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 175 flow [2023-11-06 23:05:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:05:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-11-06 23:05:21,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602446483180428 [2023-11-06 23:05:21,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-11-06 23:05:21,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-11-06 23:05:21,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:21,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-11-06 23:05:21,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,979 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 95 flow. Second operand 3 states and 301 transitions. [2023-11-06 23:05:21,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 175 flow [2023-11-06 23:05:21,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 162 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-06 23:05:21,981 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 103 flow [2023-11-06 23:05:21,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-06 23:05:21,982 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-11-06 23:05:21,982 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 103 flow [2023-11-06 23:05:21,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:21,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:21,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:21,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:05:21,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:21,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 866285899, now seen corresponding path program 1 times [2023-11-06 23:05:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302167838] [2023-11-06 23:05:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:21,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302167838] [2023-11-06 23:05:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302167838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:22,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864518574] [2023-11-06 23:05:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:22,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:22,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 218 [2023-11-06 23:05:22,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:22,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 218 [2023-11-06 23:05:22,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:22,384 INFO L124 PetriNetUnfolderBase]: 29/95 cut-off events. [2023-11-06 23:05:22,384 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 23:05:22,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 95 events. 29/95 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 291 event pairs, 14 based on Foata normal form. 14/108 useless extension candidates. Maximal degree in co-relation 282. Up to 45 conditions per place. [2023-11-06 23:05:22,385 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 21 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-11-06 23:05:22,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 177 flow [2023-11-06 23:05:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-11-06 23:05:22,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506880733944954 [2023-11-06 23:05:22,388 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-11-06 23:05:22,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-11-06 23:05:22,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:22,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-11-06 23:05:22,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,393 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,393 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 103 flow. Second operand 4 states and 393 transitions. [2023-11-06 23:05:22,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 177 flow [2023-11-06 23:05:22,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 160 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 23:05:22,395 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 103 flow [2023-11-06 23:05:22,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-11-06 23:05:22,396 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-06 23:05:22,396 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 103 flow [2023-11-06 23:05:22,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:22,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:22,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:05:22,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:22,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash 236190694, now seen corresponding path program 1 times [2023-11-06 23:05:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675432961] [2023-11-06 23:05:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675432961] [2023-11-06 23:05:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675432961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:05:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657948790] [2023-11-06 23:05:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:05:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:05:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:05:22,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 218 [2023-11-06 23:05:22,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:22,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 218 [2023-11-06 23:05:22,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:22,788 INFO L124 PetriNetUnfolderBase]: 37/121 cut-off events. [2023-11-06 23:05:22,788 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-06 23:05:22,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 121 events. 37/121 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 435 event pairs, 10 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 356. Up to 65 conditions per place. [2023-11-06 23:05:22,789 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 19 selfloop transitions, 1 changer transitions 18/39 dead transitions. [2023-11-06 23:05:22,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 244 flow [2023-11-06 23:05:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:05:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-11-06 23:05:22,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43669724770642204 [2023-11-06 23:05:22,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-11-06 23:05:22,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-11-06 23:05:22,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:22,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-11-06 23:05:22,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,798 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,798 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 103 flow. Second operand 5 states and 476 transitions. [2023-11-06 23:05:22,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 244 flow [2023-11-06 23:05:22,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 225 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:22,800 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 81 flow [2023-11-06 23:05:22,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2023-11-06 23:05:22,801 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-06 23:05:22,801 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 81 flow [2023-11-06 23:05:22,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:22,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:22,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:22,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:05:22,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:22,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1743021986, now seen corresponding path program 2 times [2023-11-06 23:05:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888696430] [2023-11-06 23:05:22,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888696430] [2023-11-06 23:05:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888696430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:24,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:05:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366497780] [2023-11-06 23:05:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:24,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:05:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:05:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:05:24,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 218 [2023-11-06 23:05:24,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 19 transitions, 81 flow. Second operand has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:24,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:24,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 218 [2023-11-06 23:05:24,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:24,878 INFO L124 PetriNetUnfolderBase]: 10/48 cut-off events. [2023-11-06 23:05:24,878 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-06 23:05:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 48 events. 10/48 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 3 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 148. Up to 15 conditions per place. [2023-11-06 23:05:24,879 INFO L140 encePairwiseOnDemand]: 210/218 looper letters, 13 selfloop transitions, 4 changer transitions 13/32 dead transitions. [2023-11-06 23:05:24,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 198 flow [2023-11-06 23:05:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:05:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:05:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 792 transitions. [2023-11-06 23:05:24,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4036697247706422 [2023-11-06 23:05:24,884 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 792 transitions. [2023-11-06 23:05:24,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 792 transitions. [2023-11-06 23:05:24,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:24,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 792 transitions. [2023-11-06 23:05:24,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:24,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:24,893 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:24,893 INFO L175 Difference]: Start difference. First operand has 40 places, 19 transitions, 81 flow. Second operand 9 states and 792 transitions. [2023-11-06 23:05:24,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 198 flow [2023-11-06 23:05:24,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 182 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-06 23:05:24,896 INFO L231 Difference]: Finished difference. Result has 44 places, 19 transitions, 88 flow [2023-11-06 23:05:24,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=19} [2023-11-06 23:05:24,897 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-11-06 23:05:24,897 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 19 transitions, 88 flow [2023-11-06 23:05:24,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:24,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:24,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:24,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:05:24,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:24,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 454220122, now seen corresponding path program 3 times [2023-11-06 23:05:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458681576] [2023-11-06 23:05:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:05:24,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:05:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:05:25,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:05:25,009 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:05:25,010 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-06 23:05:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-06 23:05:25,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 23:05:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-06 23:05:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 23:05:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 23:05:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 23:05:25,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-06 23:05:25,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-06 23:05:25,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 23:05:25,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:05:25,014 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:25,020 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:05:25,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:05:25,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:05:25 BasicIcfg [2023-11-06 23:05:25,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:05:25,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:05:25,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:05:25,075 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:05:25,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:13" (3/4) ... [2023-11-06 23:05:25,077 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:05:25,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:05:25,079 INFO L158 Benchmark]: Toolchain (without parser) took 13598.28ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 116.3MB in the beginning and 151.9MB in the end (delta: -35.6MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2023-11-06 23:05:25,080 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 159.4MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:25,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.45ms. Allocated memory is still 159.4MB. Free memory was 116.3MB in the beginning and 92.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:25,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 89.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:05:25,081 INFO L158 Benchmark]: Boogie Preprocessor took 73.69ms. Allocated memory is still 159.4MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:25,081 INFO L158 Benchmark]: RCFGBuilder took 956.95ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 113.4MB in the end (delta: -25.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2023-11-06 23:05:25,081 INFO L158 Benchmark]: TraceAbstraction took 11756.73ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 112.7MB in the beginning and 151.9MB in the end (delta: -39.2MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2023-11-06 23:05:25,082 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 268.4MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:25,084 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 159.4MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.45ms. Allocated memory is still 159.4MB. Free memory was 116.3MB in the beginning and 92.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 89.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.69ms. Allocated memory is still 159.4MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 956.95ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 113.4MB in the end (delta: -25.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11756.73ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 112.7MB in the beginning and 151.9MB in the end (delta: -39.2MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 268.4MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 109 PlacesBefore, 32 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 4236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2291, independent: 2135, independent conditional: 0, independent unconditional: 2135, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 817, independent: 795, independent conditional: 0, independent unconditional: 795, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2291, independent: 1340, independent conditional: 0, independent unconditional: 1340, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 817, unknown conditional: 0, unknown unconditional: 817] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix000.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=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: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 125 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 108 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:05:25,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP --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 fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:05:27,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:05:27,905 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:05:27,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:05:27,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:05:27,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:05:27,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:05:27,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:05:27,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:05:27,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:05:27,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:05:27,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:05:27,981 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:05:27,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:05:27,984 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:05:27,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:05:27,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:05:27,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:05:27,986 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:05:27,987 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:05:27,987 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:05:27,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:05:27,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:05:27,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:05:27,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:05:27,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:05:27,991 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:05:27,991 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:05:27,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:05:27,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:05:27,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:05:27,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:27,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:05:27,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:05:27,996 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:05:27,996 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:05:27,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:05:27,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:05:27,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:05:27,999 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:05:27,999 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:05:28,000 INFO L153 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_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/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_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP 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 -> fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 [2023-11-06 23:05:28,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:05:28,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:05:28,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:05:28,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:05:28,482 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:05:28,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix000.opt.i [2023-11-06 23:05:31,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:05:32,157 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:05:32,158 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/sv-benchmarks/c/pthread-wmm/mix000.opt.i [2023-11-06 23:05:32,198 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data/03c4990ed/6d3bb8138f7747f19ff5942e1fe58c00/FLAG9821817d6 [2023-11-06 23:05:32,215 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/data/03c4990ed/6d3bb8138f7747f19ff5942e1fe58c00 [2023-11-06 23:05:32,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:05:32,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:05:32,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:32,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:05:32,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:05:32,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:32" (1/1) ... [2023-11-06 23:05:32,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557e4b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:32, skipping insertion in model container [2023-11-06 23:05:32,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:32" (1/1) ... [2023-11-06 23:05:32,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:05:32,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:32,879 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:05:32,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:33,051 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:05:33,051 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:05:33,059 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:05:33,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33 WrapperNode [2023-11-06 23:05:33,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:33,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:33,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:05:33,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:05:33,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,153 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-11-06 23:05:33,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:33,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:05:33,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:05:33,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:05:33,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:05:33,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:05:33,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:05:33,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:05:33,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (1/1) ... [2023-11-06 23:05:33,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:33,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:05:33,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:05:33,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:05:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:05:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:05:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:05:33,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:05:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:05:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:05:33,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:05:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:05:33,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:05:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:05:33,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:05:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:05:33,299 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:05:33,453 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:05:33,455 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:05:33,860 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:05:34,039 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:05:34,040 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:05:34,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:34 BoogieIcfgContainer [2023-11-06 23:05:34,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:05:34,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:05:34,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:05:34,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:05:34,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:05:32" (1/3) ... [2023-11-06 23:05:34,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3e36cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:34, skipping insertion in model container [2023-11-06 23:05:34,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:33" (2/3) ... [2023-11-06 23:05:34,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3e36cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:34, skipping insertion in model container [2023-11-06 23:05:34,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:34" (3/3) ... [2023-11-06 23:05:34,055 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-11-06 23:05:34,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:05:34,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-06 23:05:34,075 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:05:34,144 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:05:34,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 108 transitions, 224 flow [2023-11-06 23:05:34,269 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-06 23:05:34,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:34,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-06 23:05:34,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 108 transitions, 224 flow [2023-11-06 23:05:34,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 106 transitions, 218 flow [2023-11-06 23:05:34,285 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:05:34,315 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 106 transitions, 218 flow [2023-11-06 23:05:34,319 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 106 transitions, 218 flow [2023-11-06 23:05:34,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 106 transitions, 218 flow [2023-11-06 23:05:34,372 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-06 23:05:34,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:34,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-11-06 23:05:34,377 INFO L119 LiptonReduction]: Number of co-enabled transitions 1500 [2023-11-06 23:05:41,838 INFO L134 LiptonReduction]: Checked pairs total: 3992 [2023-11-06 23:05:41,838 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-06 23:05:41,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:05:41,860 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;@4d24033a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:05:41,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 23:05:41,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:05:41,863 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 23:05:41,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:41,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:41,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:05:41,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:41,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 532, now seen corresponding path program 1 times [2023-11-06 23:05:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207204408] [2023-11-06 23:05:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:41,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:41,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:41,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 23:05:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:41,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:05:41,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:41,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:41,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:05:41,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207204408] [2023-11-06 23:05:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207204408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:05:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376565744] [2023-11-06 23:05:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:42,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:05:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:05:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:05:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:05:42,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 225 [2023-11-06 23:05:42,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:42,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 225 [2023-11-06 23:05:42,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:42,273 INFO L124 PetriNetUnfolderBase]: 249/434 cut-off events. [2023-11-06 23:05:42,273 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 23:05:42,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 434 events. 249/434 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1802 event pairs, 249 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 864. Up to 427 conditions per place. [2023-11-06 23:05:42,281 INFO L140 encePairwiseOnDemand]: 220/225 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-11-06 23:05:42,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-11-06 23:05:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:05:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:05:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 215 transitions. [2023-11-06 23:05:42,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2023-11-06 23:05:42,294 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 215 transitions. [2023-11-06 23:05:42,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 215 transitions. [2023-11-06 23:05:42,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:42,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 215 transitions. [2023-11-06 23:05:42,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,310 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,312 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 215 transitions. [2023-11-06 23:05:42,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-11-06 23:05:42,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:42,317 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-11-06 23:05:42,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-11-06 23:05:42,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-11-06 23:05:42,324 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-11-06 23:05:42,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:42,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:05:42,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 23:05:42,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:42,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:42,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 504265429, now seen corresponding path program 1 times [2023-11-06 23:05:42,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:42,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578335276] [2023-11-06 23:05:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:42,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:42,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:42,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:42,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 23:05:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:42,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:05:42,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:42,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:42,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:05:42,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578335276] [2023-11-06 23:05:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578335276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:42,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:42,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:05:42,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427427883] [2023-11-06 23:05:42,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:42,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:42,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:05:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:05:42,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 225 [2023-11-06 23:05:42,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:42,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 225 [2023-11-06 23:05:42,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:42,876 INFO L124 PetriNetUnfolderBase]: 204/383 cut-off events. [2023-11-06 23:05:42,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:05:42,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 383 events. 204/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1696 event pairs, 24 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 746. Up to 293 conditions per place. [2023-11-06 23:05:42,881 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-06 23:05:42,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2023-11-06 23:05:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:05:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-11-06 23:05:42,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2023-11-06 23:05:42,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-11-06 23:05:42,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-11-06 23:05:42,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:42,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-11-06 23:05:42,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,894 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 312 transitions. [2023-11-06 23:05:42,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2023-11-06 23:05:42,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:05:42,896 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-11-06 23:05:42,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-11-06 23:05:42,897 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-11-06 23:05:42,897 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-11-06 23:05:42,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:42,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:42,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:42,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:43,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:43,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:43,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash -732157133, now seen corresponding path program 1 times [2023-11-06 23:05:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886060637] [2023-11-06 23:05:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:43,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:43,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:43,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 23:05:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:43,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:05:43,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:43,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:43,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:05:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886060637] [2023-11-06 23:05:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886060637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:43,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689406239] [2023-11-06 23:05:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:43,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:05:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:05:43,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 225 [2023-11-06 23:05:43,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:43,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 225 [2023-11-06 23:05:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:43,402 INFO L124 PetriNetUnfolderBase]: 53/127 cut-off events. [2023-11-06 23:05:43,403 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-06 23:05:43,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 127 events. 53/127 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 403 event pairs, 15 based on Foata normal form. 12/130 useless extension candidates. Maximal degree in co-relation 269. Up to 94 conditions per place. [2023-11-06 23:05:43,406 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-06 23:05:43,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 116 flow [2023-11-06 23:05:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:05:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-11-06 23:05:43,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2023-11-06 23:05:43,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-11-06 23:05:43,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-11-06 23:05:43,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:43,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-11-06 23:05:43,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,422 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 3 states and 305 transitions. [2023-11-06 23:05:43,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 116 flow [2023-11-06 23:05:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:43,423 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 59 flow [2023-11-06 23:05:43,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-11-06 23:05:43,426 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-11-06 23:05:43,426 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 59 flow [2023-11-06 23:05:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:43,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:43,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:43,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:43,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:43,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash -24608748, now seen corresponding path program 1 times [2023-11-06 23:05:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769890694] [2023-11-06 23:05:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:43,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:43,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:43,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:43,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 23:05:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:43,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:05:43,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:43,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:43,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:05:43,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769890694] [2023-11-06 23:05:43,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769890694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:43,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:43,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401047823] [2023-11-06 23:05:43,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:43,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:05:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:43,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 225 [2023-11-06 23:05:43,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:43,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 225 [2023-11-06 23:05:43,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:43,976 INFO L124 PetriNetUnfolderBase]: 18/57 cut-off events. [2023-11-06 23:05:43,976 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 23:05:43,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 57 events. 18/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 121 event pairs, 10 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 141. Up to 29 conditions per place. [2023-11-06 23:05:43,977 INFO L140 encePairwiseOnDemand]: 221/225 looper letters, 20 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-11-06 23:05:43,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 125 flow [2023-11-06 23:05:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-11-06 23:05:43,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44222222222222224 [2023-11-06 23:05:43,981 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-11-06 23:05:43,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-11-06 23:05:43,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:43,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-11-06 23:05:43,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:43,992 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 59 flow. Second operand 4 states and 398 transitions. [2023-11-06 23:05:43,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 125 flow [2023-11-06 23:05:43,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:05:43,995 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 72 flow [2023-11-06 23:05:43,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-06 23:05:43,997 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-11-06 23:05:44,003 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 72 flow [2023-11-06 23:05:44,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:44,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:44,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:44,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/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)] Ended with exit code 0 [2023-11-06 23:05:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:44,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:44,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 643451819, now seen corresponding path program 1 times [2023-11-06 23:05:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128121154] [2023-11-06 23:05:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:44,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:44,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:44,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 23:05:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:44,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:05:44,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:44,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:44,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:05:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128121154] [2023-11-06 23:05:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128121154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:44,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837828217] [2023-11-06 23:05:44,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:44,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:05:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:44,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:44,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 225 [2023-11-06 23:05:44,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:44,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:44,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 225 [2023-11-06 23:05:44,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:44,590 INFO L124 PetriNetUnfolderBase]: 24/83 cut-off events. [2023-11-06 23:05:44,590 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-06 23:05:44,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 83 events. 24/83 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 247 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 214. Up to 47 conditions per place. [2023-11-06 23:05:44,592 INFO L140 encePairwiseOnDemand]: 222/225 looper letters, 34 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-06 23:05:44,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 209 flow [2023-11-06 23:05:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 401 transitions. [2023-11-06 23:05:44,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44555555555555554 [2023-11-06 23:05:44,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 401 transitions. [2023-11-06 23:05:44,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 401 transitions. [2023-11-06 23:05:44,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:44,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 401 transitions. [2023-11-06 23:05:44,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:44,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:44,601 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:44,601 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 72 flow. Second operand 4 states and 401 transitions. [2023-11-06 23:05:44,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 209 flow [2023-11-06 23:05:44,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 190 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:44,603 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 75 flow [2023-11-06 23:05:44,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-11-06 23:05:44,604 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-11-06 23:05:44,605 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 75 flow [2023-11-06 23:05:44,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:44,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:44,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:44,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:44,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:44,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:44,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 218532069, now seen corresponding path program 2 times [2023-11-06 23:05:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:44,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005948604] [2023-11-06 23:05:44,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:05:44,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:44,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:44,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:44,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 23:05:44,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:05:44,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:05:44,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 23:05:44,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:05:46,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:05:46,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:05:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005948604] [2023-11-06 23:05:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005948604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:05:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702906873] [2023-11-06 23:05:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:46,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:05:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:05:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:05:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:05:46,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 225 [2023-11-06 23:05:46,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 75 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:46,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:46,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 225 [2023-11-06 23:05:46,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:46,421 INFO L124 PetriNetUnfolderBase]: 22/92 cut-off events. [2023-11-06 23:05:46,421 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-06 23:05:46,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 92 events. 22/92 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 290 event pairs, 6 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 254. Up to 29 conditions per place. [2023-11-06 23:05:46,422 INFO L140 encePairwiseOnDemand]: 219/225 looper letters, 30 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2023-11-06 23:05:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 216 flow [2023-11-06 23:05:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:05:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:05:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2023-11-06 23:05:46,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4203174603174603 [2023-11-06 23:05:46,429 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2023-11-06 23:05:46,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2023-11-06 23:05:46,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:46,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2023-11-06 23:05:46,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:46,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:46,439 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:46,439 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 75 flow. Second operand 7 states and 662 transitions. [2023-11-06 23:05:46,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 216 flow [2023-11-06 23:05:46,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:05:46,443 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 93 flow [2023-11-06 23:05:46,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2023-11-06 23:05:46,449 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-11-06 23:05:46,450 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 93 flow [2023-11-06 23:05:46,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:05:46,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:46,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:46,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:46,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:46,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-06 23:05:46,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 841473981, now seen corresponding path program 3 times [2023-11-06 23:05:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:05:46,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164099672] [2023-11-06 23:05:46,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:05:46,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:46,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:05:46,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:05:46,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 23:05:46,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:05:46,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:05:46,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:05:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:05:46,933 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:05:46,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:05:46,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-06 23:05:46,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-06 23:05:46,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 23:05:46,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-06 23:05:46,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 23:05:46,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 23:05:46,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 23:05:46,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-06 23:05:46,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-06 23:05:46,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 23:05:46,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:47,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:05:47,151 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-06 23:05:47,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:05:47,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:05:47,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:05:47 BasicIcfg [2023-11-06 23:05:47,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:05:47,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:05:47,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:05:47,214 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:05:47,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:34" (3/4) ... [2023-11-06 23:05:47,216 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:05:47,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:05:47,218 INFO L158 Benchmark]: Toolchain (without parser) took 14993.74ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 78.9MB in the beginning and 75.9MB in the end (delta: 3.0MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2023-11-06 23:05:47,219 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 73.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:47,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.45ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 77.6MB in the end (delta: 984.8kB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-11-06 23:05:47,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.51ms. Allocated memory is still 104.9MB. Free memory was 77.6MB in the beginning and 74.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:47,220 INFO L158 Benchmark]: Boogie Preprocessor took 55.37ms. Allocated memory is still 104.9MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:47,221 INFO L158 Benchmark]: RCFGBuilder took 832.51ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 62.2MB in the end (delta: 10.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2023-11-06 23:05:47,221 INFO L158 Benchmark]: TraceAbstraction took 13168.22ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 61.8MB in the beginning and 75.9MB in the end (delta: -14.1MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:47,221 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 151.0MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:47,224 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 73.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.45ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 77.6MB in the end (delta: 984.8kB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.51ms. Allocated memory is still 104.9MB. Free memory was 77.6MB in the beginning and 74.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.37ms. Allocated memory is still 104.9MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 832.51ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 62.2MB in the end (delta: 10.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13168.22ms. Allocated memory was 104.9MB in the beginning and 151.0MB in the end (delta: 46.1MB). Free memory was 61.8MB in the beginning and 75.9MB in the end (delta: -14.1MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 151.0MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 110 PlacesBefore, 31 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 3992 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2298, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 845, independent: 817, independent conditional: 0, independent unconditional: 817, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2298, independent: 1344, independent conditional: 0, independent unconditional: 1344, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 845, unknown conditional: 0, unknown unconditional: 845] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=0, t0={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=1, t0={3:0}, t1={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={3:0}, t1={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix000.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=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: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 126 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 18 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=6, InterpolantAutomatonStates: 23, 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.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 295 SizeOfPredicates, 3 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:05:47,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_381cc67a-e123-4c73-bb0b-bdbb6633dae0/bin/uautomizer-verify-WvqO1wxjHP/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