./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:32,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:32,542 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:46:32,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:32,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:32,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:32,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:32,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:32,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:32,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:32,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:32,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:32,618 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:32,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:32,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:32,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:32,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:32,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:32,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:46:32,623 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:46:32,623 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:46:32,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:32,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:46:32,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:46:32,632 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:32,633 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:32,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:32,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:32,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:32,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:32,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:32,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:32,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:32,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:32,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:32,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:32,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:32,636 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:32,637 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_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 [2023-11-06 22:46:32,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:32,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:32,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:32,996 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:32,997 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:32,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-06 22:46:36,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:36,522 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:36,522 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-06 22:46:36,541 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data/d1456bab8/780b7922bc664e0b83b16101754811f8/FLAG475462aea [2023-11-06 22:46:36,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data/d1456bab8/780b7922bc664e0b83b16101754811f8 [2023-11-06 22:46:36,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:36,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:36,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:36,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:36,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:36,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:36" (1/1) ... [2023-11-06 22:46:36,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@952ab62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:36, skipping insertion in model container [2023-11-06 22:46:36,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:36" (1/1) ... [2023-11-06 22:46:36,634 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:37,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:37,088 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:37,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:37,211 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:46:37,212 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:46:37,220 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:37,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37 WrapperNode [2023-11-06 22:46:37,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:37,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:37,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:37,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:37,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,291 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-06 22:46:37,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:37,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:37,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:37,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:37,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:37,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:37,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:37,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:37,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:37,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:37,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:46:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:46:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:46:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:46:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:46:37,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:46:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:46:37,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:46:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:46:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:46:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:46:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:37,435 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:46:37,585 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:37,587 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:37,981 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:38,240 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:38,241 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:46:38,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:38 BoogieIcfgContainer [2023-11-06 22:46:38,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:38,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:38,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:38,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:38,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:36" (1/3) ... [2023-11-06 22:46:38,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1116387e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:38, skipping insertion in model container [2023-11-06 22:46:38,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (2/3) ... [2023-11-06 22:46:38,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1116387e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:38, skipping insertion in model container [2023-11-06 22:46:38,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:38" (3/3) ... [2023-11-06 22:46:38,257 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-11-06 22:46:38,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:38,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:46:38,277 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:46:38,370 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:46:38,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 133 transitions, 278 flow [2023-11-06 22:46:38,523 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2023-11-06 22:46:38,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:38,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 3/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:46:38,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 133 transitions, 278 flow [2023-11-06 22:46:38,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 130 transitions, 269 flow [2023-11-06 22:46:38,541 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:38,563 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 130 transitions, 269 flow [2023-11-06 22:46:38,570 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 130 transitions, 269 flow [2023-11-06 22:46:38,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 130 transitions, 269 flow [2023-11-06 22:46:38,599 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2023-11-06 22:46:38,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:38,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 130 events. 3/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:46:38,603 INFO L119 LiptonReduction]: Number of co-enabled transitions 2764 [2023-11-06 22:46:43,902 INFO L134 LiptonReduction]: Checked pairs total: 7266 [2023-11-06 22:46:43,903 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-06 22:46:43,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:43,926 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;@79cc035a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:43,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:46:43,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:43,928 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:46:43,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:43,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:43,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:46:43,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:43,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-11-06 22:46:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936466362] [2023-11-06 22:46:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:44,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936466362] [2023-11-06 22:46:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936466362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:46:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742706095] [2023-11-06 22:46:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:44,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:44,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 272 [2023-11-06 22:46:44,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:44,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:44,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 272 [2023-11-06 22:46:44,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:44,666 INFO L124 PetriNetUnfolderBase]: 1527/2286 cut-off events. [2023-11-06 22:46:44,666 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-06 22:46:44,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4573 conditions, 2286 events. 1527/2286 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11170 event pairs, 1527 based on Foata normal form. 0/1941 useless extension candidates. Maximal degree in co-relation 4562. Up to 2241 conditions per place. [2023-11-06 22:46:44,691 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 22:46:44,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-11-06 22:46:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 270 transitions. [2023-11-06 22:46:44,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963235294117647 [2023-11-06 22:46:44,708 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 270 transitions. [2023-11-06 22:46:44,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 270 transitions. [2023-11-06 22:46:44,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:44,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 270 transitions. [2023-11-06 22:46:44,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:44,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:44,722 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:44,724 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 270 transitions. [2023-11-06 22:46:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-11-06 22:46:44,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:46:44,730 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 22:46:44,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 22:46:44,735 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 22:46:44,736 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 22:46:44,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:44,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:44,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:44,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:46:44,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:44,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1612638490, now seen corresponding path program 1 times [2023-11-06 22:46:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934497455] [2023-11-06 22:46:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934497455] [2023-11-06 22:46:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934497455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:46:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337958886] [2023-11-06 22:46:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:45,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:45,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:45,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:45,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 272 [2023-11-06 22:46:45,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:45,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 272 [2023-11-06 22:46:45,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:45,591 INFO L124 PetriNetUnfolderBase]: 1263/1986 cut-off events. [2023-11-06 22:46:45,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:45,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1986 events. 1263/1986 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10274 event pairs, 207 based on Foata normal form. 0/1821 useless extension candidates. Maximal degree in co-relation 3892. Up to 1505 conditions per place. [2023-11-06 22:46:45,607 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-06 22:46:45,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-11-06 22:46:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-06 22:46:45,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2023-11-06 22:46:45,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-06 22:46:45,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-06 22:46:45,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:45,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-06 22:46:45,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,618 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 392 transitions. [2023-11-06 22:46:45,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-11-06 22:46:45,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:45,620 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-06 22:46:45,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-06 22:46:45,621 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 22:46:45,622 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-06 22:46:45,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:45,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:45,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:46:45,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:45,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -737552352, now seen corresponding path program 1 times [2023-11-06 22:46:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:45,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64522527] [2023-11-06 22:46:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:45,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:45,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64522527] [2023-11-06 22:46:45,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64522527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:45,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:46:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109690993] [2023-11-06 22:46:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:45,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:45,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 272 [2023-11-06 22:46:45,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:45,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:45,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 272 [2023-11-06 22:46:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:46,624 INFO L124 PetriNetUnfolderBase]: 2645/3882 cut-off events. [2023-11-06 22:46:46,624 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-06 22:46:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8019 conditions, 3882 events. 2645/3882 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18466 event pairs, 1043 based on Foata normal form. 0/3740 useless extension candidates. Maximal degree in co-relation 8015. Up to 3117 conditions per place. [2023-11-06 22:46:46,655 INFO L140 encePairwiseOnDemand]: 263/272 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2023-11-06 22:46:46,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 196 flow [2023-11-06 22:46:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-06 22:46:46,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-11-06 22:46:46,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-06 22:46:46,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-06 22:46:46,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:46,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-06 22:46:46,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:46,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:46,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:46,665 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 3 states and 376 transitions. [2023-11-06 22:46:46,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 196 flow [2023-11-06 22:46:46,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:46:46,667 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 116 flow [2023-11-06 22:46:46,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-11-06 22:46:46,669 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2023-11-06 22:46:46,669 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 116 flow [2023-11-06 22:46:46,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:46,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:46,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:46:46,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:46,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1389285398, now seen corresponding path program 1 times [2023-11-06 22:46:46,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245912964] [2023-11-06 22:46:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245912964] [2023-11-06 22:46:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245912964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633721477] [2023-11-06 22:46:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:46:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:46:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:46:47,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 272 [2023-11-06 22:46:47,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:47,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:47,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 272 [2023-11-06 22:46:47,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:48,065 INFO L124 PetriNetUnfolderBase]: 2024/3162 cut-off events. [2023-11-06 22:46:48,069 INFO L125 PetriNetUnfolderBase]: For 1050/1050 co-relation queries the response was YES. [2023-11-06 22:46:48,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7888 conditions, 3162 events. 2024/3162 cut-off events. For 1050/1050 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16147 event pairs, 560 based on Foata normal form. 232/3361 useless extension candidates. Maximal degree in co-relation 7883. Up to 1983 conditions per place. [2023-11-06 22:46:48,094 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 41 selfloop transitions, 7 changer transitions 16/68 dead transitions. [2023-11-06 22:46:48,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 370 flow [2023-11-06 22:46:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:46:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-06 22:46:48,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41973039215686275 [2023-11-06 22:46:48,098 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-06 22:46:48,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-06 22:46:48,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:48,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-06 22:46:48,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,107 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,107 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 116 flow. Second operand 6 states and 685 transitions. [2023-11-06 22:46:48,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 370 flow [2023-11-06 22:46:48,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:46:48,127 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 135 flow [2023-11-06 22:46:48,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-11-06 22:46:48,130 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-06 22:46:48,130 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 135 flow [2023-11-06 22:46:48,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:48,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:46:48,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:48,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1427196532, now seen corresponding path program 1 times [2023-11-06 22:46:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43081168] [2023-11-06 22:46:48,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:48,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43081168] [2023-11-06 22:46:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43081168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:48,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:48,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478957066] [2023-11-06 22:46:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:48,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:48,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 272 [2023-11-06 22:46:48,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:48,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 272 [2023-11-06 22:46:48,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:48,886 INFO L124 PetriNetUnfolderBase]: 1869/2786 cut-off events. [2023-11-06 22:46:48,886 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2023-11-06 22:46:48,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7324 conditions, 2786 events. 1869/2786 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12447 event pairs, 919 based on Foata normal form. 0/2732 useless extension candidates. Maximal degree in co-relation 7316. Up to 1623 conditions per place. [2023-11-06 22:46:48,909 INFO L140 encePairwiseOnDemand]: 264/272 looper letters, 52 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2023-11-06 22:46:48,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 347 flow [2023-11-06 22:46:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:46:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-11-06 22:46:48,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4522058823529412 [2023-11-06 22:46:48,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-11-06 22:46:48,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-11-06 22:46:48,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:48,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-11-06 22:46:48,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,919 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 135 flow. Second operand 4 states and 492 transitions. [2023-11-06 22:46:48,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 347 flow [2023-11-06 22:46:48,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 332 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:46:48,930 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 186 flow [2023-11-06 22:46:48,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-06 22:46:48,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-06 22:46:48,931 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 186 flow [2023-11-06 22:46:48,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:48,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:48,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:48,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:46:48,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:48,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1396514578, now seen corresponding path program 1 times [2023-11-06 22:46:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778409343] [2023-11-06 22:46:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778409343] [2023-11-06 22:46:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778409343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808433461] [2023-11-06 22:46:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:49,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:46:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:49,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:46:49,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:46:49,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 272 [2023-11-06 22:46:49,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:49,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:49,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 272 [2023-11-06 22:46:49,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:50,087 INFO L124 PetriNetUnfolderBase]: 1427/2295 cut-off events. [2023-11-06 22:46:50,088 INFO L125 PetriNetUnfolderBase]: For 2273/2313 co-relation queries the response was YES. [2023-11-06 22:46:50,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 2295 events. 1427/2295 cut-off events. For 2273/2313 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11536 event pairs, 326 based on Foata normal form. 127/2373 useless extension candidates. Maximal degree in co-relation 6219. Up to 1344 conditions per place. [2023-11-06 22:46:50,107 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 40 selfloop transitions, 6 changer transitions 16/71 dead transitions. [2023-11-06 22:46:50,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 456 flow [2023-11-06 22:46:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:46:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-11-06 22:46:50,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42034313725490197 [2023-11-06 22:46:50,112 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-11-06 22:46:50,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-11-06 22:46:50,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:50,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-11-06 22:46:50,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:50,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:50,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:50,120 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 186 flow. Second operand 6 states and 686 transitions. [2023-11-06 22:46:50,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 456 flow [2023-11-06 22:46:50,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:50,125 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 199 flow [2023-11-06 22:46:50,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-11-06 22:46:50,127 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-06 22:46:50,127 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 199 flow [2023-11-06 22:46:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:50,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:50,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:46:50,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:50,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 938998890, now seen corresponding path program 1 times [2023-11-06 22:46:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291830125] [2023-11-06 22:46:50,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291830125] [2023-11-06 22:46:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291830125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:46:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614073983] [2023-11-06 22:46:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:50,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:46:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:46:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:46:51,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 272 [2023-11-06 22:46:51,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 104.625) internal successors, (837), 8 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:51,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:51,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 272 [2023-11-06 22:46:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:51,828 INFO L124 PetriNetUnfolderBase]: 1039/1672 cut-off events. [2023-11-06 22:46:51,828 INFO L125 PetriNetUnfolderBase]: For 1763/1788 co-relation queries the response was YES. [2023-11-06 22:46:51,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 1672 events. 1039/1672 cut-off events. For 1763/1788 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7857 event pairs, 129 based on Foata normal form. 112/1744 useless extension candidates. Maximal degree in co-relation 4800. Up to 954 conditions per place. [2023-11-06 22:46:51,842 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 36 selfloop transitions, 5 changer transitions 15/62 dead transitions. [2023-11-06 22:46:51,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 396 flow [2023-11-06 22:46:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:46:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:46:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2023-11-06 22:46:51,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4023109243697479 [2023-11-06 22:46:51,847 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 766 transitions. [2023-11-06 22:46:51,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 766 transitions. [2023-11-06 22:46:51,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:51,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 766 transitions. [2023-11-06 22:46:51,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:51,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:51,855 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:51,855 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 199 flow. Second operand 7 states and 766 transitions. [2023-11-06 22:46:51,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 396 flow [2023-11-06 22:46:51,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 382 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-06 22:46:51,862 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 133 flow [2023-11-06 22:46:51,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-11-06 22:46:51,863 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-06 22:46:51,863 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 133 flow [2023-11-06 22:46:51,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.625) internal successors, (837), 8 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:51,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:51,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:51,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:46:51,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:51,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash -382949148, now seen corresponding path program 1 times [2023-11-06 22:46:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582600205] [2023-11-06 22:46:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582600205] [2023-11-06 22:46:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582600205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:52,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140840963] [2023-11-06 22:46:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:52,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:52,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-11-06 22:46:52,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:52,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-11-06 22:46:52,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:52,367 INFO L124 PetriNetUnfolderBase]: 703/1182 cut-off events. [2023-11-06 22:46:52,368 INFO L125 PetriNetUnfolderBase]: For 864/878 co-relation queries the response was YES. [2023-11-06 22:46:52,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1182 events. 703/1182 cut-off events. For 864/878 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5783 event pairs, 145 based on Foata normal form. 126/1265 useless extension candidates. Maximal degree in co-relation 3214. Up to 584 conditions per place. [2023-11-06 22:46:52,377 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 52 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2023-11-06 22:46:52,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 393 flow [2023-11-06 22:46:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:46:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:46:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-11-06 22:46:52,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602941176470588 [2023-11-06 22:46:52,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-11-06 22:46:52,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-11-06 22:46:52,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:52,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-11-06 22:46:52,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,388 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,388 INFO L175 Difference]: Start difference. First operand has 50 places, 28 transitions, 133 flow. Second operand 5 states and 626 transitions. [2023-11-06 22:46:52,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 393 flow [2023-11-06 22:46:52,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 361 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 22:46:52,391 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 178 flow [2023-11-06 22:46:52,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-11-06 22:46:52,392 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-11-06 22:46:52,393 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 178 flow [2023-11-06 22:46:52,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:52,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:52,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:46:52,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:52,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -710057135, now seen corresponding path program 1 times [2023-11-06 22:46:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:52,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569723007] [2023-11-06 22:46:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569723007] [2023-11-06 22:46:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569723007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:52,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627584462] [2023-11-06 22:46:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:52,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 272 [2023-11-06 22:46:52,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:52,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:52,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 272 [2023-11-06 22:46:52,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:53,094 INFO L124 PetriNetUnfolderBase]: 1141/1856 cut-off events. [2023-11-06 22:46:53,094 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2023-11-06 22:46:53,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 1856 events. 1141/1856 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9146 event pairs, 103 based on Foata normal form. 18/1874 useless extension candidates. Maximal degree in co-relation 6344. Up to 1109 conditions per place. [2023-11-06 22:46:53,104 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 55 selfloop transitions, 10 changer transitions 25/90 dead transitions. [2023-11-06 22:46:53,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 621 flow [2023-11-06 22:46:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:46:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-11-06 22:46:53,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4381127450980392 [2023-11-06 22:46:53,108 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-11-06 22:46:53,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-11-06 22:46:53,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:53,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-11-06 22:46:53,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,116 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,117 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 178 flow. Second operand 6 states and 715 transitions. [2023-11-06 22:46:53,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 621 flow [2023-11-06 22:46:53,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:46:53,124 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 197 flow [2023-11-06 22:46:53,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2023-11-06 22:46:53,125 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-11-06 22:46:53,125 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 197 flow [2023-11-06 22:46:53,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:53,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:46:53,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:53,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash 285340981, now seen corresponding path program 2 times [2023-11-06 22:46:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871992345] [2023-11-06 22:46:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871992345] [2023-11-06 22:46:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871992345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:46:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435199113] [2023-11-06 22:46:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:46:53,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:46:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:46:53,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-11-06 22:46:53,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:53,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-11-06 22:46:53,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:53,638 INFO L124 PetriNetUnfolderBase]: 472/880 cut-off events. [2023-11-06 22:46:53,638 INFO L125 PetriNetUnfolderBase]: For 891/908 co-relation queries the response was YES. [2023-11-06 22:46:53,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 880 events. 472/880 cut-off events. For 891/908 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4416 event pairs, 94 based on Foata normal form. 96/953 useless extension candidates. Maximal degree in co-relation 2877. Up to 301 conditions per place. [2023-11-06 22:46:53,645 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 52 selfloop transitions, 10 changer transitions 11/80 dead transitions. [2023-11-06 22:46:53,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 538 flow [2023-11-06 22:46:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:46:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:46:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-11-06 22:46:53,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-11-06 22:46:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-11-06 22:46:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-11-06 22:46:53,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:53,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-11-06 22:46:53,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,657 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,657 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 197 flow. Second operand 6 states and 752 transitions. [2023-11-06 22:46:53,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 538 flow [2023-11-06 22:46:53,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 529 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:46:53,663 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 268 flow [2023-11-06 22:46:53,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-11-06 22:46:53,664 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-11-06 22:46:53,664 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 268 flow [2023-11-06 22:46:53,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:53,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:53,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:46:53,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:53,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -249000935, now seen corresponding path program 1 times [2023-11-06 22:46:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463656731] [2023-11-06 22:46:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463656731] [2023-11-06 22:46:53,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463656731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:46:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849450544] [2023-11-06 22:46:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:53,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:46:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:46:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:46:53,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-11-06 22:46:53,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:53,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:53,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-11-06 22:46:53,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:54,232 INFO L124 PetriNetUnfolderBase]: 425/803 cut-off events. [2023-11-06 22:46:54,232 INFO L125 PetriNetUnfolderBase]: For 1221/1238 co-relation queries the response was YES. [2023-11-06 22:46:54,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 803 events. 425/803 cut-off events. For 1221/1238 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4069 event pairs, 88 based on Foata normal form. 26/807 useless extension candidates. Maximal degree in co-relation 2995. Up to 272 conditions per place. [2023-11-06 22:46:54,239 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 44 selfloop transitions, 14 changer transitions 18/80 dead transitions. [2023-11-06 22:46:54,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 583 flow [2023-11-06 22:46:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:46:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:46:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 980 transitions. [2023-11-06 22:46:54,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45036764705882354 [2023-11-06 22:46:54,245 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 980 transitions. [2023-11-06 22:46:54,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 980 transitions. [2023-11-06 22:46:54,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:54,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 980 transitions. [2023-11-06 22:46:54,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.5) internal successors, (980), 8 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,257 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,257 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 268 flow. Second operand 8 states and 980 transitions. [2023-11-06 22:46:54,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 583 flow [2023-11-06 22:46:54,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 525 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-06 22:46:54,279 INFO L231 Difference]: Finished difference. Result has 64 places, 36 transitions, 233 flow [2023-11-06 22:46:54,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=64, PETRI_TRANSITIONS=36} [2023-11-06 22:46:54,280 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-11-06 22:46:54,281 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 36 transitions, 233 flow [2023-11-06 22:46:54,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:54,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:46:54,282 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:54,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1003851157, now seen corresponding path program 1 times [2023-11-06 22:46:54,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:54,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983229072] [2023-11-06 22:46:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983229072] [2023-11-06 22:46:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983229072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:46:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754065395] [2023-11-06 22:46:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:54,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:46:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:46:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:46:54,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-11-06 22:46:54,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 36 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:54,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-11-06 22:46:54,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:54,741 INFO L124 PetriNetUnfolderBase]: 344/701 cut-off events. [2023-11-06 22:46:54,741 INFO L125 PetriNetUnfolderBase]: For 1378/1387 co-relation queries the response was YES. [2023-11-06 22:46:54,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 701 events. 344/701 cut-off events. For 1378/1387 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3562 event pairs, 98 based on Foata normal form. 1/699 useless extension candidates. Maximal degree in co-relation 2571. Up to 392 conditions per place. [2023-11-06 22:46:54,745 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 27 selfloop transitions, 1 changer transitions 42/72 dead transitions. [2023-11-06 22:46:54,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 624 flow [2023-11-06 22:46:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:46:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:46:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-11-06 22:46:54,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46599264705882354 [2023-11-06 22:46:54,749 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-11-06 22:46:54,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-11-06 22:46:54,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:54,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-11-06 22:46:54,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,755 INFO L175 Difference]: Start difference. First operand has 64 places, 36 transitions, 233 flow. Second operand 4 states and 507 transitions. [2023-11-06 22:46:54,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 624 flow [2023-11-06 22:46:54,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 501 flow, removed 33 selfloop flow, removed 9 redundant places. [2023-11-06 22:46:54,766 INFO L231 Difference]: Finished difference. Result has 57 places, 28 transitions, 139 flow [2023-11-06 22:46:54,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=57, PETRI_TRANSITIONS=28} [2023-11-06 22:46:54,768 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-06 22:46:54,769 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 28 transitions, 139 flow [2023-11-06 22:46:54,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:54,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:54,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:46:54,770 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:54,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash 743054647, now seen corresponding path program 2 times [2023-11-06 22:46:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:54,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949905196] [2023-11-06 22:46:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949905196] [2023-11-06 22:46:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949905196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:46:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730252539] [2023-11-06 22:46:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:55,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:46:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:46:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:46:56,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 272 [2023-11-06 22:46:56,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 28 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:56,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:56,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 272 [2023-11-06 22:46:56,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:56,291 INFO L124 PetriNetUnfolderBase]: 99/228 cut-off events. [2023-11-06 22:46:56,291 INFO L125 PetriNetUnfolderBase]: For 307/313 co-relation queries the response was YES. [2023-11-06 22:46:56,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 228 events. 99/228 cut-off events. For 307/313 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 857 event pairs, 19 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 746. Up to 78 conditions per place. [2023-11-06 22:46:56,293 INFO L140 encePairwiseOnDemand]: 265/272 looper letters, 22 selfloop transitions, 4 changer transitions 26/55 dead transitions. [2023-11-06 22:46:56,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 383 flow [2023-11-06 22:46:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:46:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:46:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 951 transitions. [2023-11-06 22:46:56,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43704044117647056 [2023-11-06 22:46:56,299 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 951 transitions. [2023-11-06 22:46:56,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 951 transitions. [2023-11-06 22:46:56,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:56,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 951 transitions. [2023-11-06 22:46:56,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:56,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:56,309 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:56,310 INFO L175 Difference]: Start difference. First operand has 57 places, 28 transitions, 139 flow. Second operand 8 states and 951 transitions. [2023-11-06 22:46:56,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 383 flow [2023-11-06 22:46:56,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 359 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-11-06 22:46:56,319 INFO L231 Difference]: Finished difference. Result has 55 places, 28 transitions, 140 flow [2023-11-06 22:46:56,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=140, PETRI_PLACES=55, PETRI_TRANSITIONS=28} [2023-11-06 22:46:56,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-11-06 22:46:56,320 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 28 transitions, 140 flow [2023-11-06 22:46:56,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:46:56,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:56,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:56,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:46:56,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:46:56,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2144624927, now seen corresponding path program 3 times [2023-11-06 22:46:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222256346] [2023-11-06 22:46:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:56,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:46:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:46:56,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:46:56,519 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:46:56,520 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:46:56,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:46:56,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:46:56,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:46:56,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:46:56,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:46:56,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:46:56,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:46:56,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:46:56,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:46:56,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:46:56,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:46:56,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:46:56,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:46:56,526 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:56,535 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:46:56,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:46:56,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:56 BasicIcfg [2023-11-06 22:46:56,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:46:56,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:46:56,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:46:56,645 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:46:56,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:38" (3/4) ... [2023-11-06 22:46:56,648 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:46:56,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:46:56,650 INFO L158 Benchmark]: Toolchain (without parser) took 20086.65ms. Allocated memory was 153.1MB in the beginning and 421.5MB in the end (delta: 268.4MB). Free memory was 122.0MB in the beginning and 366.1MB in the end (delta: -244.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:56,650 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:56,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.43ms. Allocated memory is still 153.1MB. Free memory was 121.5MB in the beginning and 97.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:56,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.46ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 94.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:46:56,651 INFO L158 Benchmark]: Boogie Preprocessor took 51.24ms. Allocated memory is still 153.1MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:46:56,652 INFO L158 Benchmark]: RCFGBuilder took 900.25ms. Allocated memory is still 153.1MB. Free memory was 92.7MB in the beginning and 105.1MB in the end (delta: -12.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 22:46:56,652 INFO L158 Benchmark]: TraceAbstraction took 18396.25ms. Allocated memory was 153.1MB in the beginning and 421.5MB in the end (delta: 268.4MB). Free memory was 104.4MB in the beginning and 366.1MB in the end (delta: -261.7MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2023-11-06 22:46:56,653 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 421.5MB. Free memory is still 366.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:46:56,655 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.28ms. Allocated memory is still 125.8MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.43ms. Allocated memory is still 153.1MB. Free memory was 121.5MB in the beginning and 97.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.46ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 94.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.24ms. Allocated memory is still 153.1MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 900.25ms. Allocated memory is still 153.1MB. Free memory was 92.7MB in the beginning and 105.1MB in the end (delta: -12.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18396.25ms. Allocated memory was 153.1MB in the beginning and 421.5MB in the end (delta: 268.4MB). Free memory was 104.4MB in the beginning and 366.1MB in the end (delta: -261.7MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 421.5MB. Free memory is still 366.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 137 PlacesBefore, 42 PlacesAfterwards, 130 TransitionsBefore, 33 TransitionsAfterwards, 2764 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 7266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4099, independent: 3903, independent conditional: 0, independent unconditional: 3903, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1547, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4099, independent: 2396, independent conditional: 0, independent unconditional: 2396, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1547, unknown conditional: 0, unknown unconditional: 1547] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. 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 __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-1, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=0, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=1, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 x = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L777] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix002.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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 7 procedures, 161 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 788 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 610 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2304 IncrementalHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 18 mSDtfsCounter, 2304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=10, InterpolantAutomatonStates: 68, 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, 4.5s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:46:56,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:59,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:59,473 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:46:59,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:59,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:59,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:59,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:59,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:59,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:59,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:59,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:59,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:59,515 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:59,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:59,517 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:59,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:59,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:59,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:59,519 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:46:59,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:46:59,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:46:59,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:59,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:46:59,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:46:59,523 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:46:59,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:46:59,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:59,525 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:59,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:59,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:59,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:59,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:59,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:59,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:59,529 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:46:59,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:46:59,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:59,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:59,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:59,532 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:46:59,532 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:59,533 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_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dab8e857d69436654e6c7f0511b4cf3ecd6cd037fe32ed910d6d601721dfd494 [2023-11-06 22:46:59,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:00,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:00,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:00,024 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:00,024 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:00,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-06 22:47:03,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:03,596 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:03,597 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/sv-benchmarks/c/pthread-wmm/mix002.opt.i [2023-11-06 22:47:03,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data/0592b54af/6b36dcbf025e4d8da48c968b4662dae5/FLAG7d6f6d32c [2023-11-06 22:47:03,638 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/data/0592b54af/6b36dcbf025e4d8da48c968b4662dae5 [2023-11-06 22:47:03,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:03,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:03,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:03,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:03,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:03,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:03" (1/1) ... [2023-11-06 22:47:03,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64722b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:03, skipping insertion in model container [2023-11-06 22:47:03,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:03" (1/1) ... [2023-11-06 22:47:03,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:04,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:04,309 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:04,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:04,440 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:04,440 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:04,448 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:04,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04 WrapperNode [2023-11-06 22:47:04,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:04,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:04,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:04,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:04,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,519 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 159 [2023-11-06 22:47:04,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:04,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:04,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:04,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:04,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:04,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:04,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:04,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:04,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (1/1) ... [2023-11-06 22:47:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:04,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:04,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:47:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:47:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:47:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:47:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:47:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:47:04,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:47:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:47:04,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:47:04,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:47:04,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:47:04,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:47:04,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:04,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:04,667 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:47:04,898 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:04,901 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:05,395 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:05,583 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:05,583 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:47:05,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:05 BoogieIcfgContainer [2023-11-06 22:47:05,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:05,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:05,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:05,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:05,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:03" (1/3) ... [2023-11-06 22:47:05,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4854659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:05, skipping insertion in model container [2023-11-06 22:47:05,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:04" (2/3) ... [2023-11-06 22:47:05,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4854659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:05, skipping insertion in model container [2023-11-06 22:47:05,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:05" (3/3) ... [2023-11-06 22:47:05,595 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-11-06 22:47:05,615 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:05,615 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:47:05,615 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:47:05,682 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:47:05,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 280 flow [2023-11-06 22:47:05,846 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-11-06 22:47:05,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:05,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:47:05,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 280 flow [2023-11-06 22:47:05,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-11-06 22:47:05,869 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:47:05,888 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-11-06 22:47:05,898 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-11-06 22:47:05,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-11-06 22:47:05,955 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-11-06 22:47:05,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:05,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:47:05,961 INFO L119 LiptonReduction]: Number of co-enabled transitions 2764 [2023-11-06 22:47:17,237 INFO L134 LiptonReduction]: Checked pairs total: 7692 [2023-11-06 22:47:17,237 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-11-06 22:47:17,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:17,272 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;@663ecd6d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:17,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:47:17,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:47:17,275 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:47:17,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:17,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:17,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:47:17,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:17,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 608, now seen corresponding path program 1 times [2023-11-06 22:47:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:17,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242686611] [2023-11-06 22:47:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:17,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:17,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:17,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:47:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:17,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:47:17,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:17,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:17,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242686611] [2023-11-06 22:47:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242686611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:47:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291944190] [2023-11-06 22:47:17,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:17,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:17,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:17,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 262 [2023-11-06 22:47:17,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:17,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:17,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 262 [2023-11-06 22:47:17,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:18,033 INFO L124 PetriNetUnfolderBase]: 1527/2286 cut-off events. [2023-11-06 22:47:18,033 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-06 22:47:18,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4573 conditions, 2286 events. 1527/2286 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11162 event pairs, 1527 based on Foata normal form. 0/1941 useless extension candidates. Maximal degree in co-relation 4562. Up to 2241 conditions per place. [2023-11-06 22:47:18,057 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 22:47:18,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-11-06 22:47:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:47:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 272 transitions. [2023-11-06 22:47:18,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190839694656488 [2023-11-06 22:47:18,074 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 272 transitions. [2023-11-06 22:47:18,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 272 transitions. [2023-11-06 22:47:18,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:18,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 272 transitions. [2023-11-06 22:47:18,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 136.0) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,088 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,090 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 272 transitions. [2023-11-06 22:47:18,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-11-06 22:47:18,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:47:18,096 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 22:47:18,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-06 22:47:18,102 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 22:47:18,102 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 22:47:18,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:18,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:18,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:18,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:18,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:18,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1453240762, now seen corresponding path program 1 times [2023-11-06 22:47:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751365943] [2023-11-06 22:47:18,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:18,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:18,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:18,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:18,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:47:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:18,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:47:18,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:18,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:18,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751365943] [2023-11-06 22:47:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751365943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588767213] [2023-11-06 22:47:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:18,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:18,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 262 [2023-11-06 22:47:18,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:18,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 262 [2023-11-06 22:47:18,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:18,947 INFO L124 PetriNetUnfolderBase]: 1263/1986 cut-off events. [2023-11-06 22:47:18,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:18,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1986 events. 1263/1986 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10286 event pairs, 207 based on Foata normal form. 0/1821 useless extension candidates. Maximal degree in co-relation 3892. Up to 1505 conditions per place. [2023-11-06 22:47:18,963 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-06 22:47:18,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-11-06 22:47:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-11-06 22:47:18,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025445292620865 [2023-11-06 22:47:18,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-11-06 22:47:18,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-11-06 22:47:18,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:18,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-11-06 22:47:18,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,976 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 395 transitions. [2023-11-06 22:47:18,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-11-06 22:47:18,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:18,978 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-06 22:47:18,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-11-06 22:47:18,992 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 22:47:18,992 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-06 22:47:18,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:18,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:18,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:19,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:19,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:19,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:19,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash 700066004, now seen corresponding path program 1 times [2023-11-06 22:47:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283449260] [2023-11-06 22:47:19,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:19,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:19,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:19,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:47:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:47:19,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:19,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:19,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283449260] [2023-11-06 22:47:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283449260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:19,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792925956] [2023-11-06 22:47:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:19,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 262 [2023-11-06 22:47:19,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:19,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 262 [2023-11-06 22:47:19,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:19,779 INFO L124 PetriNetUnfolderBase]: 679/1117 cut-off events. [2023-11-06 22:47:19,779 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-06 22:47:19,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 1117 events. 679/1117 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5343 event pairs, 130 based on Foata normal form. 80/1149 useless extension candidates. Maximal degree in co-relation 2327. Up to 752 conditions per place. [2023-11-06 22:47:19,787 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 31 selfloop transitions, 4 changer transitions 21/59 dead transitions. [2023-11-06 22:47:19,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 250 flow [2023-11-06 22:47:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:47:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-11-06 22:47:19,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483206106870229 [2023-11-06 22:47:19,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-11-06 22:47:19,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-11-06 22:47:19,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:19,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-11-06 22:47:19,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,805 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 633 transitions. [2023-11-06 22:47:19,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 250 flow [2023-11-06 22:47:19,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:19,810 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2023-11-06 22:47:19,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-06 22:47:19,812 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-06 22:47:19,812 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow [2023-11-06 22:47:19,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:19,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:19,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:19,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:20,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:20,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 34191386, now seen corresponding path program 1 times [2023-11-06 22:47:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695235590] [2023-11-06 22:47:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:20,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:20,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:20,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:47:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:20,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:47:20,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:20,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-06 22:47:20,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:20,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:20,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695235590] [2023-11-06 22:47:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695235590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:20,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:20,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217111370] [2023-11-06 22:47:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:20,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 262 [2023-11-06 22:47:20,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:20,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:20,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 262 [2023-11-06 22:47:20,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:20,618 INFO L124 PetriNetUnfolderBase]: 274/511 cut-off events. [2023-11-06 22:47:20,619 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2023-11-06 22:47:20,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 511 events. 274/511 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2159 event pairs, 73 based on Foata normal form. 44/540 useless extension candidates. Maximal degree in co-relation 1338. Up to 157 conditions per place. [2023-11-06 22:47:20,623 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 40 selfloop transitions, 7 changer transitions 21/71 dead transitions. [2023-11-06 22:47:20,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 358 flow [2023-11-06 22:47:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:47:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-11-06 22:47:20,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48346055979643765 [2023-11-06 22:47:20,628 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-11-06 22:47:20,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-11-06 22:47:20,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:20,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-11-06 22:47:20,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:20,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:20,639 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:20,640 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 6 states and 760 transitions. [2023-11-06 22:47:20,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 358 flow [2023-11-06 22:47:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 352 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:20,649 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow [2023-11-06 22:47:20,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 22:47:20,657 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-06 22:47:20,657 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow [2023-11-06 22:47:20,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:20,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:20,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:20,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:20,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:20,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:20,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1236810253, now seen corresponding path program 1 times [2023-11-06 22:47:20,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184482888] [2023-11-06 22:47:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:20,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:20,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:47:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:21,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:47:21,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:21,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:21,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184482888] [2023-11-06 22:47:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184482888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:21,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:47:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655468266] [2023-11-06 22:47:21,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:21,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:21,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:21,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:21,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 262 [2023-11-06 22:47:21,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 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-06 22:47:21,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:21,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 262 [2023-11-06 22:47:21,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:21,509 INFO L124 PetriNetUnfolderBase]: 168/322 cut-off events. [2023-11-06 22:47:21,509 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2023-11-06 22:47:21,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 322 events. 168/322 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1226 event pairs, 68 based on Foata normal form. 11/328 useless extension candidates. Maximal degree in co-relation 910. Up to 129 conditions per place. [2023-11-06 22:47:21,512 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 37 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2023-11-06 22:47:21,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 352 flow [2023-11-06 22:47:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:47:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-11-06 22:47:21,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47164667393675025 [2023-11-06 22:47:21,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-11-06 22:47:21,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-11-06 22:47:21,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:21,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-11-06 22:47:21,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,527 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,527 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 865 transitions. [2023-11-06 22:47:21,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 352 flow [2023-11-06 22:47:21,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 316 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 22:47:21,532 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 142 flow [2023-11-06 22:47:21,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-11-06 22:47:21,534 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-06 22:47:21,534 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 142 flow [2023-11-06 22:47:21,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 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-06 22:47:21,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:21,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:21,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:21,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:21,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:21,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 612575086, now seen corresponding path program 1 times [2023-11-06 22:47:21,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:21,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091468113] [2023-11-06 22:47:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:21,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:21,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:21,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:21,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:47:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:21,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:47:21,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:21,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:21,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091468113] [2023-11-06 22:47:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091468113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776759803] [2023-11-06 22:47:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:21,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:21,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 262 [2023-11-06 22:47:21,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:21,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:21,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 262 [2023-11-06 22:47:21,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:22,224 INFO L124 PetriNetUnfolderBase]: 222/439 cut-off events. [2023-11-06 22:47:22,224 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES. [2023-11-06 22:47:22,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 439 events. 222/439 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2047 event pairs, 21 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 1216. Up to 257 conditions per place. [2023-11-06 22:47:22,229 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 57 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-06 22:47:22,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 420 flow [2023-11-06 22:47:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-06 22:47:22,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904580152671756 [2023-11-06 22:47:22,233 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-06 22:47:22,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-06 22:47:22,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:22,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-06 22:47:22,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,239 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,239 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 142 flow. Second operand 4 states and 514 transitions. [2023-11-06 22:47:22,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 420 flow [2023-11-06 22:47:22,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 340 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 22:47:22,244 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 117 flow [2023-11-06 22:47:22,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-11-06 22:47:22,245 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-06 22:47:22,245 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 117 flow [2023-11-06 22:47:22,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:22,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:22,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:22,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:22,459 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:22,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash -873664380, now seen corresponding path program 2 times [2023-11-06 22:47:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312345345] [2023-11-06 22:47:22,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:47:22,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:22,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:22,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:22,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:47:22,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:47:22,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:47:22,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:47:22,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:22,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:22,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312345345] [2023-11-06 22:47:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312345345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693823689] [2023-11-06 22:47:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:22,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:22,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 262 [2023-11-06 22:47:22,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:22,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 262 [2023-11-06 22:47:22,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:22,949 INFO L124 PetriNetUnfolderBase]: 324/652 cut-off events. [2023-11-06 22:47:22,950 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2023-11-06 22:47:22,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 652 events. 324/652 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3256 event pairs, 36 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 1735. Up to 348 conditions per place. [2023-11-06 22:47:22,955 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 57 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-06 22:47:22,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 356 flow [2023-11-06 22:47:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-06 22:47:22,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4904580152671756 [2023-11-06 22:47:22,958 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-06 22:47:22,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-06 22:47:22,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:22,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-06 22:47:22,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,964 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,964 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 117 flow. Second operand 4 states and 514 transitions. [2023-11-06 22:47:22,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 356 flow [2023-11-06 22:47:22,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:22,969 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 129 flow [2023-11-06 22:47:22,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-11-06 22:47:22,970 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-11-06 22:47:22,970 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 129 flow [2023-11-06 22:47:22,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:22,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:22,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:22,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:23,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:23,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:23,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1934723166, now seen corresponding path program 3 times [2023-11-06 22:47:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566818085] [2023-11-06 22:47:23,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:47:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:23,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:23,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:23,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:47:23,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:47:23,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:47:23,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:47:23,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:47:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:24,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:47:24,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:47:24,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566818085] [2023-11-06 22:47:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566818085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:24,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:47:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829800989] [2023-11-06 22:47:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:24,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:47:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:47:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:47:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:47:24,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 262 [2023-11-06 22:47:24,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:24,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:24,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 262 [2023-11-06 22:47:24,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:25,025 INFO L124 PetriNetUnfolderBase]: 298/633 cut-off events. [2023-11-06 22:47:25,025 INFO L125 PetriNetUnfolderBase]: For 624/625 co-relation queries the response was YES. [2023-11-06 22:47:25,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 633 events. 298/633 cut-off events. For 624/625 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3209 event pairs, 77 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 1878. Up to 189 conditions per place. [2023-11-06 22:47:25,031 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 61 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2023-11-06 22:47:25,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 440 flow [2023-11-06 22:47:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:47:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-11-06 22:47:25,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46564885496183206 [2023-11-06 22:47:25,036 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-11-06 22:47:25,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-11-06 22:47:25,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:25,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-11-06 22:47:25,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:25,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:25,061 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:25,061 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 129 flow. Second operand 7 states and 854 transitions. [2023-11-06 22:47:25,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 440 flow [2023-11-06 22:47:25,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:47:25,067 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 147 flow [2023-11-06 22:47:25,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2023-11-06 22:47:25,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-11-06 22:47:25,069 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 147 flow [2023-11-06 22:47:25,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:25,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:25,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:25,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:25,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:25,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:47:25,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1333508022, now seen corresponding path program 4 times [2023-11-06 22:47:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:47:25,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597131316] [2023-11-06 22:47:25,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:47:25,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:25,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:47:25,285 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:47:25,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:47:25,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:47:25,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:47:25,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:47:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:25,661 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:47:25,661 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:47:25,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:47:25,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:47:25,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:47:25,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:47:25,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:47:25,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:47:25,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:47:25,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:47:25,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:47:25,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:47:25,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:47:25,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:47:25,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:47:25,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:47:25,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:47:25,883 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-06 22:47:25,890 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:47:25,890 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:47:26,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:26 BasicIcfg [2023-11-06 22:47:26,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:47:26,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:47:26,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:47:26,018 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:47:26,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:05" (3/4) ... [2023-11-06 22:47:26,021 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:47:26,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:47:26,023 INFO L158 Benchmark]: Toolchain (without parser) took 22379.97ms. Allocated memory was 69.2MB in the beginning and 172.0MB in the end (delta: 102.8MB). Free memory was 43.4MB in the beginning and 108.0MB in the end (delta: -64.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2023-11-06 22:47:26,023 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 45.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:26,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 804.88ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 43.2MB in the beginning and 62.9MB in the end (delta: -19.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-11-06 22:47:26,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.96ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 59.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:47:26,025 INFO L158 Benchmark]: Boogie Preprocessor took 41.02ms. Allocated memory is still 96.5MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:26,026 INFO L158 Benchmark]: RCFGBuilder took 1023.58ms. Allocated memory is still 96.5MB. Free memory was 57.5MB in the beginning and 51.7MB in the end (delta: 5.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2023-11-06 22:47:26,029 INFO L158 Benchmark]: TraceAbstraction took 20429.32ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 51.1MB in the beginning and 109.0MB in the end (delta: -57.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2023-11-06 22:47:26,029 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 172.0MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:26,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 45.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 804.88ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 43.2MB in the beginning and 62.9MB in the end (delta: -19.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.96ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 59.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.02ms. Allocated memory is still 96.5MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1023.58ms. Allocated memory is still 96.5MB. Free memory was 57.5MB in the beginning and 51.7MB in the end (delta: 5.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20429.32ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 51.1MB in the beginning and 109.0MB in the end (delta: -57.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 172.0MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.3s, 138 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 33 TransitionsAfterwards, 2764 CoEnabledTransitionPairs, 8 FixpointIterations, 48 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 7692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3869, independent: 3636, independent conditional: 0, independent unconditional: 3636, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1542, independent: 1490, independent conditional: 0, independent unconditional: 1490, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3869, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1542, unknown conditional: 0, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. 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 __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=0, t41={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=1, t41={-6:0}, t42={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=2, t41={-6:0}, t42={-10:0}, t43={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 x = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={-6:0}, t42={-10:0}, t43={-2:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix002.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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 7 procedures, 162 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1064 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 25 mSDtfsCounter, 1064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 10 NumberOfNonLiveVariables, 975 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:47:26,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_62d990f5-082f-4ff0-8163-0bc1a3793217/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample