./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:04:40,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:04:40,684 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:04:40,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:04:40,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:04:40,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:04:40,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:04:40,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:04:40,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:04:40,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:04:40,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:04:40,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:04:40,737 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:04:40,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:04:40,739 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:04:40,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:04:40,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:04:40,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:04:40,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:04:40,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:04:40,743 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:04:40,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:04:40,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:04:40,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:04:40,750 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:04:40,750 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:04:40,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:04:40,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:04:40,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:04:40,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:40,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:04:40,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:04:40,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:04:40,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:04:40,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:04:40,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:04:40,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:04:40,766 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:04:40,766 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_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2023-11-12 02:04:41,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:04:41,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:04:41,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:04:41,156 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:04:41,157 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:04:41,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-12 02:04:44,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:04:44,523 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:04:44,523 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-12 02:04:44,543 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data/ec28b3a4d/99c111946d924abaaaec22efa19aadb6/FLAG54f25b490 [2023-11-12 02:04:44,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data/ec28b3a4d/99c111946d924abaaaec22efa19aadb6 [2023-11-12 02:04:44,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:04:44,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:04:44,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:44,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:04:44,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:04:44,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:44" (1/1) ... [2023-11-12 02:04:44,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dff96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:44, skipping insertion in model container [2023-11-12 02:04:44,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:44" (1/1) ... [2023-11-12 02:04:44,646 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:04:45,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:45,112 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:04:45,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:45,225 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:04:45,226 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:04:45,235 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:04:45,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45 WrapperNode [2023-11-12 02:04:45,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:45,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:45,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:04:45,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:04:45,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,302 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2023-11-12 02:04:45,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:45,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:04:45,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:04:45,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:04:45,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:04:45,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:04:45,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:04:45,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:04:45,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (1/1) ... [2023-11-12 02:04:45,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:45,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:45,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:04:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:04:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:04:45,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:04:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:04:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:04:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:04:45,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:04:45,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:04:45,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:04:45,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:04:45,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:04:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:04:45,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:04:45,532 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:04:45,762 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:04:45,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:04:46,084 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:04:46,253 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:04:46,254 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:04:46,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:46 BoogieIcfgContainer [2023-11-12 02:04:46,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:04:46,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:04:46,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:04:46,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:04:46,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:04:44" (1/3) ... [2023-11-12 02:04:46,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603c8217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:46, skipping insertion in model container [2023-11-12 02:04:46,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:45" (2/3) ... [2023-11-12 02:04:46,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603c8217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:46, skipping insertion in model container [2023-11-12 02:04:46,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:46" (3/3) ... [2023-11-12 02:04:46,267 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-11-12 02:04:46,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:04:46,289 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-12 02:04:46,289 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:04:46,349 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:04:46,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 230 flow [2023-11-12 02:04:46,452 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-11-12 02:04:46,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:04:46,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 3/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-12 02:04:46,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 230 flow [2023-11-12 02:04:46,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 109 transitions, 224 flow [2023-11-12 02:04:46,469 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:04:46,480 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 109 transitions, 224 flow [2023-11-12 02:04:46,484 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 109 transitions, 224 flow [2023-11-12 02:04:46,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 224 flow [2023-11-12 02:04:46,515 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-11-12 02:04:46,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:04:46,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 3/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-12 02:04:46,519 INFO L119 LiptonReduction]: Number of co-enabled transitions 1708 [2023-11-12 02:04:51,471 INFO L134 LiptonReduction]: Checked pairs total: 4224 [2023-11-12 02:04:51,472 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-12 02:04:51,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:04:51,513 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;@51de4e05, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:04:51,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-12 02:04:51,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:04:51,515 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:04:51,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:04:51,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:51,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:04:51,517 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-12 02:04:51,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 1 times [2023-11-12 02:04:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611937275] [2023-11-12 02:04:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:51,649 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-12 02:04:51,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611937275] [2023-11-12 02:04:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611937275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:51,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:51,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:04:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043619877] [2023-11-12 02:04:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:51,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:04:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:04:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:04:51,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 226 [2023-11-12 02:04:51,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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-12 02:04:51,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:51,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 226 [2023-11-12 02:04:51,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:51,853 INFO L124 PetriNetUnfolderBase]: 249/437 cut-off events. [2023-11-12 02:04:51,854 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:04:51,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 437 events. 249/437 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1824 event pairs, 249 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 867. Up to 427 conditions per place. [2023-11-12 02:04:51,860 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-11-12 02:04:51,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-11-12 02:04:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:04:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:04:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 223 transitions. [2023-11-12 02:04:51,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49336283185840707 [2023-11-12 02:04:51,877 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 223 transitions. [2023-11-12 02:04:51,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 223 transitions. [2023-11-12 02:04:51,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:51,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 223 transitions. [2023-11-12 02:04:51,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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-12 02:04:51,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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-12 02:04:51,891 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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-12 02:04:51,893 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 223 transitions. [2023-11-12 02:04:51,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-11-12 02:04:51,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:51,898 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-11-12 02:04:51,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, 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-12 02:04:51,903 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-11-12 02:04:51,904 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-11-12 02:04:51,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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-12 02:04:51,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:51,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:04:51,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:04:51,905 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-12 02:04:51,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 478472350, now seen corresponding path program 1 times [2023-11-12 02:04:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660205625] [2023-11-12 02:04:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:52,382 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-12 02:04:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660205625] [2023-11-12 02:04:52,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660205625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:52,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:52,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:04:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057584117] [2023-11-12 02:04:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:52,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:52,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 226 [2023-11-12 02:04:52,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-12 02:04:52,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:52,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 226 [2023-11-12 02:04:52,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:52,530 INFO L124 PetriNetUnfolderBase]: 204/383 cut-off events. [2023-11-12 02:04:52,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:04:52,536 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 31. Compared 1677 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-12 02:04:52,570 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-12 02:04:52,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2023-11-12 02:04:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:04:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-11-12 02:04:52,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778761061946903 [2023-11-12 02:04:52,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-11-12 02:04:52,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-11-12 02:04:52,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:52,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-11-12 02:04:52,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-12 02:04:52,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:52,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:52,590 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 324 transitions. [2023-11-12 02:04:52,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2023-11-12 02:04:52,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:04:52,595 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-11-12 02:04:52,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, 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-12 02:04:52,597 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-11-12 02:04:52,597 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-11-12 02:04:52,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-12 02:04:52,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:52,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:04:52,601 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-12 02:04:52,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 250511403, now seen corresponding path program 1 times [2023-11-12 02:04:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009071691] [2023-11-12 02:04:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:52,866 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-12 02:04:52,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:52,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009071691] [2023-11-12 02:04:52,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009071691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:52,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:52,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:04:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588294875] [2023-11-12 02:04:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:52,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:52,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:52,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 226 [2023-11-12 02:04:52,884 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-12 02:04:52,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:52,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 226 [2023-11-12 02:04:52,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:53,044 INFO L124 PetriNetUnfolderBase]: 321/560 cut-off events. [2023-11-12 02:04:53,045 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-12 02:04:53,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 560 events. 321/560 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2327 event pairs, 111 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1167. Up to 419 conditions per place. [2023-11-12 02:04:53,050 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2023-11-12 02:04:53,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 144 flow [2023-11-12 02:04:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:04:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-12 02:04:53,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616519174041298 [2023-11-12 02:04:53,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-12 02:04:53,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-12 02:04:53,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:53,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-12 02:04:53,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-12 02:04:53,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:53,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:53,058 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 3 states and 313 transitions. [2023-11-12 02:04:53,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 144 flow [2023-11-12 02:04:53,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:53,060 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 86 flow [2023-11-12 02:04:53,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-11-12 02:04:53,061 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-11-12 02:04:53,062 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 86 flow [2023-11-12 02:04:53,062 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-12 02:04:53,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:53,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:53,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:04:53,063 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-12 02:04:53,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash -824080547, now seen corresponding path program 1 times [2023-11-12 02:04:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819065247] [2023-11-12 02:04:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:53,298 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-12 02:04:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819065247] [2023-11-12 02:04:53,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819065247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:53,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093623909] [2023-11-12 02:04:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:53,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:04:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:04:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:53,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 226 [2023-11-12 02:04:53,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 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-12 02:04:53,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:53,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 226 [2023-11-12 02:04:53,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:53,676 INFO L124 PetriNetUnfolderBase]: 191/367 cut-off events. [2023-11-12 02:04:53,676 INFO L125 PetriNetUnfolderBase]: For 106/112 co-relation queries the response was YES. [2023-11-12 02:04:53,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 367 events. 191/367 cut-off events. For 106/112 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1545 event pairs, 60 based on Foata normal form. 52/419 useless extension candidates. Maximal degree in co-relation 921. Up to 220 conditions per place. [2023-11-12 02:04:53,680 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 16 selfloop transitions, 2 changer transitions 12/33 dead transitions. [2023-11-12 02:04:53,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 174 flow [2023-11-12 02:04:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:04:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2023-11-12 02:04:53,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41238938053097346 [2023-11-12 02:04:53,687 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 466 transitions. [2023-11-12 02:04:53,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 466 transitions. [2023-11-12 02:04:53,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:53,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 466 transitions. [2023-11-12 02:04:53,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 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-12 02:04:53,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 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-12 02:04:53,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 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-12 02:04:53,694 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 86 flow. Second operand 5 states and 466 transitions. [2023-11-12 02:04:53,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 174 flow [2023-11-12 02:04:53,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:53,701 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 60 flow [2023-11-12 02:04:53,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-12 02:04:53,703 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-12 02:04:53,703 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 60 flow [2023-11-12 02:04:53,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 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-12 02:04:53,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:53,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:53,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:04:53,704 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-12 02:04:53,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1140849031, now seen corresponding path program 1 times [2023-11-12 02:04:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075938684] [2023-11-12 02:04:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:53,911 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-12 02:04:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:53,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075938684] [2023-11-12 02:04:53,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075938684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:53,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:53,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:04:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580032031] [2023-11-12 02:04:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:53,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-11-12 02:04:53,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-12 02:04:53,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:53,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-11-12 02:04:53,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:54,008 INFO L124 PetriNetUnfolderBase]: 125/239 cut-off events. [2023-11-12 02:04:54,008 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-12 02:04:54,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 239 events. 125/239 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 811 event pairs, 44 based on Foata normal form. 6/244 useless extension candidates. Maximal degree in co-relation 553. Up to 148 conditions per place. [2023-11-12 02:04:54,010 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 17 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-11-12 02:04:54,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 112 flow [2023-11-12 02:04:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:04:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-12 02:04:54,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631268436578171 [2023-11-12 02:04:54,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-12 02:04:54,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-12 02:04:54,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:54,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-12 02:04:54,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-12 02:04:54,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:54,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:54,018 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 60 flow. Second operand 3 states and 314 transitions. [2023-11-12 02:04:54,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 112 flow [2023-11-12 02:04:54,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:54,020 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 68 flow [2023-11-12 02:04:54,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-12 02:04:54,023 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2023-11-12 02:04:54,023 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 68 flow [2023-11-12 02:04:54,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-12 02:04:54,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:54,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:54,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:04:54,024 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-12 02:04:54,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 220824705, now seen corresponding path program 1 times [2023-11-12 02:04:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558122404] [2023-11-12 02:04:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:54,218 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-12 02:04:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558122404] [2023-11-12 02:04:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558122404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:04:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610608426] [2023-11-12 02:04:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:54,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:54,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-11-12 02:04:54,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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-12 02:04:54,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:54,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-11-12 02:04:54,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:54,357 INFO L124 PetriNetUnfolderBase]: 127/240 cut-off events. [2023-11-12 02:04:54,358 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-12 02:04:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 240 events. 127/240 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 784 event pairs, 70 based on Foata normal form. 8/248 useless extension candidates. Maximal degree in co-relation 612. Up to 156 conditions per place. [2023-11-12 02:04:54,361 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 21 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-12 02:04:54,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 133 flow [2023-11-12 02:04:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:04:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-11-12 02:04:54,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4690265486725664 [2023-11-12 02:04:54,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-11-12 02:04:54,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-11-12 02:04:54,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:54,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-11-12 02:04:54,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:54,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 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-12 02:04:54,370 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 68 flow. Second operand 3 states and 318 transitions. [2023-11-12 02:04:54,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 133 flow [2023-11-12 02:04:54,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:54,372 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 73 flow [2023-11-12 02:04:54,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-12 02:04:54,374 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-11-12 02:04:54,374 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 73 flow [2023-11-12 02:04:54,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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-12 02:04:54,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:54,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:54,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:04:54,376 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-12 02:04:54,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1369320627, now seen corresponding path program 1 times [2023-11-12 02:04:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:54,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31684679] [2023-11-12 02:04:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:54,606 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-12 02:04:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31684679] [2023-11-12 02:04:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31684679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453047269] [2023-11-12 02:04:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:54,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:04:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:54,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-11-12 02:04:54,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 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-12 02:04:54,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:54,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-11-12 02:04:54,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:54,742 INFO L124 PetriNetUnfolderBase]: 67/154 cut-off events. [2023-11-12 02:04:54,742 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-12 02:04:54,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 154 events. 67/154 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 550 event pairs, 15 based on Foata normal form. 25/177 useless extension candidates. Maximal degree in co-relation 391. Up to 62 conditions per place. [2023-11-12 02:04:54,744 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 26 selfloop transitions, 5 changer transitions 9/43 dead transitions. [2023-11-12 02:04:54,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 224 flow [2023-11-12 02:04:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:04:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-11-12 02:04:54,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557522123893805 [2023-11-12 02:04:54,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-11-12 02:04:54,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-11-12 02:04:54,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:54,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-11-12 02:04:54,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 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-12 02:04:54,754 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 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-12 02:04:54,754 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 73 flow. Second operand 5 states and 515 transitions. [2023-11-12 02:04:54,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 224 flow [2023-11-12 02:04:54,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:54,756 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 104 flow [2023-11-12 02:04:54,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-11-12 02:04:54,758 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-11-12 02:04:54,758 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 104 flow [2023-11-12 02:04:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 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-12 02:04:54,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:54,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:54,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:04:54,759 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-12 02:04:54,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1825243268, now seen corresponding path program 1 times [2023-11-12 02:04:54,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:54,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104316812] [2023-11-12 02:04:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:54,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:54,950 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-12 02:04:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104316812] [2023-11-12 02:04:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104316812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91910151] [2023-11-12 02:04:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:54,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:04:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:54,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:04:54,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:54,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 226 [2023-11-12 02:04:54,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:54,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 226 [2023-11-12 02:04:54,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:55,100 INFO L124 PetriNetUnfolderBase]: 49/119 cut-off events. [2023-11-12 02:04:55,101 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-11-12 02:04:55,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 119 events. 49/119 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 402 event pairs, 11 based on Foata normal form. 9/127 useless extension candidates. Maximal degree in co-relation 371. Up to 37 conditions per place. [2023-11-12 02:04:55,102 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 24 selfloop transitions, 8 changer transitions 8/43 dead transitions. [2023-11-12 02:04:55,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 255 flow [2023-11-12 02:04:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:04:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:04:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2023-11-12 02:04:55,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44563843236409606 [2023-11-12 02:04:55,106 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2023-11-12 02:04:55,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2023-11-12 02:04:55,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:55,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2023-11-12 02:04:55,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 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-12 02:04:55,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12 02:04:55,114 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 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-12 02:04:55,114 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 104 flow. Second operand 7 states and 705 transitions. [2023-11-12 02:04:55,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 255 flow [2023-11-12 02:04:55,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 239 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:55,117 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 125 flow [2023-11-12 02:04:55,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2023-11-12 02:04:55,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-11-12 02:04:55,120 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 125 flow [2023-11-12 02:04:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:55,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:55,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:55,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:04:55,121 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-12 02:04:55,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 568147077, now seen corresponding path program 1 times [2023-11-12 02:04:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837786893] [2023-11-12 02:04:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:55,472 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-12 02:04:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837786893] [2023-11-12 02:04:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837786893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363982998] [2023-11-12 02:04:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:55,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:04:55,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:55,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 226 [2023-11-12 02:04:55,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:55,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:55,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 226 [2023-11-12 02:04:55,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:55,616 INFO L124 PetriNetUnfolderBase]: 86/191 cut-off events. [2023-11-12 02:04:55,616 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2023-11-12 02:04:55,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 191 events. 86/191 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 698 event pairs, 5 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 681. Up to 120 conditions per place. [2023-11-12 02:04:55,618 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 26 selfloop transitions, 9 changer transitions 15/50 dead transitions. [2023-11-12 02:04:55,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 379 flow [2023-11-12 02:04:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:04:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-11-12 02:04:55,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43628318584070797 [2023-11-12 02:04:55,621 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-11-12 02:04:55,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-11-12 02:04:55,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:55,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-11-12 02:04:55,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 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-12 02:04:55,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 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-12 02:04:55,626 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 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-12 02:04:55,626 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 125 flow. Second operand 5 states and 493 transitions. [2023-11-12 02:04:55,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 379 flow [2023-11-12 02:04:55,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 322 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-11-12 02:04:55,630 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 137 flow [2023-11-12 02:04:55,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-11-12 02:04:55,631 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-11-12 02:04:55,631 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 137 flow [2023-11-12 02:04:55,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:55,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:55,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:04:55,632 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-12 02:04:55,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1432755319, now seen corresponding path program 2 times [2023-11-12 02:04:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342885586] [2023-11-12 02:04:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:55,858 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-12 02:04:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342885586] [2023-11-12 02:04:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342885586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:55,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:55,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267991556] [2023-11-12 02:04:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:55,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:04:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:04:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:55,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 226 [2023-11-12 02:04:55,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 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-12 02:04:55,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:55,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 226 [2023-11-12 02:04:55,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:55,998 INFO L124 PetriNetUnfolderBase]: 36/105 cut-off events. [2023-11-12 02:04:55,999 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-11-12 02:04:55,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 105 events. 36/105 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 327 event pairs, 7 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 379. Up to 52 conditions per place. [2023-11-12 02:04:56,000 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 17 selfloop transitions, 3 changer transitions 21/41 dead transitions. [2023-11-12 02:04:56,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 285 flow [2023-11-12 02:04:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:04:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:04:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-11-12 02:04:56,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4299410029498525 [2023-11-12 02:04:56,003 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-11-12 02:04:56,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-11-12 02:04:56,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:56,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-11-12 02:04:56,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 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-12 02:04:56,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 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-12 02:04:56,009 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 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-12 02:04:56,009 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 137 flow. Second operand 6 states and 583 transitions. [2023-11-12 02:04:56,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 285 flow [2023-11-12 02:04:56,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 277 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-12 02:04:56,012 INFO L231 Difference]: Finished difference. Result has 41 places, 18 transitions, 92 flow [2023-11-12 02:04:56,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=18} [2023-11-12 02:04:56,012 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-11-12 02:04:56,013 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 18 transitions, 92 flow [2023-11-12 02:04:56,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 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-12 02:04:56,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:56,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:56,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:04:56,014 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-12 02:04:56,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1550754387, now seen corresponding path program 3 times [2023-11-12 02:04:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:56,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042954208] [2023-11-12 02:04:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:56,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-12 02:04:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042954208] [2023-11-12 02:04:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042954208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:56,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137287989] [2023-11-12 02:04:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:56,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:04:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:04:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:04:56,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 226 [2023-11-12 02:04:56,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 18 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 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-12 02:04:56,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:04:56,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 226 [2023-11-12 02:04:56,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:04:56,720 INFO L124 PetriNetUnfolderBase]: 8/42 cut-off events. [2023-11-12 02:04:56,720 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-12 02:04:56,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 42 events. 8/42 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 150. Up to 17 conditions per place. [2023-11-12 02:04:56,721 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 14 selfloop transitions, 5 changer transitions 9/28 dead transitions. [2023-11-12 02:04:56,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 201 flow [2023-11-12 02:04:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:04:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:04:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 729 transitions. [2023-11-12 02:04:56,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032079646017699 [2023-11-12 02:04:56,725 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 729 transitions. [2023-11-12 02:04:56,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 729 transitions. [2023-11-12 02:04:56,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:56,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 729 transitions. [2023-11-12 02:04:56,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 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-12 02:04:56,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 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-12 02:04:56,733 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 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-12 02:04:56,733 INFO L175 Difference]: Start difference. First operand has 41 places, 18 transitions, 92 flow. Second operand 8 states and 729 transitions. [2023-11-12 02:04:56,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 201 flow [2023-11-12 02:04:56,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 171 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-12 02:04:56,735 INFO L231 Difference]: Finished difference. Result has 41 places, 18 transitions, 89 flow [2023-11-12 02:04:56,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=41, PETRI_TRANSITIONS=18} [2023-11-12 02:04:56,736 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-11-12 02:04:56,736 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 18 transitions, 89 flow [2023-11-12 02:04:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 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-12 02:04:56,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:04:56,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:56,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:04:56,737 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-12 02:04:56,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 296723093, now seen corresponding path program 4 times [2023-11-12 02:04:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240387372] [2023-11-12 02:04:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:56,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:56,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:56,837 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:04:56,838 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-12 02:04:56,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-12 02:04:56,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-12 02:04:56,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-12 02:04:56,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-12 02:04:56,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-12 02:04:56,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-12 02:04:56,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-12 02:04:56,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-12 02:04:56,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-12 02:04:56,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:04:56,843 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:56,849 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:04:56,850 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:04:56,886 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:04:56,893 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:04:56,901 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:04:56,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:04:56 BasicIcfg [2023-11-12 02:04:56,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:04:56,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:04:56,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:04:56,924 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:04:56,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:46" (3/4) ... [2023-11-12 02:04:56,926 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:04:56,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:04:56,928 INFO L158 Benchmark]: Toolchain (without parser) took 12365.27ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 151.0MB in the beginning and 84.2MB in the end (delta: 66.9MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. [2023-11-12 02:04:56,928 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:04:56,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.47ms. Allocated memory is still 180.4MB. Free memory was 150.9MB in the beginning and 129.2MB in the end (delta: 21.7MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2023-11-12 02:04:56,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.26ms. Allocated memory is still 180.4MB. Free memory was 129.2MB in the beginning and 127.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:04:56,929 INFO L158 Benchmark]: Boogie Preprocessor took 68.82ms. Allocated memory is still 180.4MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:04:56,930 INFO L158 Benchmark]: RCFGBuilder took 883.69ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 120.9MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 02:04:56,930 INFO L158 Benchmark]: TraceAbstraction took 10663.27ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 119.8MB in the beginning and 85.2MB in the end (delta: 34.6MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2023-11-12 02:04:56,931 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 262.1MB. Free memory was 85.2MB in the beginning and 84.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:04:56,932 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 130.0MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.47ms. Allocated memory is still 180.4MB. Free memory was 150.9MB in the beginning and 129.2MB in the end (delta: 21.7MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.26ms. Allocated memory is still 180.4MB. Free memory was 129.2MB in the beginning and 127.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.82ms. Allocated memory is still 180.4MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 883.69ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 120.9MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10663.27ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 119.8MB in the beginning and 85.2MB in the end (delta: 34.6MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 262.1MB. Free memory was 85.2MB in the beginning and 84.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 113 PlacesBefore, 31 PlacesAfterwards, 109 TransitionsBefore, 25 TransitionsAfterwards, 1708 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 4224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2516, independent: 2357, independent conditional: 0, independent unconditional: 2357, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1002, independent: 967, independent conditional: 0, independent unconditional: 967, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2516, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 1002, unknown conditional: 0, unknown unconditional: 1002] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$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, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] 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", "mix031.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 826]: 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, 131 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: 10.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 787 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 92 mSDtfsCounter, 787 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=9, InterpolantAutomatonStates: 50, 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, 2.4s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 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-12 02:04:56,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:04:59,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:04:59,845 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:04:59,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:04:59,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:04:59,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:04:59,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:04:59,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:04:59,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:04:59,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:04:59,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:04:59,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:04:59,909 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:04:59,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:04:59,912 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:04:59,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:04:59,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:04:59,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:04:59,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:04:59,914 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:04:59,915 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:04:59,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:04:59,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:04:59,917 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:04:59,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:04:59,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:04:59,918 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:04:59,919 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:04:59,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:04:59,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:04:59,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:04:59,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:59,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:04:59,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:04:59,924 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:04:59,924 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:04:59,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:04:59,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:04:59,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:04:59,926 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:04:59,926 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:04:59,927 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_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2023-11-12 02:05:00,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:05:00,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:05:00,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:05:00,435 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:05:00,436 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:05:00,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-12 02:05:03,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:05:03,876 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:05:03,876 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2023-11-12 02:05:03,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data/e0e3f8a2c/9cbb280350db4e8e9f29209f03c99de5/FLAGb64802e09 [2023-11-12 02:05:03,925 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/data/e0e3f8a2c/9cbb280350db4e8e9f29209f03c99de5 [2023-11-12 02:05:03,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:05:03,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:05:03,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:05:03,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:05:03,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:05:03,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:05:03" (1/1) ... [2023-11-12 02:05:03,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201a2def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:03, skipping insertion in model container [2023-11-12 02:05:03,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:05:03" (1/1) ... [2023-11-12 02:05:04,018 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:05:04,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:05:04,509 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:05:04,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:05:04,638 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:04,638 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:05:04,646 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:05:04,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04 WrapperNode [2023-11-12 02:05:04,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:05:04,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:05:04,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:05:04,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:05:04,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,720 INFO L138 Inliner]: procedures = 178, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2023-11-12 02:05:04,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:05:04,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:05:04,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:05:04,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:05:04,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:05:04,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:05:04,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:05:04,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:05:04,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (1/1) ... [2023-11-12 02:05:04,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:05:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:05:04,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:05:04,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:05:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:05:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:05:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:05:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:05:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:05:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:05:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:05:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:05:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:05:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:05:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:05:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:05:04,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:05:04,917 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:05:05,183 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:05:05,185 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:05:05,624 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:05:05,804 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:05:05,804 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:05:05,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:05:05 BoogieIcfgContainer [2023-11-12 02:05:05,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:05:05,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:05:05,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:05:05,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:05:05,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:05:03" (1/3) ... [2023-11-12 02:05:05,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719b0223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:05:05, skipping insertion in model container [2023-11-12 02:05:05,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:05:04" (2/3) ... [2023-11-12 02:05:05,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719b0223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:05:05, skipping insertion in model container [2023-11-12 02:05:05,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:05:05" (3/3) ... [2023-11-12 02:05:05,821 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-11-12 02:05:05,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:05:05,841 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-12 02:05:05,841 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:05:05,916 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:05:05,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 112 transitions, 232 flow [2023-11-12 02:05:06,015 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2023-11-12 02:05:06,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:05:06,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 3/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-12 02:05:06,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 112 transitions, 232 flow [2023-11-12 02:05:06,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 110 transitions, 226 flow [2023-11-12 02:05:06,030 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:05:06,040 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 110 transitions, 226 flow [2023-11-12 02:05:06,043 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 110 transitions, 226 flow [2023-11-12 02:05:06,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 110 transitions, 226 flow [2023-11-12 02:05:06,090 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2023-11-12 02:05:06,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:05:06,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 3/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-12 02:05:06,097 INFO L119 LiptonReduction]: Number of co-enabled transitions 1708 [2023-11-12 02:05:13,792 INFO L134 LiptonReduction]: Checked pairs total: 4252 [2023-11-12 02:05:13,793 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-12 02:05:13,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:05:13,816 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;@1d6b0538, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:05:13,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-12 02:05:13,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:05:13,818 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:05:13,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:05:13,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:13,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:05:13,820 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-12 02:05:13,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash 511, now seen corresponding path program 1 times [2023-11-12 02:05:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:13,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96710373] [2023-11-12 02:05:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:13,841 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-12 02:05:13,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:13,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:13,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:13,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:05:13,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:05:13,987 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-12 02:05:13,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:05:13,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:05:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96710373] [2023-11-12 02:05:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96710373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:13,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:13,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:05:13,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594854237] [2023-11-12 02:05:13,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:05:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:05:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:05:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:05:14,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 229 [2023-11-12 02:05:14,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-12 02:05:14,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:14,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 229 [2023-11-12 02:05:14,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:14,226 INFO L124 PetriNetUnfolderBase]: 249/439 cut-off events. [2023-11-12 02:05:14,227 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 02:05:14,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 439 events. 249/439 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1836 event pairs, 249 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 869. Up to 427 conditions per place. [2023-11-12 02:05:14,236 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-11-12 02:05:14,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-11-12 02:05:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:05:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:05:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions. [2023-11-12 02:05:14,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4912663755458515 [2023-11-12 02:05:14,259 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 225 transitions. [2023-11-12 02:05:14,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 225 transitions. [2023-11-12 02:05:14,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:14,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 225 transitions. [2023-11-12 02:05:14,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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-12 02:05:14,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:14,281 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:14,283 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 225 transitions. [2023-11-12 02:05:14,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-11-12 02:05:14,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:05:14,289 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-11-12 02:05:14,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, 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-12 02:05:14,296 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-11-12 02:05:14,296 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-11-12 02:05:14,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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-12 02:05:14,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:14,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:05:14,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:05:14,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:14,511 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-12 02:05:14,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 484073122, now seen corresponding path program 1 times [2023-11-12 02:05:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416796391] [2023-11-12 02:05:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:14,513 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-12 02:05:14,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:14,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:14,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:14,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:05:14,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:05:14,688 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-12 02:05:14,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:05:14,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:05:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416796391] [2023-11-12 02:05:14,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416796391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:14,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:14,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:05:14,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349962714] [2023-11-12 02:05:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:14,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:05:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:14,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2023-11-12 02:05:14,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 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-12 02:05:14,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:14,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2023-11-12 02:05:14,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:14,851 INFO L124 PetriNetUnfolderBase]: 204/382 cut-off events. [2023-11-12 02:05:14,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:05:14,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 382 events. 204/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1669 event pairs, 24 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 745. Up to 293 conditions per place. [2023-11-12 02:05:14,864 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-12 02:05:14,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 112 flow [2023-11-12 02:05:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:05:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-12 02:05:14,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759825327510917 [2023-11-12 02:05:14,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-12 02:05:14,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-12 02:05:14,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:14,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-12 02:05:14,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:14,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 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-12 02:05:14,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 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-12 02:05:14,882 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 327 transitions. [2023-11-12 02:05:14,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 112 flow [2023-11-12 02:05:14,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:05:14,884 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-11-12 02:05:14,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, 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-12 02:05:14,885 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-11-12 02:05:14,885 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-11-12 02:05:14,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12 02:05:14,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:14,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:14,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,099 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-12 02:05:15,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1337888976, now seen corresponding path program 1 times [2023-11-12 02:05:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308695066] [2023-11-12 02:05:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:15,101 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-12 02:05:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:15,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:15,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:05:15,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:05:15,269 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-12 02:05:15,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:05:15,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:05:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308695066] [2023-11-12 02:05:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308695066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345290548] [2023-11-12 02:05:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:15,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:05:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:05:15,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:05:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:05:15,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-11-12 02:05:15,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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-12 02:05:15,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:15,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-11-12 02:05:15,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:15,463 INFO L124 PetriNetUnfolderBase]: 76/169 cut-off events. [2023-11-12 02:05:15,464 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-12 02:05:15,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 169 events. 76/169 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 624 event pairs, 15 based on Foata normal form. 20/180 useless extension candidates. Maximal degree in co-relation 358. Up to 94 conditions per place. [2023-11-12 02:05:15,465 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 22 selfloop transitions, 3 changer transitions 15/42 dead transitions. [2023-11-12 02:05:15,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 180 flow [2023-11-12 02:05:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:05:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:05:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-11-12 02:05:15,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558951965065502 [2023-11-12 02:05:15,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-11-12 02:05:15,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-11-12 02:05:15,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:15,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-11-12 02:05:15,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 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-12 02:05:15,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12 02:05:15,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12 02:05:15,478 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 522 transitions. [2023-11-12 02:05:15,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 180 flow [2023-11-12 02:05:15,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:05:15,480 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow [2023-11-12 02:05:15,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-11-12 02:05:15,481 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-11-12 02:05:15,482 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow [2023-11-12 02:05:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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-12 02:05:15,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:15,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:15,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,698 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-12 02:05:15,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -48314397, now seen corresponding path program 1 times [2023-11-12 02:05:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:15,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013455164] [2023-11-12 02:05:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:15,699 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-12 02:05:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:15,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:15,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:05:15,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:05:15,870 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-12 02:05:15,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:05:15,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:05:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013455164] [2023-11-12 02:05:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013455164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:15,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:15,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253883455] [2023-11-12 02:05:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:05:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:05:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:05:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:05:15,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-11-12 02:05:15,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 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-12 02:05:15,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:15,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-11-12 02:05:15,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:16,117 INFO L124 PetriNetUnfolderBase]: 24/70 cut-off events. [2023-11-12 02:05:16,117 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-12 02:05:16,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 70 events. 24/70 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 10 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2023-11-12 02:05:16,118 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-11-12 02:05:16,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 175 flow [2023-11-12 02:05:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:05:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:05:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2023-11-12 02:05:16,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44468704512372637 [2023-11-12 02:05:16,125 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2023-11-12 02:05:16,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2023-11-12 02:05:16,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:16,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2023-11-12 02:05:16,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:16,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 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-12 02:05:16,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 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-12 02:05:16,134 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 6 states and 611 transitions. [2023-11-12 02:05:16,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 175 flow [2023-11-12 02:05:16,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 162 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-12 02:05:16,137 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 78 flow [2023-11-12 02:05:16,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-11-12 02:05:16,138 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-11-12 02:05:16,138 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 78 flow [2023-11-12 02:05:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 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-12 02:05:16,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:16,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:16,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:05:16,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:16,352 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-12 02:05:16,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1018304031, now seen corresponding path program 1 times [2023-11-12 02:05:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:16,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102072873] [2023-11-12 02:05:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:16,353 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-12 02:05:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:16,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:16,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:16,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:05:16,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:05:16,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-12 02:05:16,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:05:16,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:05:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102072873] [2023-11-12 02:05:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102072873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:16,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581468824] [2023-11-12 02:05:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:16,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:05:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:05:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:05:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:05:16,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-11-12 02:05:16,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 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-12 02:05:16,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:16,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-11-12 02:05:16,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:16,673 INFO L124 PetriNetUnfolderBase]: 24/83 cut-off events. [2023-11-12 02:05:16,674 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-12 02:05:16,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 83 events. 24/83 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 220. Up to 47 conditions per place. [2023-11-12 02:05:16,675 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 34 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-12 02:05:16,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 221 flow [2023-11-12 02:05:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:05:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:05:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2023-11-12 02:05:16,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596069868995633 [2023-11-12 02:05:16,678 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 421 transitions. [2023-11-12 02:05:16,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 421 transitions. [2023-11-12 02:05:16,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:16,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 421 transitions. [2023-11-12 02:05:16,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:16,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 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-12 02:05:16,684 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 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-12 02:05:16,684 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 78 flow. Second operand 4 states and 421 transitions. [2023-11-12 02:05:16,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 221 flow [2023-11-12 02:05:16,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 190 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-12 02:05:16,687 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 75 flow [2023-11-12 02:05:16,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, 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-12 02:05:16,688 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-11-12 02:05:16,689 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 75 flow [2023-11-12 02:05:16,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 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-12 02:05:16,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:16,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:16,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:16,901 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-12 02:05:16,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 85281137, now seen corresponding path program 2 times [2023-11-12 02:05:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867823908] [2023-11-12 02:05:16,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:05:16,903 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-12 02:05:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:16,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:16,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:17,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-12 02:05:17,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:05:17,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:05:17,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:05:17,305 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-12 02:05:17,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:05:17,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:05:17,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867823908] [2023-11-12 02:05:17,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867823908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:17,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:17,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922629997] [2023-11-12 02:05:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:17,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:05:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:05:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:05:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:05:17,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 229 [2023-11-12 02:05:17,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 75 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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-12 02:05:17,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:17,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 229 [2023-11-12 02:05:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:17,532 INFO L124 PetriNetUnfolderBase]: 22/92 cut-off events. [2023-11-12 02:05:17,532 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-12 02:05:17,533 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 289 event pairs, 6 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 254. Up to 26 conditions per place. [2023-11-12 02:05:17,533 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-11-12 02:05:17,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 197 flow [2023-11-12 02:05:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:05:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:05:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 694 transitions. [2023-11-12 02:05:17,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329382407985028 [2023-11-12 02:05:17,540 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 694 transitions. [2023-11-12 02:05:17,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 694 transitions. [2023-11-12 02:05:17,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:17,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 694 transitions. [2023-11-12 02:05:17,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 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-12 02:05:17,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 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-12 02:05:17,548 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 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-12 02:05:17,549 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 75 flow. Second operand 7 states and 694 transitions. [2023-11-12 02:05:17,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 197 flow [2023-11-12 02:05:17,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:05:17,554 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 98 flow [2023-11-12 02:05:17,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, 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=98, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-11-12 02:05:17,558 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-11-12 02:05:17,558 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 98 flow [2023-11-12 02:05:17,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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-12 02:05:17,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:17,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:17,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:17,773 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-12 02:05:17,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -575642409, now seen corresponding path program 3 times [2023-11-12 02:05:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:05:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197773323] [2023-11-12 02:05:17,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:05:17,774 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-12 02:05:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:05:17,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:17,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:17,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 02:05:17,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-12 02:05:17,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:05:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:05:18,018 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-12 02:05:18,018 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:05:18,019 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-12 02:05:18,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-12 02:05:18,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-12 02:05:18,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-12 02:05:18,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-12 02:05:18,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-12 02:05:18,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-12 02:05:18,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-12 02:05:18,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-12 02:05:18,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-12 02:05:18,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:18,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:05:18,250 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-12 02:05:18,257 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:05:18,257 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:05:18,296 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:05:18,299 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:05:18,307 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:05:18,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:05:18 BasicIcfg [2023-11-12 02:05:18,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:05:18,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:05:18,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:05:18,327 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:05:18,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:05:05" (3/4) ... [2023-11-12 02:05:18,329 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:05:18,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:05:18,332 INFO L158 Benchmark]: Toolchain (without parser) took 14400.41ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 47.6MB in the beginning and 34.5MB in the end (delta: 13.1MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2023-11-12 02:05:18,333 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 73.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:05:18,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 713.22ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.4MB in the beginning and 62.4MB in the end (delta: -15.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:18,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.51ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 60.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:18,342 INFO L158 Benchmark]: Boogie Preprocessor took 87.93ms. Allocated memory is still 94.4MB. Free memory was 60.0MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:18,343 INFO L158 Benchmark]: RCFGBuilder took 997.90ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 48.2MB in the end (delta: 9.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-11-12 02:05:18,343 INFO L158 Benchmark]: TraceAbstraction took 12514.47ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 47.3MB in the beginning and 35.5MB in the end (delta: 11.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2023-11-12 02:05:18,344 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 113.2MB. Free memory was 35.5MB in the beginning and 34.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:05:18,346 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 73.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 713.22ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.4MB in the beginning and 62.4MB in the end (delta: -15.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.51ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 60.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.93ms. Allocated memory is still 94.4MB. Free memory was 60.0MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.90ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 48.2MB in the end (delta: 9.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12514.47ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 47.3MB in the beginning and 35.5MB in the end (delta: 11.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 113.2MB. Free memory was 35.5MB in the beginning and 34.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 114 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 25 TransitionsAfterwards, 1708 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 4252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2466, independent: 2309, independent conditional: 0, independent unconditional: 2309, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1013, independent: 978, independent conditional: 0, independent unconditional: 978, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2466, independent: 1331, independent conditional: 0, independent unconditional: 1331, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1013, unknown conditional: 0, unknown unconditional: 1013] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$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, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={3:0}, t836={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] 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", "mix031.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 826]: 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, 132 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: 12.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 9 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 0.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 5 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 32 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-12 02:05:18,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5e46a0e-e951-4de3-90d6-c10741c227d5/bin/uautomizer-verify-uTZkv6EMXl/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