./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:09:37,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:09:37,407 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:09:37,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:09:37,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:09:37,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:09:37,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:09:37,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:09:37,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:09:37,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:09:37,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:09:37,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:09:37,483 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:09:37,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:09:37,486 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:09:37,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:09:37,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:09:37,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:09:37,489 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:09:37,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:09:37,491 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:09:37,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:09:37,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:09:37,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:09:37,494 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:09:37,494 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:09:37,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:09:37,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:09:37,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:09:37,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:09:37,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:09:37,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:09:37,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:09:37,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:09:37,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:09:37,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:09:37,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:09:37,502 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:09:37,502 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_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2023-11-06 23:09:37,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:09:37,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:09:37,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:09:37,972 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:09:37,973 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:09:37,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 23:09:41,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:09:42,151 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:09:42,152 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 23:09:42,193 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data/7c8ea6e31/b13ad9d1aab44f7d941192533b14f1fc/FLAGd341b88aa [2023-11-06 23:09:42,213 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data/7c8ea6e31/b13ad9d1aab44f7d941192533b14f1fc [2023-11-06 23:09:42,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:09:42,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:09:42,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:09:42,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:09:42,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:09:42,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:09:42" (1/1) ... [2023-11-06 23:09:42,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510a680a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:42, skipping insertion in model container [2023-11-06 23:09:42,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:09:42" (1/1) ... [2023-11-06 23:09:42,297 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:09:43,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:09:43,053 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:09:43,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:09:43,201 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:43,201 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:09:43,211 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:09:43,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43 WrapperNode [2023-11-06 23:09:43,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:09:43,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:09:43,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:09:43,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:09:43,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,306 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-06 23:09:43,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:09:43,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:09:43,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:09:43,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:09:43,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:09:43,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:09:43,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:09:43,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:09:43,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (1/1) ... [2023-11-06 23:09:43,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:09:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:09:43,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:09:43,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:09:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:09:43,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:09:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:09:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:09:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:09:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:09:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:09:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:09:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:09:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:09:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:09:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:09:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:09:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:09:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:09:43,523 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:09:43,817 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:09:43,820 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:09:44,556 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:09:44,862 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:09:44,862 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:09:44,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:44 BoogieIcfgContainer [2023-11-06 23:09:44,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:09:44,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:09:44,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:09:44,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:09:44,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:09:42" (1/3) ... [2023-11-06 23:09:44,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ae8bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:44, skipping insertion in model container [2023-11-06 23:09:44,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:43" (2/3) ... [2023-11-06 23:09:44,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ae8bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:44, skipping insertion in model container [2023-11-06 23:09:44,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:44" (3/3) ... [2023-11-06 23:09:44,883 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 23:09:44,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:09:44,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 23:09:44,909 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:09:44,984 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:09:45,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 23:09:45,160 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 23:09:45,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:09:45,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:09:45,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 23:09:45,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 124 transitions, 257 flow [2023-11-06 23:09:45,180 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:09:45,193 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 23:09:45,197 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 23:09:45,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 257 flow [2023-11-06 23:09:45,236 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 23:09:45,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:09:45,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:09:45,242 INFO L119 LiptonReduction]: Number of co-enabled transitions 2670 [2023-11-06 23:09:54,924 INFO L134 LiptonReduction]: Checked pairs total: 7401 [2023-11-06 23:09:54,925 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-11-06 23:09:54,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:09:54,954 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;@7f02ff0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:09:54,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 23:09:54,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:09:54,958 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 23:09:54,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:09:54,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:54,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:09:54,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:09:54,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 653, now seen corresponding path program 1 times [2023-11-06 23:09:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992416512] [2023-11-06 23:09:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:09:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:55,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992416512] [2023-11-06 23:09:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992416512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:55,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:09:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919687458] [2023-11-06 23:09:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:55,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:09:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:09:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:09:55,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-11-06 23:09:55,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:55,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:55,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-11-06 23:09:55,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:56,353 INFO L124 PetriNetUnfolderBase]: 2149/3130 cut-off events. [2023-11-06 23:09:56,354 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-06 23:09:56,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 3130 events. 2149/3130 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14339 event pairs, 2149 based on Foata normal form. 0/2632 useless extension candidates. Maximal degree in co-relation 6320. Up to 3123 conditions per place. [2023-11-06 23:09:56,397 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-11-06 23:09:56,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 107 flow [2023-11-06 23:09:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:09:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:09:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2023-11-06 23:09:56,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2023-11-06 23:09:56,426 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2023-11-06 23:09:56,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2023-11-06 23:09:56,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:56,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2023-11-06 23:09:56,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:56,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:56,453 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:56,455 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 2 states and 250 transitions. [2023-11-06 23:09:56,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 107 flow [2023-11-06 23:09:56,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:09:56,465 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-11-06 23:09:56,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-06 23:09:56,476 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-11-06 23:09:56,476 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-11-06 23:09:56,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:56,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:56,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:09:56,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:09:56,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:09:56,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 617286310, now seen corresponding path program 1 times [2023-11-06 23:09:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205448425] [2023-11-06 23:09:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:56,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:09:57,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:57,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205448425] [2023-11-06 23:09:57,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205448425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:57,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:57,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:09:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846129409] [2023-11-06 23:09:57,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:57,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:09:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:09:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:09:57,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-11-06 23:09:57,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:57,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:57,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-11-06 23:09:57,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:57,860 INFO L124 PetriNetUnfolderBase]: 1683/2656 cut-off events. [2023-11-06 23:09:57,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:09:57,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5185 conditions, 2656 events. 1683/2656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13871 event pairs, 285 based on Foata normal form. 0/2416 useless extension candidates. Maximal degree in co-relation 5182. Up to 1975 conditions per place. [2023-11-06 23:09:57,884 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 35 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-06 23:09:57,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 166 flow [2023-11-06 23:09:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:09:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:09:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-11-06 23:09:57,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4705128205128205 [2023-11-06 23:09:57,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-11-06 23:09:57,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-11-06 23:09:57,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:57,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-11-06 23:09:57,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 23:09:57,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:57,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:57,909 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 367 transitions. [2023-11-06 23:09:57,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 166 flow [2023-11-06 23:09:57,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:09:57,916 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-11-06 23:09:57,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-06 23:09:57,917 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-11-06 23:09:57,918 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-11-06 23:09:57,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:57,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:57,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:57,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:09:57,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:09:57,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1616434731, now seen corresponding path program 1 times [2023-11-06 23:09:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624468926] [2023-11-06 23:09:57,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:09:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:59,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624468926] [2023-11-06 23:09:59,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624468926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:59,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:59,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:09:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798653125] [2023-11-06 23:09:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:59,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:09:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:09:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:09:59,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260 [2023-11-06 23:09:59,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:09:59,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:59,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260 [2023-11-06 23:09:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:00,676 INFO L124 PetriNetUnfolderBase]: 1463/2200 cut-off events. [2023-11-06 23:10:00,676 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2023-11-06 23:10:00,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 2200 events. 1463/2200 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10139 event pairs, 287 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 4639. Up to 1649 conditions per place. [2023-11-06 23:10:00,699 INFO L140 encePairwiseOnDemand]: 249/260 looper letters, 34 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2023-11-06 23:10:00,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 192 flow [2023-11-06 23:10:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:10:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-11-06 23:10:00,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355769230769231 [2023-11-06 23:10:00,703 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-11-06 23:10:00,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-11-06 23:10:00,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:00,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-11-06 23:10:00,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:00,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:00,711 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:00,711 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 4 states and 453 transitions. [2023-11-06 23:10:00,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 192 flow [2023-11-06 23:10:00,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:00,714 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 126 flow [2023-11-06 23:10:00,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-11-06 23:10:00,716 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-11-06 23:10:00,716 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 126 flow [2023-11-06 23:10:00,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:00,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:00,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:00,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:00,718 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:00,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1616434754, now seen corresponding path program 1 times [2023-11-06 23:10:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:00,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121370910] [2023-11-06 23:10:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:01,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121370910] [2023-11-06 23:10:01,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121370910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261111761] [2023-11-06 23:10:01,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:01,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:01,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:01,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 260 [2023-11-06 23:10:01,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:01,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:01,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 260 [2023-11-06 23:10:01,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:02,235 INFO L124 PetriNetUnfolderBase]: 1118/1698 cut-off events. [2023-11-06 23:10:02,235 INFO L125 PetriNetUnfolderBase]: For 813/816 co-relation queries the response was YES. [2023-11-06 23:10:02,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 1698 events. 1118/1698 cut-off events. For 813/816 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7723 event pairs, 274 based on Foata normal form. 108/1806 useless extension candidates. Maximal degree in co-relation 4605. Up to 1107 conditions per place. [2023-11-06 23:10:02,252 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 44 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2023-11-06 23:10:02,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 286 flow [2023-11-06 23:10:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:10:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2023-11-06 23:10:02,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046153846153846 [2023-11-06 23:10:02,256 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2023-11-06 23:10:02,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2023-11-06 23:10:02,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:02,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2023-11-06 23:10:02,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,266 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 126 flow. Second operand 5 states and 526 transitions. [2023-11-06 23:10:02,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 286 flow [2023-11-06 23:10:02,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:02,270 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 154 flow [2023-11-06 23:10:02,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 23:10:02,272 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-11-06 23:10:02,272 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 154 flow [2023-11-06 23:10:02,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:02,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:02,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:02,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:02,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash 38988674, now seen corresponding path program 1 times [2023-11-06 23:10:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440465911] [2023-11-06 23:10:02,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:04,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440465911] [2023-11-06 23:10:04,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440465911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:04,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735931805] [2023-11-06 23:10:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:04,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:05,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 260 [2023-11-06 23:10:05,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 154 flow. Second operand has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:05,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:05,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 260 [2023-11-06 23:10:05,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:06,763 INFO L124 PetriNetUnfolderBase]: 1842/2871 cut-off events. [2023-11-06 23:10:06,764 INFO L125 PetriNetUnfolderBase]: For 1727/1727 co-relation queries the response was YES. [2023-11-06 23:10:06,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 2871 events. 1842/2871 cut-off events. For 1727/1727 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14661 event pairs, 886 based on Foata normal form. 72/2940 useless extension candidates. Maximal degree in co-relation 8067. Up to 1689 conditions per place. [2023-11-06 23:10:06,805 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 62 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-11-06 23:10:06,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 445 flow [2023-11-06 23:10:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 701 transitions. [2023-11-06 23:10:06,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3851648351648352 [2023-11-06 23:10:06,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 701 transitions. [2023-11-06 23:10:06,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 701 transitions. [2023-11-06 23:10:06,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:06,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 701 transitions. [2023-11-06 23:10:06,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 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 23:10:06,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:06,825 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:06,826 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 154 flow. Second operand 7 states and 701 transitions. [2023-11-06 23:10:06,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 445 flow [2023-11-06 23:10:06,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:06,838 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 224 flow [2023-11-06 23:10:06,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-06 23:10:06,842 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-11-06 23:10:06,842 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 224 flow [2023-11-06 23:10:06,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:06,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:06,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:06,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:06,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:06,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -462176136, now seen corresponding path program 2 times [2023-11-06 23:10:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270548444] [2023-11-06 23:10:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270548444] [2023-11-06 23:10:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270548444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:07,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920805522] [2023-11-06 23:10:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:08,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:08,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:08,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 260 [2023-11-06 23:10:08,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:08,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:08,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 260 [2023-11-06 23:10:08,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:09,279 INFO L124 PetriNetUnfolderBase]: 1653/2504 cut-off events. [2023-11-06 23:10:09,279 INFO L125 PetriNetUnfolderBase]: For 2861/2861 co-relation queries the response was YES. [2023-11-06 23:10:09,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7368 conditions, 2504 events. 1653/2504 cut-off events. For 2861/2861 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11979 event pairs, 720 based on Foata normal form. 60/2564 useless extension candidates. Maximal degree in co-relation 7354. Up to 2408 conditions per place. [2023-11-06 23:10:09,311 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 40 selfloop transitions, 15 changer transitions 0/56 dead transitions. [2023-11-06 23:10:09,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 386 flow [2023-11-06 23:10:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-11-06 23:10:09,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37252747252747254 [2023-11-06 23:10:09,318 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-11-06 23:10:09,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-11-06 23:10:09,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:09,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-11-06 23:10:09,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:09,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:09,327 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:09,328 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 224 flow. Second operand 7 states and 678 transitions. [2023-11-06 23:10:09,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 386 flow [2023-11-06 23:10:09,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 381 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:10:09,336 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 248 flow [2023-11-06 23:10:09,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-11-06 23:10:09,339 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-11-06 23:10:09,343 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 248 flow [2023-11-06 23:10:09,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:09,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:09,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:10:09,346 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:09,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1508519610, now seen corresponding path program 1 times [2023-11-06 23:10:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:09,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968155225] [2023-11-06 23:10:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968155225] [2023-11-06 23:10:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968155225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:10,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:10,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:10,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894821817] [2023-11-06 23:10:10,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:10,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:10,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 260 [2023-11-06 23:10:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:10,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 260 [2023-11-06 23:10:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:11,881 INFO L124 PetriNetUnfolderBase]: 2785/4186 cut-off events. [2023-11-06 23:10:11,882 INFO L125 PetriNetUnfolderBase]: For 3450/3450 co-relation queries the response was YES. [2023-11-06 23:10:11,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11769 conditions, 4186 events. 2785/4186 cut-off events. For 3450/3450 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21473 event pairs, 511 based on Foata normal form. 108/4294 useless extension candidates. Maximal degree in co-relation 11755. Up to 1837 conditions per place. [2023-11-06 23:10:11,923 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 55 selfloop transitions, 3 changer transitions 7/65 dead transitions. [2023-11-06 23:10:11,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 487 flow [2023-11-06 23:10:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:10:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-11-06 23:10:11,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43173076923076925 [2023-11-06 23:10:11,927 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-11-06 23:10:11,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-11-06 23:10:11,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:11,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-11-06 23:10:11,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:11,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:11,933 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:11,934 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 248 flow. Second operand 4 states and 449 transitions. [2023-11-06 23:10:11,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 487 flow [2023-11-06 23:10:11,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 466 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:11,944 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 245 flow [2023-11-06 23:10:11,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2023-11-06 23:10:11,946 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-11-06 23:10:11,946 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 245 flow [2023-11-06 23:10:11,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:11,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:11,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:11,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:10:11,947 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:11,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 260936723, now seen corresponding path program 1 times [2023-11-06 23:10:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305939629] [2023-11-06 23:10:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305939629] [2023-11-06 23:10:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305939629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577745834] [2023-11-06 23:10:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:13,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:10:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:10:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:13,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 260 [2023-11-06 23:10:13,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 245 flow. Second operand has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 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 23:10:13,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:13,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 260 [2023-11-06 23:10:13,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:14,158 INFO L124 PetriNetUnfolderBase]: 1491/2311 cut-off events. [2023-11-06 23:10:14,158 INFO L125 PetriNetUnfolderBase]: For 2438/2438 co-relation queries the response was YES. [2023-11-06 23:10:14,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7085 conditions, 2311 events. 1491/2311 cut-off events. For 2438/2438 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10955 event pairs, 205 based on Foata normal form. 8/2318 useless extension candidates. Maximal degree in co-relation 7069. Up to 1931 conditions per place. [2023-11-06 23:10:14,189 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 54 selfloop transitions, 21 changer transitions 0/76 dead transitions. [2023-11-06 23:10:14,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 559 flow [2023-11-06 23:10:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:10:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-11-06 23:10:14,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2023-11-06 23:10:14,194 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-11-06 23:10:14,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-11-06 23:10:14,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:14,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-11-06 23:10:14,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:14,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:14,206 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:14,207 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 245 flow. Second operand 6 states and 690 transitions. [2023-11-06 23:10:14,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 559 flow [2023-11-06 23:10:14,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 538 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 23:10:14,216 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 376 flow [2023-11-06 23:10:14,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-11-06 23:10:14,219 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-11-06 23:10:14,220 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 376 flow [2023-11-06 23:10:14,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 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 23:10:14,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:14,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:14,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:10:14,221 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:14,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1867236215, now seen corresponding path program 2 times [2023-11-06 23:10:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610811421] [2023-11-06 23:10:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:15,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610811421] [2023-11-06 23:10:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610811421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:15,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927859458] [2023-11-06 23:10:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:15,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 260 [2023-11-06 23:10:15,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:15,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:15,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 260 [2023-11-06 23:10:15,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:15,856 INFO L124 PetriNetUnfolderBase]: 1740/2677 cut-off events. [2023-11-06 23:10:15,856 INFO L125 PetriNetUnfolderBase]: For 4508/4508 co-relation queries the response was YES. [2023-11-06 23:10:15,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 2677 events. 1740/2677 cut-off events. For 4508/4508 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12976 event pairs, 412 based on Foata normal form. 24/2698 useless extension candidates. Maximal degree in co-relation 9336. Up to 2058 conditions per place. [2023-11-06 23:10:15,892 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 52 selfloop transitions, 29 changer transitions 0/82 dead transitions. [2023-11-06 23:10:15,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 710 flow [2023-11-06 23:10:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:10:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2023-11-06 23:10:15,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371794871794872 [2023-11-06 23:10:15,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2023-11-06 23:10:15,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2023-11-06 23:10:15,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:15,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2023-11-06 23:10:15,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:15,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:15,909 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:15,909 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 376 flow. Second operand 6 states and 682 transitions. [2023-11-06 23:10:15,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 710 flow [2023-11-06 23:10:15,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 82 transitions, 674 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-11-06 23:10:15,928 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 539 flow [2023-11-06 23:10:15,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-11-06 23:10:15,930 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-11-06 23:10:15,930 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 539 flow [2023-11-06 23:10:15,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:15,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:15,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:15,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:10:15,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:15,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash -440365142, now seen corresponding path program 1 times [2023-11-06 23:10:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430967284] [2023-11-06 23:10:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:16,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430967284] [2023-11-06 23:10:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430967284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:16,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802876177] [2023-11-06 23:10:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:16,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:16,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:16,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 260 [2023-11-06 23:10:16,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 539 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:16,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:16,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 260 [2023-11-06 23:10:16,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:16,912 INFO L124 PetriNetUnfolderBase]: 1422/2319 cut-off events. [2023-11-06 23:10:16,912 INFO L125 PetriNetUnfolderBase]: For 8293/8296 co-relation queries the response was YES. [2023-11-06 23:10:16,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9452 conditions, 2319 events. 1422/2319 cut-off events. For 8293/8296 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12073 event pairs, 175 based on Foata normal form. 237/2553 useless extension candidates. Maximal degree in co-relation 9435. Up to 1196 conditions per place. [2023-11-06 23:10:16,936 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 89 selfloop transitions, 4 changer transitions 56/150 dead transitions. [2023-11-06 23:10:16,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 150 transitions, 1519 flow [2023-11-06 23:10:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:10:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-11-06 23:10:16,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376923076923077 [2023-11-06 23:10:16,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-11-06 23:10:16,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-11-06 23:10:16,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:16,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-11-06 23:10:16,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:16,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:16,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:16,950 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 539 flow. Second operand 5 states and 569 transitions. [2023-11-06 23:10:16,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 150 transitions, 1519 flow [2023-11-06 23:10:16,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 150 transitions, 1460 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:16,968 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 558 flow [2023-11-06 23:10:16,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=558, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2023-11-06 23:10:16,969 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-11-06 23:10:16,969 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 558 flow [2023-11-06 23:10:16,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:16,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:16,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:16,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:10:16,971 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:16,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 655118012, now seen corresponding path program 1 times [2023-11-06 23:10:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258735203] [2023-11-06 23:10:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258735203] [2023-11-06 23:10:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258735203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:17,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:17,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:17,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342321553] [2023-11-06 23:10:17,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:17,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:17,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 260 [2023-11-06 23:10:17,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 558 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:17,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:17,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 260 [2023-11-06 23:10:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:17,956 INFO L124 PetriNetUnfolderBase]: 738/1298 cut-off events. [2023-11-06 23:10:17,956 INFO L125 PetriNetUnfolderBase]: For 3912/3915 co-relation queries the response was YES. [2023-11-06 23:10:17,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5891 conditions, 1298 events. 738/1298 cut-off events. For 3912/3915 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6349 event pairs, 103 based on Foata normal form. 120/1415 useless extension candidates. Maximal degree in co-relation 5871. Up to 532 conditions per place. [2023-11-06 23:10:17,973 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 101 selfloop transitions, 7 changer transitions 34/143 dead transitions. [2023-11-06 23:10:17,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 143 transitions, 1420 flow [2023-11-06 23:10:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:10:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2023-11-06 23:10:17,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371794871794872 [2023-11-06 23:10:17,978 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2023-11-06 23:10:17,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2023-11-06 23:10:17,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:17,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2023-11-06 23:10:17,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:17,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:17,987 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:17,987 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 558 flow. Second operand 6 states and 682 transitions. [2023-11-06 23:10:17,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 143 transitions, 1420 flow [2023-11-06 23:10:17,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 143 transitions, 1414 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:18,008 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 608 flow [2023-11-06 23:10:18,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=608, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-11-06 23:10:18,009 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2023-11-06 23:10:18,010 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 608 flow [2023-11-06 23:10:18,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:18,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:18,011 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 23:10:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:10:18,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:18,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash 167414946, now seen corresponding path program 1 times [2023-11-06 23:10:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066649082] [2023-11-06 23:10:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066649082] [2023-11-06 23:10:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066649082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:18,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:18,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:18,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117772181] [2023-11-06 23:10:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:18,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:18,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 260 [2023-11-06 23:10:18,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:18,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:18,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 260 [2023-11-06 23:10:18,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:18,834 INFO L124 PetriNetUnfolderBase]: 514/918 cut-off events. [2023-11-06 23:10:18,835 INFO L125 PetriNetUnfolderBase]: For 3217/3220 co-relation queries the response was YES. [2023-11-06 23:10:18,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 918 events. 514/918 cut-off events. For 3217/3220 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4283 event pairs, 97 based on Foata normal form. 26/941 useless extension candidates. Maximal degree in co-relation 4427. Up to 438 conditions per place. [2023-11-06 23:10:18,847 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 98 selfloop transitions, 10 changer transitions 14/123 dead transitions. [2023-11-06 23:10:18,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 1273 flow [2023-11-06 23:10:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 771 transitions. [2023-11-06 23:10:18,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236263736263736 [2023-11-06 23:10:18,853 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 771 transitions. [2023-11-06 23:10:18,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 771 transitions. [2023-11-06 23:10:18,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:18,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 771 transitions. [2023-11-06 23:10:18,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:18,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:18,863 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:18,863 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 608 flow. Second operand 7 states and 771 transitions. [2023-11-06 23:10:18,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 1273 flow [2023-11-06 23:10:18,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 123 transitions, 1213 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-06 23:10:18,883 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 593 flow [2023-11-06 23:10:18,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2023-11-06 23:10:18,884 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-11-06 23:10:18,884 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 593 flow [2023-11-06 23:10:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:18,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:18,885 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 23:10:18,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:10:18,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:18,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1345639908, now seen corresponding path program 1 times [2023-11-06 23:10:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33133012] [2023-11-06 23:10:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33133012] [2023-11-06 23:10:21,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33133012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:21,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:21,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773372616] [2023-11-06 23:10:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:21,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:21,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 260 [2023-11-06 23:10:21,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 593 flow. Second operand has 9 states, 9 states have (on average 105.33333333333333) internal successors, (948), 9 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:21,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:21,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 260 [2023-11-06 23:10:21,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:22,603 INFO L124 PetriNetUnfolderBase]: 673/1242 cut-off events. [2023-11-06 23:10:22,603 INFO L125 PetriNetUnfolderBase]: For 3720/3723 co-relation queries the response was YES. [2023-11-06 23:10:22,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 1242 events. 673/1242 cut-off events. For 3720/3723 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6382 event pairs, 65 based on Foata normal form. 2/1241 useless extension candidates. Maximal degree in co-relation 5841. Up to 517 conditions per place. [2023-11-06 23:10:22,617 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 97 selfloop transitions, 35 changer transitions 31/164 dead transitions. [2023-11-06 23:10:22,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 164 transitions, 1592 flow [2023-11-06 23:10:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:10:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 23:10:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1227 transitions. [2023-11-06 23:10:22,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.429020979020979 [2023-11-06 23:10:22,625 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1227 transitions. [2023-11-06 23:10:22,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1227 transitions. [2023-11-06 23:10:22,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:22,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1227 transitions. [2023-11-06 23:10:22,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:22,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 260.0) internal successors, (3120), 12 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:22,639 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 260.0) internal successors, (3120), 12 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:22,639 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 593 flow. Second operand 11 states and 1227 transitions. [2023-11-06 23:10:22,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 164 transitions, 1592 flow [2023-11-06 23:10:22,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 164 transitions, 1428 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-11-06 23:10:22,659 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 775 flow [2023-11-06 23:10:22,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=775, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2023-11-06 23:10:22,660 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-11-06 23:10:22,661 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 775 flow [2023-11-06 23:10:22,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.33333333333333) internal successors, (948), 9 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:22,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:22,662 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 23:10:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:10:22,662 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:22,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1210304866, now seen corresponding path program 2 times [2023-11-06 23:10:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913663057] [2023-11-06 23:10:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:24,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913663057] [2023-11-06 23:10:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913663057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137249420] [2023-11-06 23:10:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:24,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:24,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:24,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260 [2023-11-06 23:10:24,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 775 flow. Second operand has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:24,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:24,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260 [2023-11-06 23:10:24,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:25,324 INFO L124 PetriNetUnfolderBase]: 768/1412 cut-off events. [2023-11-06 23:10:25,325 INFO L125 PetriNetUnfolderBase]: For 6528/6531 co-relation queries the response was YES. [2023-11-06 23:10:25,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7295 conditions, 1412 events. 768/1412 cut-off events. For 6528/6531 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7531 event pairs, 107 based on Foata normal form. 4/1415 useless extension candidates. Maximal degree in co-relation 7271. Up to 625 conditions per place. [2023-11-06 23:10:25,341 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 67 selfloop transitions, 25 changer transitions 49/142 dead transitions. [2023-11-06 23:10:25,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 142 transitions, 1525 flow [2023-11-06 23:10:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:10:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 887 transitions. [2023-11-06 23:10:25,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264423076923077 [2023-11-06 23:10:25,348 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 887 transitions. [2023-11-06 23:10:25,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 887 transitions. [2023-11-06 23:10:25,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:25,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 887 transitions. [2023-11-06 23:10:25,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:25,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:25,362 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:25,362 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 775 flow. Second operand 8 states and 887 transitions. [2023-11-06 23:10:25,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 142 transitions, 1525 flow [2023-11-06 23:10:25,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 142 transitions, 1482 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-06 23:10:25,402 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 832 flow [2023-11-06 23:10:25,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=832, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2023-11-06 23:10:25,405 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-11-06 23:10:25,405 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 832 flow [2023-11-06 23:10:25,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:25,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:25,406 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 23:10:25,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:10:25,407 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:25,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2105061920, now seen corresponding path program 3 times [2023-11-06 23:10:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116097996] [2023-11-06 23:10:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116097996] [2023-11-06 23:10:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116097996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:26,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:26,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278074022] [2023-11-06 23:10:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:26,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:26,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260 [2023-11-06 23:10:26,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:26,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:26,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260 [2023-11-06 23:10:26,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:26,772 INFO L124 PetriNetUnfolderBase]: 557/1047 cut-off events. [2023-11-06 23:10:26,772 INFO L125 PetriNetUnfolderBase]: For 5439/5442 co-relation queries the response was YES. [2023-11-06 23:10:26,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 1047 events. 557/1047 cut-off events. For 5439/5442 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5301 event pairs, 65 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 5611. Up to 428 conditions per place. [2023-11-06 23:10:26,785 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 73 selfloop transitions, 32 changer transitions 15/121 dead transitions. [2023-11-06 23:10:26,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 121 transitions, 1353 flow [2023-11-06 23:10:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:10:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 899 transitions. [2023-11-06 23:10:26,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4322115384615385 [2023-11-06 23:10:26,792 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 899 transitions. [2023-11-06 23:10:26,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 899 transitions. [2023-11-06 23:10:26,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:26,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 899 transitions. [2023-11-06 23:10:26,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.375) internal successors, (899), 8 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:26,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:26,804 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:26,804 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 832 flow. Second operand 8 states and 899 transitions. [2023-11-06 23:10:26,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 121 transitions, 1353 flow [2023-11-06 23:10:26,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 121 transitions, 1264 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-11-06 23:10:26,845 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 885 flow [2023-11-06 23:10:26,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=885, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2023-11-06 23:10:26,848 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-11-06 23:10:26,848 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 885 flow [2023-11-06 23:10:26,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:26,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:26,849 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 23:10:26,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:10:26,850 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:26,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash 176041180, now seen corresponding path program 4 times [2023-11-06 23:10:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:26,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077250411] [2023-11-06 23:10:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:28,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077250411] [2023-11-06 23:10:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077250411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:28,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:28,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742653176] [2023-11-06 23:10:28,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:28,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:28,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-11-06 23:10:28,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 885 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:28,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:28,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-11-06 23:10:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:29,288 INFO L124 PetriNetUnfolderBase]: 540/1019 cut-off events. [2023-11-06 23:10:29,289 INFO L125 PetriNetUnfolderBase]: For 5768/5771 co-relation queries the response was YES. [2023-11-06 23:10:29,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5516 conditions, 1019 events. 540/1019 cut-off events. For 5768/5771 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5194 event pairs, 123 based on Foata normal form. 4/1022 useless extension candidates. Maximal degree in co-relation 5491. Up to 770 conditions per place. [2023-11-06 23:10:29,298 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 67 selfloop transitions, 24 changer transitions 19/111 dead transitions. [2023-11-06 23:10:29,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 111 transitions, 1317 flow [2023-11-06 23:10:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:10:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-06 23:10:29,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391025641025641 [2023-11-06 23:10:29,304 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-06 23:10:29,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-06 23:10:29,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:29,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-06 23:10:29,308 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 23:10:29,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:29,313 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:29,313 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 885 flow. Second operand 6 states and 685 transitions. [2023-11-06 23:10:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 111 transitions, 1317 flow [2023-11-06 23:10:29,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1246 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-06 23:10:29,339 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 855 flow [2023-11-06 23:10:29,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=855, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2023-11-06 23:10:29,340 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-11-06 23:10:29,340 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 855 flow [2023-11-06 23:10:29,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:29,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:29,342 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 23:10:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:10:29,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:29,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash -909346834, now seen corresponding path program 5 times [2023-11-06 23:10:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182424274] [2023-11-06 23:10:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182424274] [2023-11-06 23:10:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182424274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576917619] [2023-11-06 23:10:31,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:31,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:31,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 260 [2023-11-06 23:10:31,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 855 flow. Second operand has 9 states, 9 states have (on average 105.33333333333333) internal successors, (948), 9 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:31,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:31,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 260 [2023-11-06 23:10:31,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:31,994 INFO L124 PetriNetUnfolderBase]: 571/1089 cut-off events. [2023-11-06 23:10:32,000 INFO L125 PetriNetUnfolderBase]: For 6760/6763 co-relation queries the response was YES. [2023-11-06 23:10:32,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5876 conditions, 1089 events. 571/1089 cut-off events. For 6760/6763 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5675 event pairs, 116 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 5852. Up to 481 conditions per place. [2023-11-06 23:10:32,014 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 73 selfloop transitions, 17 changer transitions 21/112 dead transitions. [2023-11-06 23:10:32,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 1301 flow [2023-11-06 23:10:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2023-11-06 23:10:32,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269230769230769 [2023-11-06 23:10:32,023 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 777 transitions. [2023-11-06 23:10:32,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 777 transitions. [2023-11-06 23:10:32,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:32,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 777 transitions. [2023-11-06 23:10:32,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,047 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,047 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 855 flow. Second operand 7 states and 777 transitions. [2023-11-06 23:10:32,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 1301 flow [2023-11-06 23:10:32,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 112 transitions, 1184 flow, removed 45 selfloop flow, removed 7 redundant places. [2023-11-06 23:10:32,080 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 758 flow [2023-11-06 23:10:32,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=758, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2023-11-06 23:10:32,082 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2023-11-06 23:10:32,083 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 758 flow [2023-11-06 23:10:32,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.33333333333333) internal successors, (948), 9 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:32,084 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 23:10:32,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:10:32,085 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:32,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash -330776770, now seen corresponding path program 6 times [2023-11-06 23:10:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892238420] [2023-11-06 23:10:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892238420] [2023-11-06 23:10:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892238420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:33,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:33,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:33,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367037814] [2023-11-06 23:10:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:33,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:33,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260 [2023-11-06 23:10:33,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 758 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:33,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:33,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260 [2023-11-06 23:10:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:34,002 INFO L124 PetriNetUnfolderBase]: 643/1224 cut-off events. [2023-11-06 23:10:34,002 INFO L125 PetriNetUnfolderBase]: For 6118/6121 co-relation queries the response was YES. [2023-11-06 23:10:34,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6152 conditions, 1224 events. 643/1224 cut-off events. For 6118/6121 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6553 event pairs, 83 based on Foata normal form. 4/1225 useless extension candidates. Maximal degree in co-relation 6128. Up to 557 conditions per place. [2023-11-06 23:10:34,012 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 70 selfloop transitions, 22 changer transitions 53/146 dead transitions. [2023-11-06 23:10:34,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 1592 flow [2023-11-06 23:10:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:10:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2023-11-06 23:10:34,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43509615384615385 [2023-11-06 23:10:34,018 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2023-11-06 23:10:34,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2023-11-06 23:10:34,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:34,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2023-11-06 23:10:34,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,027 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,028 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 758 flow. Second operand 8 states and 905 transitions. [2023-11-06 23:10:34,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 1592 flow [2023-11-06 23:10:34,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 146 transitions, 1492 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-11-06 23:10:34,064 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 821 flow [2023-11-06 23:10:34,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=821, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-11-06 23:10:34,065 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-11-06 23:10:34,066 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 821 flow [2023-11-06 23:10:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:34,067 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 23:10:34,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:10:34,067 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:34,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1791819918, now seen corresponding path program 7 times [2023-11-06 23:10:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127132256] [2023-11-06 23:10:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:35,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127132256] [2023-11-06 23:10:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127132256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:35,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:35,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:35,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127265170] [2023-11-06 23:10:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:35,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 260 [2023-11-06 23:10:35,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 821 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:35,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:35,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 260 [2023-11-06 23:10:35,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:35,922 INFO L124 PetriNetUnfolderBase]: 455/893 cut-off events. [2023-11-06 23:10:35,922 INFO L125 PetriNetUnfolderBase]: For 5215/5218 co-relation queries the response was YES. [2023-11-06 23:10:35,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4648 conditions, 893 events. 455/893 cut-off events. For 5215/5218 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4490 event pairs, 116 based on Foata normal form. 4/894 useless extension candidates. Maximal degree in co-relation 4622. Up to 352 conditions per place. [2023-11-06 23:10:35,932 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 56 selfloop transitions, 33 changer transitions 27/117 dead transitions. [2023-11-06 23:10:35,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 117 transitions, 1338 flow [2023-11-06 23:10:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2023-11-06 23:10:35,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2023-11-06 23:10:35,936 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2023-11-06 23:10:35,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2023-11-06 23:10:35,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:35,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2023-11-06 23:10:35,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:35,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:35,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:35,944 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 821 flow. Second operand 7 states and 767 transitions. [2023-11-06 23:10:35,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 117 transitions, 1338 flow [2023-11-06 23:10:35,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 117 transitions, 1286 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-11-06 23:10:35,974 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 875 flow [2023-11-06 23:10:35,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=875, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2023-11-06 23:10:35,975 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2023-11-06 23:10:35,975 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 875 flow [2023-11-06 23:10:35,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:35,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:35,976 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 23:10:35,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:10:35,976 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:35,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1437143764, now seen corresponding path program 8 times [2023-11-06 23:10:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896387252] [2023-11-06 23:10:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896387252] [2023-11-06 23:10:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896387252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:39,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:39,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:10:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483818901] [2023-11-06 23:10:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:39,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:10:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:10:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:10:39,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 260 [2023-11-06 23:10:39,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 875 flow. Second operand has 11 states, 11 states have (on average 100.9090909090909) internal successors, (1110), 11 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:39,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:39,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 260 [2023-11-06 23:10:39,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:40,515 INFO L124 PetriNetUnfolderBase]: 360/735 cut-off events. [2023-11-06 23:10:40,515 INFO L125 PetriNetUnfolderBase]: For 4773/4776 co-relation queries the response was YES. [2023-11-06 23:10:40,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 735 events. 360/735 cut-off events. For 4773/4776 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3586 event pairs, 45 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 4014. Up to 230 conditions per place. [2023-11-06 23:10:40,523 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 81 selfloop transitions, 30 changer transitions 26/138 dead transitions. [2023-11-06 23:10:40,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 138 transitions, 1551 flow [2023-11-06 23:10:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:10:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 862 transitions. [2023-11-06 23:10:40,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41442307692307695 [2023-11-06 23:10:40,528 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 862 transitions. [2023-11-06 23:10:40,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 862 transitions. [2023-11-06 23:10:40,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:40,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 862 transitions. [2023-11-06 23:10:40,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,536 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,537 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 875 flow. Second operand 8 states and 862 transitions. [2023-11-06 23:10:40,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 138 transitions, 1551 flow [2023-11-06 23:10:40,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 1476 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-11-06 23:10:40,565 INFO L231 Difference]: Finished difference. Result has 94 places, 70 transitions, 839 flow [2023-11-06 23:10:40,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=839, PETRI_PLACES=94, PETRI_TRANSITIONS=70} [2023-11-06 23:10:40,566 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2023-11-06 23:10:40,566 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 70 transitions, 839 flow [2023-11-06 23:10:40,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.9090909090909) internal successors, (1110), 11 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:40,567 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 23:10:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:10:40,567 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:40,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -492596888, now seen corresponding path program 9 times [2023-11-06 23:10:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447153398] [2023-11-06 23:10:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447153398] [2023-11-06 23:10:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447153398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882732269] [2023-11-06 23:10:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:42,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260 [2023-11-06 23:10:42,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 70 transitions, 839 flow. Second operand has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:42,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:42,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260 [2023-11-06 23:10:42,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:42,737 INFO L124 PetriNetUnfolderBase]: 284/582 cut-off events. [2023-11-06 23:10:42,737 INFO L125 PetriNetUnfolderBase]: For 4039/4042 co-relation queries the response was YES. [2023-11-06 23:10:42,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 582 events. 284/582 cut-off events. For 4039/4042 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2613 event pairs, 66 based on Foata normal form. 4/584 useless extension candidates. Maximal degree in co-relation 3228. Up to 216 conditions per place. [2023-11-06 23:10:42,742 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 46 selfloop transitions, 9 changer transitions 67/123 dead transitions. [2023-11-06 23:10:42,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 123 transitions, 1444 flow [2023-11-06 23:10:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:10:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 23:10:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1082 transitions. [2023-11-06 23:10:42,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41615384615384615 [2023-11-06 23:10:42,747 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1082 transitions. [2023-11-06 23:10:42,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1082 transitions. [2023-11-06 23:10:42,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:42,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1082 transitions. [2023-11-06 23:10:42,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.2) internal successors, (1082), 10 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:42,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 260.0) internal successors, (2860), 11 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:42,757 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 260.0) internal successors, (2860), 11 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:42,758 INFO L175 Difference]: Start difference. First operand has 94 places, 70 transitions, 839 flow. Second operand 10 states and 1082 transitions. [2023-11-06 23:10:42,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 123 transitions, 1444 flow [2023-11-06 23:10:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 123 transitions, 1243 flow, removed 38 selfloop flow, removed 11 redundant places. [2023-11-06 23:10:42,782 INFO L231 Difference]: Finished difference. Result has 96 places, 55 transitions, 528 flow [2023-11-06 23:10:42,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=528, PETRI_PLACES=96, PETRI_TRANSITIONS=55} [2023-11-06 23:10:42,784 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2023-11-06 23:10:42,784 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 55 transitions, 528 flow [2023-11-06 23:10:42,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:42,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:42,785 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 23:10:42,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:10:42,785 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:42,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1912010594, now seen corresponding path program 10 times [2023-11-06 23:10:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503625174] [2023-11-06 23:10:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503625174] [2023-11-06 23:10:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503625174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:43,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937961358] [2023-11-06 23:10:43,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:43,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:44,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 260 [2023-11-06 23:10:44,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 55 transitions, 528 flow. Second operand has 9 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:44,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:44,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 260 [2023-11-06 23:10:44,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:44,790 INFO L124 PetriNetUnfolderBase]: 188/391 cut-off events. [2023-11-06 23:10:44,791 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2023-11-06 23:10:44,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 391 events. 188/391 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1682 event pairs, 34 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1879. Up to 152 conditions per place. [2023-11-06 23:10:44,795 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 51 selfloop transitions, 14 changer transitions 34/100 dead transitions. [2023-11-06 23:10:44,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 100 transitions, 1000 flow [2023-11-06 23:10:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:10:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:10:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 963 transitions. [2023-11-06 23:10:44,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115384615384615 [2023-11-06 23:10:44,800 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 963 transitions. [2023-11-06 23:10:44,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 963 transitions. [2023-11-06 23:10:44,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:44,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 963 transitions. [2023-11-06 23:10:44,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:44,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:44,809 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:44,809 INFO L175 Difference]: Start difference. First operand has 96 places, 55 transitions, 528 flow. Second operand 9 states and 963 transitions. [2023-11-06 23:10:44,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 100 transitions, 1000 flow [2023-11-06 23:10:44,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 902 flow, removed 27 selfloop flow, removed 18 redundant places. [2023-11-06 23:10:44,823 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 414 flow [2023-11-06 23:10:44,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=414, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-11-06 23:10:44,826 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-11-06 23:10:44,827 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 414 flow [2023-11-06 23:10:44,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:44,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:44,828 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 23:10:44,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 23:10:44,828 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:44,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1794871586, now seen corresponding path program 11 times [2023-11-06 23:10:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227261875] [2023-11-06 23:10:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227261875] [2023-11-06 23:10:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227261875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471033819] [2023-11-06 23:10:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:47,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:47,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:47,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:47,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260 [2023-11-06 23:10:47,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:47,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:47,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260 [2023-11-06 23:10:47,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:48,330 INFO L124 PetriNetUnfolderBase]: 193/416 cut-off events. [2023-11-06 23:10:48,330 INFO L125 PetriNetUnfolderBase]: For 1388/1388 co-relation queries the response was YES. [2023-11-06 23:10:48,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 416 events. 193/416 cut-off events. For 1388/1388 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1908 event pairs, 52 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 1874. Up to 161 conditions per place. [2023-11-06 23:10:48,334 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 59 selfloop transitions, 9 changer transitions 26/95 dead transitions. [2023-11-06 23:10:48,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 922 flow [2023-11-06 23:10:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-11-06 23:10:48,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197802197802198 [2023-11-06 23:10:48,338 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-11-06 23:10:48,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-11-06 23:10:48,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:48,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-11-06 23:10:48,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:48,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:48,345 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:48,345 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 414 flow. Second operand 7 states and 764 transitions. [2023-11-06 23:10:48,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 922 flow [2023-11-06 23:10:48,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 885 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-11-06 23:10:48,355 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 440 flow [2023-11-06 23:10:48,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-11-06 23:10:48,357 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-11-06 23:10:48,357 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 440 flow [2023-11-06 23:10:48,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:48,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:48,358 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 23:10:48,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 23:10:48,358 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:10:48,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash 289618674, now seen corresponding path program 12 times [2023-11-06 23:10:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989517950] [2023-11-06 23:10:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:48,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:10:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:48,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:10:48,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:10:48,650 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 23:10:48,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 23:10:48,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 23:10:48,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 23:10:48,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 23:10:48,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 23:10:48,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 23:10:48,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 23:10:48,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 23:10:48,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 23:10:48,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 23:10:48,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 23:10:48,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 23:10:48,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 23:10:48,657 INFO L445 BasicCegarLoop]: Path program histogram: [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:48,664 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:10:48,664 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:10:48,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:10:48 BasicIcfg [2023-11-06 23:10:48,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:10:48,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:10:48,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:10:48,789 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:10:48,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:44" (3/4) ... [2023-11-06 23:10:48,792 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:10:48,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:10:48,794 INFO L158 Benchmark]: Toolchain (without parser) took 66576.29ms. Allocated memory was 144.7MB in the beginning and 843.1MB in the end (delta: 698.4MB). Free memory was 104.2MB in the beginning and 718.3MB in the end (delta: -614.2MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,795 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 144.7MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:48,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 992.68ms. Allocated memory is still 144.7MB. Free memory was 103.9MB in the beginning and 77.8MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.78ms. Allocated memory is still 144.7MB. Free memory was 77.8MB in the beginning and 74.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,796 INFO L158 Benchmark]: Boogie Preprocessor took 55.10ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 72.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,796 INFO L158 Benchmark]: RCFGBuilder took 1501.67ms. Allocated memory was 144.7MB in the beginning and 201.3MB in the end (delta: 56.6MB). Free memory was 72.4MB in the beginning and 118.5MB in the end (delta: -46.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,797 INFO L158 Benchmark]: TraceAbstraction took 63919.14ms. Allocated memory was 201.3MB in the beginning and 843.1MB in the end (delta: 641.7MB). Free memory was 118.5MB in the beginning and 718.3MB in the end (delta: -599.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2023-11-06 23:10:48,797 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 843.1MB. Free memory is still 718.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:48,799 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.37ms. Allocated memory is still 144.7MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 992.68ms. Allocated memory is still 144.7MB. Free memory was 103.9MB in the beginning and 77.8MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.78ms. Allocated memory is still 144.7MB. Free memory was 77.8MB in the beginning and 74.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.10ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 72.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1501.67ms. Allocated memory was 144.7MB in the beginning and 201.3MB in the end (delta: 56.6MB). Free memory was 72.4MB in the beginning and 118.5MB in the end (delta: -46.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 63919.14ms. Allocated memory was 201.3MB in the beginning and 843.1MB in the end (delta: 641.7MB). Free memory was 118.5MB in the beginning and 718.3MB in the end (delta: -599.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 843.1MB. Free memory is still 718.3MB. 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: 9.7s, 131 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2670 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 133 TotalNumberOfCompositions, 7401 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2979, independent: 2774, independent conditional: 0, independent unconditional: 2774, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1466, independent: 1417, independent conditional: 0, independent unconditional: 1417, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2979, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1466, unknown conditional: 0, unknown unconditional: 1466] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 857]: 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, 154 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: 63.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1706 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1384 mSDsluCounter, 1337 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1104 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5217 IncrementalHoareTripleChecker+Invalid, 5850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 233 mSDtfsCounter, 5217 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=885occurred in iteration=15, InterpolantAutomatonStates: 151, 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, 1.2s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 6583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:10:48,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:52,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:52,095 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:10:52,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:52,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:52,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:52,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:52,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:52,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:52,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:52,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:52,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:52,154 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:52,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:52,156 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:10:52,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:10:52,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:10:52,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:52,158 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:10:52,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:10:52,160 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:10:52,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:52,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:10:52,162 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:10:52,162 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:10:52,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:10:52,163 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:10:52,164 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:52,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:52,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:52,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:52,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:52,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:52,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:52,168 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:10:52,168 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:10:52,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:52,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:52,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:52,169 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:10:52,170 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:52,170 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_24071b86-0f3e-4f52-af41-857946d8e467/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_24071b86-0f3e-4f52-af41-857946d8e467/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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2023-11-06 23:10:52,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:52,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:52,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:52,729 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:52,729 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:52,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 23:10:56,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:57,021 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:57,022 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 23:10:57,044 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data/ad59afc09/d36daa4813b3437bb23984b0f8232310/FLAGdd6f40f89 [2023-11-06 23:10:57,068 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/data/ad59afc09/d36daa4813b3437bb23984b0f8232310 [2023-11-06 23:10:57,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:57,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:57,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:57,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:57,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:57,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5097376b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:57, skipping insertion in model container [2023-11-06 23:10:57,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:57" (1/1) ... [2023-11-06 23:10:57,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:57,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:58,010 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:58,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:58,217 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:10:58,217 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:10:58,226 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:58,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58 WrapperNode [2023-11-06 23:10:58,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:58,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:58,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:58,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:58,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,356 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-06 23:10:58,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:58,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:58,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:58,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:58,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:58,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:58,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:58,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:58,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (1/1) ... [2023-11-06 23:10:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:58,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:58,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:58,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:10:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:10:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:10:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:10:58,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:10:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:10:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:10:58,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:10:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:10:58,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:10:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:10:58,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:10:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:10:58,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:58,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:58,587 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:10:58,800 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:58,802 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:59,354 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:59,740 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:59,741 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:10:59,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:59 BoogieIcfgContainer [2023-11-06 23:10:59,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:59,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:59,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:59,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:59,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:57" (1/3) ... [2023-11-06 23:10:59,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262313ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:59, skipping insertion in model container [2023-11-06 23:10:59,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:58" (2/3) ... [2023-11-06 23:10:59,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262313ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:59, skipping insertion in model container [2023-11-06 23:10:59,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:59" (3/3) ... [2023-11-06 23:10:59,762 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-06 23:10:59,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:59,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 23:10:59,787 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:10:59,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:10:59,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 128 transitions, 268 flow [2023-11-06 23:11:00,058 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2023-11-06 23:11:00,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:00,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 3/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:11:00,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 128 transitions, 268 flow [2023-11-06 23:11:00,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 125 transitions, 259 flow [2023-11-06 23:11:00,082 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:11:00,094 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 125 transitions, 259 flow [2023-11-06 23:11:00,097 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 125 transitions, 259 flow [2023-11-06 23:11:00,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 259 flow [2023-11-06 23:11:00,136 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2023-11-06 23:11:00,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:00,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 3/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-06 23:11:00,141 INFO L119 LiptonReduction]: Number of co-enabled transitions 2670 [2023-11-06 23:11:11,453 INFO L134 LiptonReduction]: Checked pairs total: 7336 [2023-11-06 23:11:11,453 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-11-06 23:11:11,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:11:11,507 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;@4311f49e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:11:11,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 23:11:11,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:11:11,510 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:11:11,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:11,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:11,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:11:11,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:11,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash 657, now seen corresponding path program 1 times [2023-11-06 23:11:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:11,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961498069] [2023-11-06 23:11:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:11,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:11,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 23:11:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:11,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:11:11,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:11,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:11,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961498069] [2023-11-06 23:11:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961498069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:11,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:11:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530636220] [2023-11-06 23:11:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:11:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:11:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:11:11,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-11-06 23:11:11,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:11,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:11,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-11-06 23:11:11,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:13,118 INFO L124 PetriNetUnfolderBase]: 2514/3645 cut-off events. [2023-11-06 23:11:13,118 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-06 23:11:13,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7361 conditions, 3645 events. 2514/3645 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16911 event pairs, 2514 based on Foata normal form. 0/3117 useless extension candidates. Maximal degree in co-relation 7350. Up to 3638 conditions per place. [2023-11-06 23:11:13,169 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 25 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-06 23:11:13,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 111 flow [2023-11-06 23:11:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:11:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:11:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2023-11-06 23:11:13,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49034749034749037 [2023-11-06 23:11:13,196 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 254 transitions. [2023-11-06 23:11:13,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 254 transitions. [2023-11-06 23:11:13,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:13,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 254 transitions. [2023-11-06 23:11:13,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:13,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:13,220 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:13,222 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 254 transitions. [2023-11-06 23:11:13,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 111 flow [2023-11-06 23:11:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:11:13,232 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-06 23:11:13,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, 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 23:11:13,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-06 23:11:13,240 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-06 23:11:13,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:13,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:13,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:11:13,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 23:11:13,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:13,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:13,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash 621048689, now seen corresponding path program 1 times [2023-11-06 23:11:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605241746] [2023-11-06 23:11:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:13,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:13,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:13,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:13,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 23:11:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:13,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:11:13,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:13,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:13,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605241746] [2023-11-06 23:11:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605241746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:13,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:11:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156632781] [2023-11-06 23:11:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:13,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:11:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:13,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:11:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:11:13,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 259 [2023-11-06 23:11:13,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:13,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:13,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 259 [2023-11-06 23:11:13,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:14,443 INFO L124 PetriNetUnfolderBase]: 1969/3092 cut-off events. [2023-11-06 23:11:14,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:11:14,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 3092 events. 1969/3092 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16328 event pairs, 334 based on Foata normal form. 0/2852 useless extension candidates. Maximal degree in co-relation 6024. Up to 2302 conditions per place. [2023-11-06 23:11:14,470 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 37 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-06 23:11:14,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 174 flow [2023-11-06 23:11:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:11:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:11:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-06 23:11:14,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47876447876447875 [2023-11-06 23:11:14,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-06 23:11:14,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-06 23:11:14,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:14,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-06 23:11:14,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:14,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:14,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:14,485 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 372 transitions. [2023-11-06 23:11:14,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 174 flow [2023-11-06 23:11:14,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:11:14,488 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-11-06 23:11:14,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, 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 23:11:14,490 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 23:11:14,490 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-11-06 23:11:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:14,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:14,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:14,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:14,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:14,711 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:14,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash -652529018, now seen corresponding path program 1 times [2023-11-06 23:11:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:14,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244716112] [2023-11-06 23:11:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:14,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:14,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 23:11:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:14,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:11:14,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:14,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:14,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244716112] [2023-11-06 23:11:14,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244716112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:14,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:11:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443350835] [2023-11-06 23:11:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:14,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:11:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:14,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:11:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:11:14,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-11-06 23:11:14,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:14,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:14,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-11-06 23:11:14,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:15,415 INFO L124 PetriNetUnfolderBase]: 783/1268 cut-off events. [2023-11-06 23:11:15,416 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-06 23:11:15,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1268 events. 783/1268 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5602 event pairs, 197 based on Foata normal form. 60/1263 useless extension candidates. Maximal degree in co-relation 2687. Up to 1038 conditions per place. [2023-11-06 23:11:15,428 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 35 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-11-06 23:11:15,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 174 flow [2023-11-06 23:11:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:11:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:11:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-06 23:11:15,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646074646074646 [2023-11-06 23:11:15,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-06 23:11:15,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-06 23:11:15,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:15,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-06 23:11:15,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:15,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:15,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:15,446 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 3 states and 361 transitions. [2023-11-06 23:11:15,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 174 flow [2023-11-06 23:11:15,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:15,451 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 80 flow [2023-11-06 23:11:15,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, 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=3, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-11-06 23:11:15,453 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-11-06 23:11:15,454 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 80 flow [2023-11-06 23:11:15,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:15,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:15,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:15,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:15,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:15,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:15,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1437443327, now seen corresponding path program 1 times [2023-11-06 23:11:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:15,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830535345] [2023-11-06 23:11:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:15,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:15,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 23:11:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:15,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:11:15,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:15,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 23:11:15,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:15,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830535345] [2023-11-06 23:11:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830535345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971215724] [2023-11-06 23:11:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:15,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:11:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:11:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:11:15,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-11-06 23:11:15,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:15,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:15,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-11-06 23:11:15,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:16,275 INFO L124 PetriNetUnfolderBase]: 313/567 cut-off events. [2023-11-06 23:11:16,275 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-06 23:11:16,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 567 events. 313/567 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2224 event pairs, 131 based on Foata normal form. 47/595 useless extension candidates. Maximal degree in co-relation 1378. Up to 227 conditions per place. [2023-11-06 23:11:16,282 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 46 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2023-11-06 23:11:16,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 252 flow [2023-11-06 23:11:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:11:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:11:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-11-06 23:11:16,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46525096525096526 [2023-11-06 23:11:16,286 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-11-06 23:11:16,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-11-06 23:11:16,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:16,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-11-06 23:11:16,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:16,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:16,296 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:16,296 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 80 flow. Second operand 4 states and 482 transitions. [2023-11-06 23:11:16,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 252 flow [2023-11-06 23:11:16,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:11:16,300 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 116 flow [2023-11-06 23:11:16,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=4, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-06 23:11:16,301 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2023-11-06 23:11:16,302 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 116 flow [2023-11-06 23:11:16,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:16,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:16,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:16,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 23:11:16,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:16,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:16,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 987716977, now seen corresponding path program 1 times [2023-11-06 23:11:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:16,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008296328] [2023-11-06 23:11:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:16,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:16,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:16,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 23:11:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:16,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:11:16,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:16,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:16,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:16,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008296328] [2023-11-06 23:11:16,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008296328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:16,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:16,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:11:16,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556187399] [2023-11-06 23:11:16,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:16,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:11:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:11:16,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:11:16,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-11-06 23:11:16,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:16,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:16,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-11-06 23:11:16,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:17,232 INFO L124 PetriNetUnfolderBase]: 253/447 cut-off events. [2023-11-06 23:11:17,234 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2023-11-06 23:11:17,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 447 events. 253/447 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1733 event pairs, 126 based on Foata normal form. 12/452 useless extension candidates. Maximal degree in co-relation 1172. Up to 227 conditions per place. [2023-11-06 23:11:17,238 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 43 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2023-11-06 23:11:17,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 276 flow [2023-11-06 23:11:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:11:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:11:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-11-06 23:11:17,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548262548262548 [2023-11-06 23:11:17,242 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-11-06 23:11:17,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-11-06 23:11:17,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:17,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-11-06 23:11:17,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:17,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:17,251 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:17,251 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 116 flow. Second operand 5 states and 589 transitions. [2023-11-06 23:11:17,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 276 flow [2023-11-06 23:11:17,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 262 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:17,259 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 130 flow [2023-11-06 23:11:17,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=5, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-06 23:11:17,262 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-11-06 23:11:17,262 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 130 flow [2023-11-06 23:11:17,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:17,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:17,264 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, 1] [2023-11-06 23:11:17,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:17,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:17,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:17,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash -649046647, now seen corresponding path program 1 times [2023-11-06 23:11:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874215853] [2023-11-06 23:11:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:17,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:17,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 23:11:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:17,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 23:11:17,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:18,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:18,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874215853] [2023-11-06 23:11:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874215853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:18,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197071438] [2023-11-06 23:11:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:18,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259 [2023-11-06 23:11:18,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:18,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:18,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259 [2023-11-06 23:11:18,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:19,439 INFO L124 PetriNetUnfolderBase]: 444/849 cut-off events. [2023-11-06 23:11:19,439 INFO L125 PetriNetUnfolderBase]: For 867/867 co-relation queries the response was YES. [2023-11-06 23:11:19,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 849 events. 444/849 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4191 event pairs, 46 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 2389. Up to 265 conditions per place. [2023-11-06 23:11:19,451 INFO L140 encePairwiseOnDemand]: 248/259 looper letters, 100 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2023-11-06 23:11:19,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 114 transitions, 754 flow [2023-11-06 23:11:19,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:11:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:11:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1014 transitions. [2023-11-06 23:11:19,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.435006435006435 [2023-11-06 23:11:19,458 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1014 transitions. [2023-11-06 23:11:19,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1014 transitions. [2023-11-06 23:11:19,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:19,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1014 transitions. [2023-11-06 23:11:19,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:19,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:19,471 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:19,472 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 130 flow. Second operand 9 states and 1014 transitions. [2023-11-06 23:11:19,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 114 transitions, 754 flow [2023-11-06 23:11:19,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 114 transitions, 644 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-11-06 23:11:19,489 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 197 flow [2023-11-06 23:11:19,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-06 23:11:19,492 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-11-06 23:11:19,493 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 197 flow [2023-11-06 23:11:19,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:19,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:19,495 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, 1] [2023-11-06 23:11:19,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:19,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:19,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:19,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1559075421, now seen corresponding path program 2 times [2023-11-06 23:11:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825686346] [2023-11-06 23:11:19,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:11:19,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:19,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:19,716 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:19,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 23:11:19,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:11:19,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:19,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:11:19,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:20,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:20,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:20,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825686346] [2023-11-06 23:11:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825686346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:20,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:20,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475971650] [2023-11-06 23:11:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:20,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:11:20,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:11:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:11:20,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 259 [2023-11-06 23:11:20,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:20,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:20,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 259 [2023-11-06 23:11:20,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:20,545 INFO L124 PetriNetUnfolderBase]: 781/1424 cut-off events. [2023-11-06 23:11:20,545 INFO L125 PetriNetUnfolderBase]: For 1432/1432 co-relation queries the response was YES. [2023-11-06 23:11:20,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4676 conditions, 1424 events. 781/1424 cut-off events. For 1432/1432 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7479 event pairs, 194 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 4663. Up to 702 conditions per place. [2023-11-06 23:11:20,563 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 79 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2023-11-06 23:11:20,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 604 flow [2023-11-06 23:11:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:11:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:11:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-11-06 23:11:20,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444015444015444 [2023-11-06 23:11:20,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-11-06 23:11:20,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-11-06 23:11:20,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:20,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-11-06 23:11:20,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:20,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:20,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:20,575 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 197 flow. Second operand 5 states and 575 transitions. [2023-11-06 23:11:20,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 604 flow [2023-11-06 23:11:20,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:20,593 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 276 flow [2023-11-06 23:11:20,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-06 23:11:20,594 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-06 23:11:20,594 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 276 flow [2023-11-06 23:11:20,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:20,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:20,595 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, 1] [2023-11-06 23:11:20,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:20,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:20,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:20,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash 857680482, now seen corresponding path program 1 times [2023-11-06 23:11:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397007356] [2023-11-06 23:11:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:20,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:20,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 23:11:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:21,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 23:11:21,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:21,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:21,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:21,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397007356] [2023-11-06 23:11:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397007356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:11:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069795966] [2023-11-06 23:11:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:21,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:11:21,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:21,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:11:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:11:21,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 259 [2023-11-06 23:11:21,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 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 23:11:21,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:21,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 259 [2023-11-06 23:11:21,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:22,397 INFO L124 PetriNetUnfolderBase]: 675/1256 cut-off events. [2023-11-06 23:11:22,397 INFO L125 PetriNetUnfolderBase]: For 1454/1454 co-relation queries the response was YES. [2023-11-06 23:11:22,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4217 conditions, 1256 events. 675/1256 cut-off events. For 1454/1454 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6760 event pairs, 182 based on Foata normal form. 6/1262 useless extension candidates. Maximal degree in co-relation 4202. Up to 1158 conditions per place. [2023-11-06 23:11:22,411 INFO L140 encePairwiseOnDemand]: 255/259 looper letters, 50 selfloop transitions, 3 changer transitions 8/62 dead transitions. [2023-11-06 23:11:22,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 440 flow [2023-11-06 23:11:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:11:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:11:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-11-06 23:11:22,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3907335907335907 [2023-11-06 23:11:22,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-11-06 23:11:22,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-11-06 23:11:22,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:22,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-11-06 23:11:22,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:22,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:22,425 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:22,425 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 276 flow. Second operand 5 states and 506 transitions. [2023-11-06 23:11:22,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 440 flow [2023-11-06 23:11:22,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:11:22,441 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 162 flow [2023-11-06 23:11:22,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-11-06 23:11:22,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-06 23:11:22,442 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 162 flow [2023-11-06 23:11:22,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 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 23:11:22,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:22,443 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, 1] [2023-11-06 23:11:22,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 23:11:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:22,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:22,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2113074787, now seen corresponding path program 3 times [2023-11-06 23:11:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:22,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280888226] [2023-11-06 23:11:22,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:11:22,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:22,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:22,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:22,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 23:11:22,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:11:22,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:22,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 23:11:22,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:23,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:23,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280888226] [2023-11-06 23:11:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280888226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:11:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642479958] [2023-11-06 23:11:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:23,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:23,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:23,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:23,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 259 [2023-11-06 23:11:23,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:23,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:23,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 259 [2023-11-06 23:11:23,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:23,959 INFO L124 PetriNetUnfolderBase]: 365/696 cut-off events. [2023-11-06 23:11:23,960 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2023-11-06 23:11:23,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2349 conditions, 696 events. 365/696 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3090 event pairs, 83 based on Foata normal form. 2/698 useless extension candidates. Maximal degree in co-relation 2334. Up to 494 conditions per place. [2023-11-06 23:11:23,967 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 46 selfloop transitions, 7 changer transitions 26/80 dead transitions. [2023-11-06 23:11:23,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 536 flow [2023-11-06 23:11:23,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:11:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:11:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 996 transitions. [2023-11-06 23:11:23,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4272844272844273 [2023-11-06 23:11:23,973 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 996 transitions. [2023-11-06 23:11:23,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 996 transitions. [2023-11-06 23:11:23,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:23,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 996 transitions. [2023-11-06 23:11:23,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.66666666666667) internal successors, (996), 9 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:23,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:23,984 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:23,984 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 162 flow. Second operand 9 states and 996 transitions. [2023-11-06 23:11:23,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 536 flow [2023-11-06 23:11:23,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 498 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-11-06 23:11:23,991 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 201 flow [2023-11-06 23:11:23,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-11-06 23:11:23,992 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-06 23:11:23,992 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 201 flow [2023-11-06 23:11:23,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:23,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:23,993 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, 1] [2023-11-06 23:11:24,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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)] Ended with exit code 0 [2023-11-06 23:11:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:24,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:24,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1624339487, now seen corresponding path program 4 times [2023-11-06 23:11:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455825285] [2023-11-06 23:11:24,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:11:24,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 23:11:24,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:24,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:24,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (11)] Waiting until timeout for monitored process [2023-11-06 23:11:24,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:11:24,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:24,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 23:11:24,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:24,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:24,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:24,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455825285] [2023-11-06 23:11:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455825285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:24,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812796812] [2023-11-06 23:11:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:24,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259 [2023-11-06 23:11:24,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 201 flow. Second operand has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:24,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:24,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259 [2023-11-06 23:11:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:25,590 INFO L124 PetriNetUnfolderBase]: 451/863 cut-off events. [2023-11-06 23:11:25,590 INFO L125 PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES. [2023-11-06 23:11:25,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 863 events. 451/863 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4359 event pairs, 20 based on Foata normal form. 1/864 useless extension candidates. Maximal degree in co-relation 3065. Up to 380 conditions per place. [2023-11-06 23:11:25,600 INFO L140 encePairwiseOnDemand]: 248/259 looper letters, 54 selfloop transitions, 12 changer transitions 44/111 dead transitions. [2023-11-06 23:11:25,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 770 flow [2023-11-06 23:11:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:11:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 23:11:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1113 transitions. [2023-11-06 23:11:25,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297297297297297 [2023-11-06 23:11:25,607 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1113 transitions. [2023-11-06 23:11:25,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1113 transitions. [2023-11-06 23:11:25,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:25,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1113 transitions. [2023-11-06 23:11:25,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 111.3) internal successors, (1113), 10 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:25,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 259.0) internal successors, (2849), 11 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:25,620 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 259.0) internal successors, (2849), 11 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:25,620 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 201 flow. Second operand 10 states and 1113 transitions. [2023-11-06 23:11:25,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 770 flow [2023-11-06 23:11:25,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 752 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-06 23:11:25,632 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 240 flow [2023-11-06 23:11:25,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=240, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-11-06 23:11:25,634 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-11-06 23:11:25,634 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 240 flow [2023-11-06 23:11:25,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:25,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:25,635 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, 1] [2023-11-06 23:11:25,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:25,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:25,857 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:25,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1681402257, now seen corresponding path program 5 times [2023-11-06 23:11:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883629100] [2023-11-06 23:11:25,858 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 23:11:25,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:25,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:25,860 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:25,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (12)] Waiting until timeout for monitored process [2023-11-06 23:11:26,034 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:11:26,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:26,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 23:11:26,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:26,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:26,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883629100] [2023-11-06 23:11:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883629100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:26,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465684104] [2023-11-06 23:11:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:26,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:26,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 259 [2023-11-06 23:11:26,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:26,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:26,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 259 [2023-11-06 23:11:26,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:27,166 INFO L124 PetriNetUnfolderBase]: 445/836 cut-off events. [2023-11-06 23:11:27,167 INFO L125 PetriNetUnfolderBase]: For 1950/1956 co-relation queries the response was YES. [2023-11-06 23:11:27,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3468 conditions, 836 events. 445/836 cut-off events. For 1950/1956 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3981 event pairs, 171 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 3451. Up to 595 conditions per place. [2023-11-06 23:11:27,177 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 44 selfloop transitions, 6 changer transitions 28/79 dead transitions. [2023-11-06 23:11:27,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 622 flow [2023-11-06 23:11:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:11:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:11:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 895 transitions. [2023-11-06 23:11:27,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43194980694980695 [2023-11-06 23:11:27,183 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 895 transitions. [2023-11-06 23:11:27,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 895 transitions. [2023-11-06 23:11:27,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:27,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 895 transitions. [2023-11-06 23:11:27,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.875) internal successors, (895), 8 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:27,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:27,194 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:27,194 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 240 flow. Second operand 8 states and 895 transitions. [2023-11-06 23:11:27,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 622 flow [2023-11-06 23:11:27,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 579 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-06 23:11:27,204 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 251 flow [2023-11-06 23:11:27,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2023-11-06 23:11:27,205 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-11-06 23:11:27,205 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 251 flow [2023-11-06 23:11:27,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:27,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:27,206 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, 1] [2023-11-06 23:11:27,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:27,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:27,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:27,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash -624993315, now seen corresponding path program 6 times [2023-11-06 23:11:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:27,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87493560] [2023-11-06 23:11:27,422 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 23:11:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:27,423 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:27,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (13)] Waiting until timeout for monitored process [2023-11-06 23:11:27,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-06 23:11:27,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:27,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 23:11:27,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:28,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:28,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87493560] [2023-11-06 23:11:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87493560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:28,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:11:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117153312] [2023-11-06 23:11:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:28,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:28,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:28,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 259 [2023-11-06 23:11:28,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 251 flow. Second operand has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:28,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:28,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 259 [2023-11-06 23:11:28,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:29,089 INFO L124 PetriNetUnfolderBase]: 356/685 cut-off events. [2023-11-06 23:11:29,089 INFO L125 PetriNetUnfolderBase]: For 1319/1325 co-relation queries the response was YES. [2023-11-06 23:11:29,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 685 events. 356/685 cut-off events. For 1319/1325 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3212 event pairs, 76 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 2747. Up to 343 conditions per place. [2023-11-06 23:11:29,101 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 60 selfloop transitions, 8 changer transitions 15/84 dead transitions. [2023-11-06 23:11:29,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 643 flow [2023-11-06 23:11:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:11:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:11:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-11-06 23:11:29,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42084942084942084 [2023-11-06 23:11:29,108 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-11-06 23:11:29,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-11-06 23:11:29,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:29,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-11-06 23:11:29,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:29,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:29,117 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:29,117 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 251 flow. Second operand 8 states and 872 transitions. [2023-11-06 23:11:29,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 643 flow [2023-11-06 23:11:29,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 624 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-06 23:11:29,126 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 267 flow [2023-11-06 23:11:29,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=267, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-11-06 23:11:29,127 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-11-06 23:11:29,127 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 267 flow [2023-11-06 23:11:29,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:29,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:29,128 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, 1] [2023-11-06 23:11:29,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (13)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:29,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:29,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:29,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash -939756405, now seen corresponding path program 7 times [2023-11-06 23:11:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:29,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652145694] [2023-11-06 23:11:29,342 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 23:11:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:29,344 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:29,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (14)] Waiting until timeout for monitored process [2023-11-06 23:11:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:29,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 23:11:29,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:30,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:30,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652145694] [2023-11-06 23:11:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652145694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:11:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107042041] [2023-11-06 23:11:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:30,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:30,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 259 [2023-11-06 23:11:30,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 267 flow. Second operand has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:30,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:30,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 259 [2023-11-06 23:11:30,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:30,855 INFO L124 PetriNetUnfolderBase]: 407/773 cut-off events. [2023-11-06 23:11:30,855 INFO L125 PetriNetUnfolderBase]: For 2213/2219 co-relation queries the response was YES. [2023-11-06 23:11:30,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 773 events. 407/773 cut-off events. For 2213/2219 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3647 event pairs, 164 based on Foata normal form. 1/770 useless extension candidates. Maximal degree in co-relation 3241. Up to 619 conditions per place. [2023-11-06 23:11:30,865 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 54 selfloop transitions, 8 changer transitions 28/91 dead transitions. [2023-11-06 23:11:30,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 732 flow [2023-11-06 23:11:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:11:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:11:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 990 transitions. [2023-11-06 23:11:30,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247104247104247 [2023-11-06 23:11:30,871 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 990 transitions. [2023-11-06 23:11:30,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 990 transitions. [2023-11-06 23:11:30,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:30,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 990 transitions. [2023-11-06 23:11:30,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:30,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:30,883 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:30,883 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 267 flow. Second operand 9 states and 990 transitions. [2023-11-06 23:11:30,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 732 flow [2023-11-06 23:11:30,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 685 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-06 23:11:30,895 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 306 flow [2023-11-06 23:11:30,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2023-11-06 23:11:30,896 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-11-06 23:11:30,896 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 306 flow [2023-11-06 23:11:30,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.44444444444444) internal successors, (949), 9 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:30,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:30,898 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, 1] [2023-11-06 23:11:30,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (14)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:31,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:31,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:31,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1869017451, now seen corresponding path program 8 times [2023-11-06 23:11:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584329381] [2023-11-06 23:11:31,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:11:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:31,116 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:31,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (15)] Waiting until timeout for monitored process [2023-11-06 23:11:31,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:11:31,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:31,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 23:11:31,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:31,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:31,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584329381] [2023-11-06 23:11:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584329381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:31,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:31,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300252558] [2023-11-06 23:11:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:31,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:31,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:31,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 259 [2023-11-06 23:11:31,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 45 transitions, 306 flow. Second operand has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 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 23:11:31,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:31,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 259 [2023-11-06 23:11:31,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:32,404 INFO L124 PetriNetUnfolderBase]: 402/771 cut-off events. [2023-11-06 23:11:32,405 INFO L125 PetriNetUnfolderBase]: For 1908/1914 co-relation queries the response was YES. [2023-11-06 23:11:32,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 771 events. 402/771 cut-off events. For 1908/1914 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3653 event pairs, 186 based on Foata normal form. 1/768 useless extension candidates. Maximal degree in co-relation 3264. Up to 613 conditions per place. [2023-11-06 23:11:32,413 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 37 selfloop transitions, 2 changer transitions 45/85 dead transitions. [2023-11-06 23:11:32,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 712 flow [2023-11-06 23:11:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:11:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:11:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 888 transitions. [2023-11-06 23:11:32,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-06 23:11:32,420 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 888 transitions. [2023-11-06 23:11:32,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 888 transitions. [2023-11-06 23:11:32,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:32,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 888 transitions. [2023-11-06 23:11:32,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:32,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:32,431 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:32,431 INFO L175 Difference]: Start difference. First operand has 69 places, 45 transitions, 306 flow. Second operand 8 states and 888 transitions. [2023-11-06 23:11:32,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 712 flow [2023-11-06 23:11:32,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 694 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-06 23:11:32,443 INFO L231 Difference]: Finished difference. Result has 72 places, 38 transitions, 234 flow [2023-11-06 23:11:32,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=72, PETRI_TRANSITIONS=38} [2023-11-06 23:11:32,444 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-11-06 23:11:32,445 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 38 transitions, 234 flow [2023-11-06 23:11:32,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 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 23:11:32,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:32,446 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, 1] [2023-11-06 23:11:32,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (15)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:32,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:32,665 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:32,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:32,666 INFO L85 PathProgramCache]: Analyzing trace with hash -604601703, now seen corresponding path program 9 times [2023-11-06 23:11:32,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:32,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495751748] [2023-11-06 23:11:32,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:11:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:32,668 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:32,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (16)] Waiting until timeout for monitored process [2023-11-06 23:11:32,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:11:32,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:32,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 23:11:32,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:33,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:11:33,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495751748] [2023-11-06 23:11:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495751748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:33,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:11:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695190621] [2023-11-06 23:11:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:33,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:33,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:33,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 259 [2023-11-06 23:11:33,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 38 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 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 23:11:33,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:11:33,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 259 [2023-11-06 23:11:33,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:11:34,050 INFO L124 PetriNetUnfolderBase]: 358/691 cut-off events. [2023-11-06 23:11:34,050 INFO L125 PetriNetUnfolderBase]: For 1497/1503 co-relation queries the response was YES. [2023-11-06 23:11:34,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 691 events. 358/691 cut-off events. For 1497/1503 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3337 event pairs, 88 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 2862. Up to 359 conditions per place. [2023-11-06 23:11:34,058 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 54 selfloop transitions, 10 changer transitions 34/99 dead transitions. [2023-11-06 23:11:34,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 784 flow [2023-11-06 23:11:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:11:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:11:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 999 transitions. [2023-11-06 23:11:34,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-06 23:11:34,065 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 999 transitions. [2023-11-06 23:11:34,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 999 transitions. [2023-11-06 23:11:34,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:11:34,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 999 transitions. [2023-11-06 23:11:34,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.0) internal successors, (999), 9 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:34,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:34,077 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:34,077 INFO L175 Difference]: Start difference. First operand has 72 places, 38 transitions, 234 flow. Second operand 9 states and 999 transitions. [2023-11-06 23:11:34,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 784 flow [2023-11-06 23:11:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 738 flow, removed 19 selfloop flow, removed 11 redundant places. [2023-11-06 23:11:34,088 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 275 flow [2023-11-06 23:11:34,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2023-11-06 23:11:34,089 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-11-06 23:11:34,090 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 275 flow [2023-11-06 23:11:34,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 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 23:11:34,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:11:34,091 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, 1] [2023-11-06 23:11:34,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (16)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:34,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:34,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 23:11:34,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash -371721133, now seen corresponding path program 10 times [2023-11-06 23:11:34,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:34,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117953445] [2023-11-06 23:11:34,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:11:34,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:34,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:34,308 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 23:11:34,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (17)] Waiting until timeout for monitored process [2023-11-06 23:11:34,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:11:34,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:11:34,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:11:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:11:34,683 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:11:34,683 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:11:34,685 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 23:11:34,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 23:11:34,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 23:11:34,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 23:11:34,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 23:11:34,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 23:11:34,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 23:11:34,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 23:11:34,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 23:11:34,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 23:11:34,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 23:11:34,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 23:11:34,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 23:11:34,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/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 (17)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:11:34,902 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:34,909 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:11:34,910 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:11:35,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:11:35 BasicIcfg [2023-11-06 23:11:35,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:11:35,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:11:35,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:11:35,001 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:11:35,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:59" (3/4) ... [2023-11-06 23:11:35,004 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:11:35,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:11:35,006 INFO L158 Benchmark]: Toolchain (without parser) took 37916.11ms. Allocated memory was 75.5MB in the beginning and 427.8MB in the end (delta: 352.3MB). Free memory was 48.4MB in the beginning and 240.1MB in the end (delta: -191.7MB). Peak memory consumption was 161.5MB. Max. memory is 16.1GB. [2023-11-06 23:11:35,006 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:35,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1135.61ms. Allocated memory is still 75.5MB. Free memory was 48.1MB in the beginning and 39.5MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:11:35,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.42ms. Allocated memory is still 75.5MB. Free memory was 39.5MB in the beginning and 36.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:11:35,008 INFO L158 Benchmark]: Boogie Preprocessor took 96.06ms. Allocated memory is still 75.5MB. Free memory was 36.8MB in the beginning and 34.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:11:35,008 INFO L158 Benchmark]: RCFGBuilder took 1289.57ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 55.0MB in the end (delta: -20.8MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2023-11-06 23:11:35,009 INFO L158 Benchmark]: TraceAbstraction took 35247.96ms. Allocated memory was 92.3MB in the beginning and 427.8MB in the end (delta: 335.5MB). Free memory was 54.4MB in the beginning and 240.1MB in the end (delta: -185.7MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2023-11-06 23:11:35,009 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 427.8MB. Free memory is still 240.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:35,011 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.43ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1135.61ms. Allocated memory is still 75.5MB. Free memory was 48.1MB in the beginning and 39.5MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.42ms. Allocated memory is still 75.5MB. Free memory was 39.5MB in the beginning and 36.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.06ms. Allocated memory is still 75.5MB. Free memory was 36.8MB in the beginning and 34.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1289.57ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 55.0MB in the end (delta: -20.8MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35247.96ms. Allocated memory was 92.3MB in the beginning and 427.8MB in the end (delta: 335.5MB). Free memory was 54.4MB in the beginning and 240.1MB in the end (delta: -185.7MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 427.8MB. Free memory is still 240.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: 11.4s, 132 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2670 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 7336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2821, independent: 2626, independent conditional: 0, independent unconditional: 2626, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1415, independent: 1382, independent conditional: 0, independent unconditional: 1382, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2821, independent: 1244, independent conditional: 0, independent unconditional: 1244, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1415, unknown conditional: 0, unknown unconditional: 1415] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=0, t2321={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=1, t2321={3:0}, t2322={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=2, t2321={3:0}, t2322={7:0}, t2323={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={3:0}, t2322={7:0}, t2323={15:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:5}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 857]: 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, 155 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 792 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 625 mSDsluCounter, 1179 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1118 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3465 IncrementalHoareTripleChecker+Invalid, 3715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 61 mSDtfsCounter, 3465 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=13, InterpolantAutomatonStates: 97, 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.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 2494 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2315 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:11:35,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24071b86-0f3e-4f52-af41-857946d8e467/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample