./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:25:24,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:25:25,058 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:25:25,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:25:25,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:25:25,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:25:25,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:25:25,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:25:25,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:25:25,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:25:25,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:25:25,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:25:25,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:25:25,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:25:25,102 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:25:25,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:25:25,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:25:25,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:25:25,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:25:25,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:25:25,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:25:25,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:25,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:25:25,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:25:25,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:25,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:25:25,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:25:25,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:25:25,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:25:25,108 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2024-11-28 05:25:25,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:25:25,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:25:25,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:25:25,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:25:25,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:25:25,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-28 05:25:28,492 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/data/4ff76cf8d/66bc380cbfd04a9a947f83d8595282fa/FLAG6202fab28 [2024-11-28 05:25:28,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:25:28,739 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-28 05:25:28,753 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/data/4ff76cf8d/66bc380cbfd04a9a947f83d8595282fa/FLAG6202fab28 [2024-11-28 05:25:28,784 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/data/4ff76cf8d/66bc380cbfd04a9a947f83d8595282fa [2024-11-28 05:25:28,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:25:28,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:25:28,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:25:28,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:25:28,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:25:28,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:28" (1/1) ... [2024-11-28 05:25:28,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1dacd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:28, skipping insertion in model container [2024-11-28 05:25:28,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:28" (1/1) ... [2024-11-28 05:25:28,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:25:29,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:25:29,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:25:29,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:25:29,100 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:25:29,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29 WrapperNode [2024-11-28 05:25:29,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:25:29,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:25:29,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:25:29,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:25:29,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,140 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2024-11-28 05:25:29,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:25:29,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:25:29,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:25:29,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:25:29,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,181 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 05:25:29,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:25:29,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:25:29,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:25:29,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:25:29,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (1/1) ... [2024-11-28 05:25:29,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:25:29,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:29,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:25:29,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:25:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:25:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 05:25:29,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 05:25:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 05:25:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 05:25:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:25:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:25:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:25:29,294 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 05:25:29,409 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:25:29,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:25:29,645 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:25:29,645 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:25:29,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:25:29,877 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 05:25:29,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:29 BoogieIcfgContainer [2024-11-28 05:25:29,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:25:29,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:25:29,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:25:29,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:25:29,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:25:28" (1/3) ... [2024-11-28 05:25:29,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e3affb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:29, skipping insertion in model container [2024-11-28 05:25:29,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:29" (2/3) ... [2024-11-28 05:25:29,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e3affb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:29, skipping insertion in model container [2024-11-28 05:25:29,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:29" (3/3) ... [2024-11-28 05:25:29,894 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-11-28 05:25:29,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:25:29,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-28 05:25:29,913 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:25:29,983 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 05:25:30,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 82 flow [2024-11-28 05:25:30,102 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2024-11-28 05:25:30,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 05:25:30,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 4/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-11-28 05:25:30,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 82 flow [2024-11-28 05:25:30,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 74 flow [2024-11-28 05:25:30,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:25:30,153 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@47a82d7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:25:30,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 05:25:30,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:25:30,176 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-28 05:25:30,177 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 05:25:30,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:30,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:30,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:30,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1720791647, now seen corresponding path program 1 times [2024-11-28 05:25:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066240143] [2024-11-28 05:25:30,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066240143] [2024-11-28 05:25:30,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066240143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:30,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:30,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:25:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738552900] [2024-11-28 05:25:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:30,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:25:30,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:30,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:25:30,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:25:30,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-28 05:25:30,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:30,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:30,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-28 05:25:30,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:30,904 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2024-11-28 05:25:30,904 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-28 05:25:30,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 12 based on Foata normal form. 2/258 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2024-11-28 05:25:30,911 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2024-11-28 05:25:30,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2024-11-28 05:25:30,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:25:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:25:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-28 05:25:30,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2024-11-28 05:25:30,930 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 73 transitions. [2024-11-28 05:25:30,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2024-11-28 05:25:30,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 05:25:30,941 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2024-11-28 05:25:30,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2024-11-28 05:25:30,950 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2024-11-28 05:25:30,951 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2024-11-28 05:25:30,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:30,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:30,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:30,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:25:30,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:30,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash -83797343, now seen corresponding path program 1 times [2024-11-28 05:25:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309196062] [2024-11-28 05:25:30,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:30,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309196062] [2024-11-28 05:25:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309196062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709206113] [2024-11-28 05:25:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:31,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:31,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:31,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:25:31,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:31,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:31,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:25:31,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:31,543 INFO L124 PetriNetUnfolderBase]: 191/376 cut-off events. [2024-11-28 05:25:31,544 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-28 05:25:31,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 376 events. 191/376 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1701 event pairs, 20 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 276. Up to 143 conditions per place. [2024-11-28 05:25:31,579 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 36 selfloop transitions, 10 changer transitions 5/65 dead transitions. [2024-11-28 05:25:31,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 65 transitions, 290 flow [2024-11-28 05:25:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:25:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-28 05:25:31,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2024-11-28 05:25:31,585 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 123 transitions. [2024-11-28 05:25:31,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 65 transitions, 290 flow [2024-11-28 05:25:31,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 65 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:25:31,589 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2024-11-28 05:25:31,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-11-28 05:25:31,590 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2024-11-28 05:25:31,590 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2024-11-28 05:25:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:31,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:31,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:31,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:25:31,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:31,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1766413815, now seen corresponding path program 2 times [2024-11-28 05:25:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769767536] [2024-11-28 05:25:31,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:31,634 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:25:31,634 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:31,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769767536] [2024-11-28 05:25:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769767536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:31,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:31,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:31,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537089149] [2024-11-28 05:25:31,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:31,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:31,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:31,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:31,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:31,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:25:31,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:31,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:31,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:25:31,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:32,029 INFO L124 PetriNetUnfolderBase]: 185/391 cut-off events. [2024-11-28 05:25:32,029 INFO L125 PetriNetUnfolderBase]: For 233/237 co-relation queries the response was YES. [2024-11-28 05:25:32,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 391 events. 185/391 cut-off events. For 233/237 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1858 event pairs, 12 based on Foata normal form. 12/373 useless extension candidates. Maximal degree in co-relation 345. Up to 88 conditions per place. [2024-11-28 05:25:32,037 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 35 selfloop transitions, 12 changer transitions 4/65 dead transitions. [2024-11-28 05:25:32,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 348 flow [2024-11-28 05:25:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:25:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-11-28 05:25:32,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-11-28 05:25:32,041 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 120 transitions. [2024-11-28 05:25:32,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 348 flow [2024-11-28 05:25:32,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:25:32,048 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2024-11-28 05:25:32,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2024-11-28 05:25:32,050 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2024-11-28 05:25:32,050 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2024-11-28 05:25:32,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:32,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:32,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:25:32,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash -396854015, now seen corresponding path program 1 times [2024-11-28 05:25:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887722075] [2024-11-28 05:25:32,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887722075] [2024-11-28 05:25:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887722075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:32,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:32,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103888866] [2024-11-28 05:25:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:32,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:32,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:32,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:32,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:25:32,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:32,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:32,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:25:32,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:32,435 INFO L124 PetriNetUnfolderBase]: 182/379 cut-off events. [2024-11-28 05:25:32,436 INFO L125 PetriNetUnfolderBase]: For 590/593 co-relation queries the response was YES. [2024-11-28 05:25:32,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 379 events. 182/379 cut-off events. For 590/593 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1806 event pairs, 17 based on Foata normal form. 4/350 useless extension candidates. Maximal degree in co-relation 572. Up to 163 conditions per place. [2024-11-28 05:25:32,441 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 41 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2024-11-28 05:25:32,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 436 flow [2024-11-28 05:25:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:25:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-11-28 05:25:32,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6882352941176471 [2024-11-28 05:25:32,442 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 117 transitions. [2024-11-28 05:25:32,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 436 flow [2024-11-28 05:25:32,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 432 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-28 05:25:32,450 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2024-11-28 05:25:32,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-28 05:25:32,451 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2024-11-28 05:25:32,451 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2024-11-28 05:25:32,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:32,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:32,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:32,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:25:32,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash -146654475, now seen corresponding path program 2 times [2024-11-28 05:25:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337195370] [2024-11-28 05:25:32,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:32,476 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:25:32,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:32,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:32,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337195370] [2024-11-28 05:25:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337195370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:32,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:32,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:32,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626963292] [2024-11-28 05:25:32,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:32,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:32,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:32,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:32,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:32,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:25:32,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:32,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:32,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:25:32,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:32,815 INFO L124 PetriNetUnfolderBase]: 168/379 cut-off events. [2024-11-28 05:25:32,815 INFO L125 PetriNetUnfolderBase]: For 801/805 co-relation queries the response was YES. [2024-11-28 05:25:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 379 events. 168/379 cut-off events. For 801/805 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1696 event pairs, 6 based on Foata normal form. 21/366 useless extension candidates. Maximal degree in co-relation 751. Up to 99 conditions per place. [2024-11-28 05:25:32,819 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 43 selfloop transitions, 12 changer transitions 1/70 dead transitions. [2024-11-28 05:25:32,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 512 flow [2024-11-28 05:25:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:25:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-11-28 05:25:32,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-11-28 05:25:32,823 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 118 transitions. [2024-11-28 05:25:32,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 512 flow [2024-11-28 05:25:32,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 05:25:32,831 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2024-11-28 05:25:32,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-28 05:25:32,834 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2024-11-28 05:25:32,834 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2024-11-28 05:25:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:32,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:32,834 INFO L206 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, 1] [2024-11-28 05:25:32,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:25:32,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1788303769, now seen corresponding path program 1 times [2024-11-28 05:25:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367882994] [2024-11-28 05:25:32,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367882994] [2024-11-28 05:25:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367882994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:33,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:25:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740875245] [2024-11-28 05:25:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:25:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:33,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:25:33,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:25:33,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2024-11-28 05:25:33,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:33,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:33,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2024-11-28 05:25:33,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:33,451 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2024-11-28 05:25:33,451 INFO L125 PetriNetUnfolderBase]: For 1454/1502 co-relation queries the response was YES. [2024-11-28 05:25:33,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1454/1502 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2386 event pairs, 14 based on Foata normal form. 20/471 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2024-11-28 05:25:33,459 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-11-28 05:25:33,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2024-11-28 05:25:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:25:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:25:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-11-28 05:25:33,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2024-11-28 05:25:33,461 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 129 transitions. [2024-11-28 05:25:33,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2024-11-28 05:25:33,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 05:25:33,470 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2024-11-28 05:25:33,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-11-28 05:25:33,473 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2024-11-28 05:25:33,473 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2024-11-28 05:25:33,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:33,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:33,473 INFO L206 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, 1] [2024-11-28 05:25:33,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:25:33,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:33,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 251143341, now seen corresponding path program 2 times [2024-11-28 05:25:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:33,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094225916] [2024-11-28 05:25:33,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:33,508 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:25:33,511 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:25:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:33,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094225916] [2024-11-28 05:25:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094225916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:33,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:33,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:25:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366802482] [2024-11-28 05:25:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:33,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:25:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:33,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:25:33,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:25:33,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 34 [2024-11-28 05:25:33,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:33,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:33,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 34 [2024-11-28 05:25:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:33,958 INFO L124 PetriNetUnfolderBase]: 257/559 cut-off events. [2024-11-28 05:25:33,958 INFO L125 PetriNetUnfolderBase]: For 2067/2091 co-relation queries the response was YES. [2024-11-28 05:25:33,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 559 events. 257/559 cut-off events. For 2067/2091 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2784 event pairs, 33 based on Foata normal form. 20/508 useless extension candidates. Maximal degree in co-relation 832. Up to 154 conditions per place. [2024-11-28 05:25:33,964 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 43 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2024-11-28 05:25:33,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 762 flow [2024-11-28 05:25:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:25:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:25:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-11-28 05:25:33,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6882352941176471 [2024-11-28 05:25:33,966 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 117 transitions. [2024-11-28 05:25:33,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 762 flow [2024-11-28 05:25:33,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 749 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-28 05:25:33,980 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 589 flow [2024-11-28 05:25:33,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-11-28 05:25:33,982 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2024-11-28 05:25:33,982 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 589 flow [2024-11-28 05:25:33,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:33,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:33,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:25:33,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:33,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1276818075, now seen corresponding path program 3 times [2024-11-28 05:25:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:33,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758803094] [2024-11-28 05:25:33,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:25:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:34,035 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 05:25:34,036 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:25:34,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758803094] [2024-11-28 05:25:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758803094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896121763] [2024-11-28 05:25:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:34,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:34,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:34,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:34,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:34,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:25:34,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:34,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:25:34,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:34,478 INFO L124 PetriNetUnfolderBase]: 468/1002 cut-off events. [2024-11-28 05:25:34,478 INFO L125 PetriNetUnfolderBase]: For 5126/5202 co-relation queries the response was YES. [2024-11-28 05:25:34,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 1002 events. 468/1002 cut-off events. For 5126/5202 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5757 event pairs, 117 based on Foata normal form. 22/903 useless extension candidates. Maximal degree in co-relation 2249. Up to 267 conditions per place. [2024-11-28 05:25:34,487 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 63 selfloop transitions, 16 changer transitions 0/108 dead transitions. [2024-11-28 05:25:34,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 1211 flow [2024-11-28 05:25:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:25:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:25:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-28 05:25:34,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-28 05:25:34,490 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 589 flow. Second operand 4 states and 102 transitions. [2024-11-28 05:25:34,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 1211 flow [2024-11-28 05:25:34,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 1171 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-28 05:25:34,510 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 865 flow [2024-11-28 05:25:34,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=865, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2024-11-28 05:25:34,511 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2024-11-28 05:25:34,513 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 865 flow [2024-11-28 05:25:34,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:34,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:34,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:34,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:25:34,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:34,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167058, now seen corresponding path program 1 times [2024-11-28 05:25:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:34,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156542152] [2024-11-28 05:25:34,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:35,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156542152] [2024-11-28 05:25:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156542152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:25:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904837376] [2024-11-28 05:25:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:25:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:25:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:25:35,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 05:25:35,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 865 flow. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:35,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:35,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 05:25:35,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:36,167 INFO L124 PetriNetUnfolderBase]: 950/1860 cut-off events. [2024-11-28 05:25:36,168 INFO L125 PetriNetUnfolderBase]: For 10582/10582 co-relation queries the response was YES. [2024-11-28 05:25:36,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 1860 events. 950/1860 cut-off events. For 10582/10582 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11537 event pairs, 36 based on Foata normal form. 6/1824 useless extension candidates. Maximal degree in co-relation 4163. Up to 671 conditions per place. [2024-11-28 05:25:36,184 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 94 selfloop transitions, 50 changer transitions 0/154 dead transitions. [2024-11-28 05:25:36,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 154 transitions, 1884 flow [2024-11-28 05:25:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:25:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 05:25:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-11-28 05:25:36,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970588235294118 [2024-11-28 05:25:36,186 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 865 flow. Second operand 10 states and 203 transitions. [2024-11-28 05:25:36,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 154 transitions, 1884 flow [2024-11-28 05:25:36,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 154 transitions, 1884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:25:36,210 INFO L231 Difference]: Finished difference. Result has 86 places, 107 transitions, 1564 flow [2024-11-28 05:25:36,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1564, PETRI_PLACES=86, PETRI_TRANSITIONS=107} [2024-11-28 05:25:36,211 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2024-11-28 05:25:36,211 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 107 transitions, 1564 flow [2024-11-28 05:25:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:36,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:36,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:25:36,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1570710377, now seen corresponding path program 1 times [2024-11-28 05:25:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623255242] [2024-11-28 05:25:36,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:25:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:25:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623255242] [2024-11-28 05:25:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623255242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:25:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:25:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:25:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612814526] [2024-11-28 05:25:36,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:25:36,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:25:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:36,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:25:36,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:25:36,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:25:36,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 107 transitions, 1564 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:36,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:36,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:25:36,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:36,678 INFO L124 PetriNetUnfolderBase]: 594/1307 cut-off events. [2024-11-28 05:25:36,678 INFO L125 PetriNetUnfolderBase]: For 11062/11170 co-relation queries the response was YES. [2024-11-28 05:25:36,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 1307 events. 594/1307 cut-off events. For 11062/11170 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8200 event pairs, 104 based on Foata normal form. 63/1277 useless extension candidates. Maximal degree in co-relation 5605. Up to 357 conditions per place. [2024-11-28 05:25:36,690 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 71 selfloop transitions, 29 changer transitions 0/132 dead transitions. [2024-11-28 05:25:36,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1921 flow [2024-11-28 05:25:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:25:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:25:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-28 05:25:36,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-11-28 05:25:36,692 INFO L175 Difference]: Start difference. First operand has 86 places, 107 transitions, 1564 flow. Second operand 4 states and 97 transitions. [2024-11-28 05:25:36,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1921 flow [2024-11-28 05:25:36,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 1893 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-28 05:25:36,720 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 1468 flow [2024-11-28 05:25:36,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1468, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2024-11-28 05:25:36,722 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2024-11-28 05:25:36,722 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 1468 flow [2024-11-28 05:25:36,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:36,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:25:36,722 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:25:36,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:25:36,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:25:36,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:25:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1721322962, now seen corresponding path program 2 times [2024-11-28 05:25:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:25:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210658760] [2024-11-28 05:25:36,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:25:36,772 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:36,776 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:37,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:25:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210658760] [2024-11-28 05:25:37,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210658760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:25:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688283318] [2024-11-28 05:25:37,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:25:37,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:25:37,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:25:37,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:25:37,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:25:37,452 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:25:37,452 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:25:37,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:25:37,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:25:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:37,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:25:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:25:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688283318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:25:38,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:25:38,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2024-11-28 05:25:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177919938] [2024-11-28 05:25:38,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:25:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:25:38,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:25:38,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:25:38,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:25:38,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 05:25:38,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 1468 flow. Second operand has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:25:38,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:25:38,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 05:25:38,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:25:42,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:25:47,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:25:51,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:25:57,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:26:06,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:26:10,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:26:23,847 INFO L124 PetriNetUnfolderBase]: 2276/4425 cut-off events. [2024-11-28 05:26:23,848 INFO L125 PetriNetUnfolderBase]: For 36811/36811 co-relation queries the response was YES. [2024-11-28 05:26:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20869 conditions, 4425 events. 2276/4425 cut-off events. For 36811/36811 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 29230 event pairs, 76 based on Foata normal form. 184/4429 useless extension candidates. Maximal degree in co-relation 20741. Up to 1202 conditions per place. [2024-11-28 05:26:23,889 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 233 selfloop transitions, 154 changer transitions 0/398 dead transitions. [2024-11-28 05:26:23,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 398 transitions, 5258 flow [2024-11-28 05:26:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 05:26:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-11-28 05:26:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 671 transitions. [2024-11-28 05:26:23,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2024-11-28 05:26:23,896 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 1468 flow. Second operand 33 states and 671 transitions. [2024-11-28 05:26:23,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 398 transitions, 5258 flow [2024-11-28 05:26:23,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 398 transitions, 5232 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-28 05:26:23,949 INFO L231 Difference]: Finished difference. Result has 138 places, 219 transitions, 4116 flow [2024-11-28 05:26:23,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4116, PETRI_PLACES=138, PETRI_TRANSITIONS=219} [2024-11-28 05:26:23,951 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 104 predicate places. [2024-11-28 05:26:23,952 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 219 transitions, 4116 flow [2024-11-28 05:26:23,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:23,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:23,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:23,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:26:24,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:24,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:24,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -133121688, now seen corresponding path program 3 times [2024-11-28 05:26:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571317974] [2024-11-28 05:26:24,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:26:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:24,192 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 05:26:24,192 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:26:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571317974] [2024-11-28 05:26:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571317974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:26:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:26:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:26:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685790208] [2024-11-28 05:26:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:26:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:26:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:24,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:26:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:26:24,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:26:24,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 219 transitions, 4116 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:24,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:26:24,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:26:24,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:26:25,646 INFO L124 PetriNetUnfolderBase]: 2855/6317 cut-off events. [2024-11-28 05:26:25,646 INFO L125 PetriNetUnfolderBase]: For 100801/100947 co-relation queries the response was YES. [2024-11-28 05:26:25,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37022 conditions, 6317 events. 2855/6317 cut-off events. For 100801/100947 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 51614 event pairs, 614 based on Foata normal form. 28/6059 useless extension candidates. Maximal degree in co-relation 33772. Up to 2187 conditions per place. [2024-11-28 05:26:25,725 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 220 selfloop transitions, 122 changer transitions 0/395 dead transitions. [2024-11-28 05:26:25,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 395 transitions, 8426 flow [2024-11-28 05:26:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:26:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:26:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-28 05:26:25,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-11-28 05:26:25,728 INFO L175 Difference]: Start difference. First operand has 138 places, 219 transitions, 4116 flow. Second operand 4 states and 97 transitions. [2024-11-28 05:26:25,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 395 transitions, 8426 flow [2024-11-28 05:26:26,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 395 transitions, 8015 flow, removed 181 selfloop flow, removed 5 redundant places. [2024-11-28 05:26:26,226 INFO L231 Difference]: Finished difference. Result has 139 places, 280 transitions, 5296 flow [2024-11-28 05:26:26,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3899, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5296, PETRI_PLACES=139, PETRI_TRANSITIONS=280} [2024-11-28 05:26:26,227 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2024-11-28 05:26:26,227 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 280 transitions, 5296 flow [2024-11-28 05:26:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:26,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:26,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:26:26,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:26,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1575939132, now seen corresponding path program 1 times [2024-11-28 05:26:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518542780] [2024-11-28 05:26:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518542780] [2024-11-28 05:26:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518542780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914046044] [2024-11-28 05:26:26,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:26:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:26,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:26,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:26:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:26:26,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:26:26,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:26,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914046044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:26,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:26,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-28 05:26:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420883690] [2024-11-28 05:26:26,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:26,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:26:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:26,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:26:26,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:26:26,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-28 05:26:26,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 280 transitions, 5296 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:26,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:26:26,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-28 05:26:26,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:26:28,345 INFO L124 PetriNetUnfolderBase]: 3512/7970 cut-off events. [2024-11-28 05:26:28,345 INFO L125 PetriNetUnfolderBase]: For 135538/135806 co-relation queries the response was YES. [2024-11-28 05:26:28,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49553 conditions, 7970 events. 3512/7970 cut-off events. For 135538/135806 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 68487 event pairs, 692 based on Foata normal form. 32/7870 useless extension candidates. Maximal degree in co-relation 44721. Up to 4420 conditions per place. [2024-11-28 05:26:28,492 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 418 selfloop transitions, 19 changer transitions 1/488 dead transitions. [2024-11-28 05:26:28,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 488 transitions, 10210 flow [2024-11-28 05:26:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:26:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:26:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-28 05:26:28,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7411764705882353 [2024-11-28 05:26:28,493 INFO L175 Difference]: Start difference. First operand has 139 places, 280 transitions, 5296 flow. Second operand 5 states and 126 transitions. [2024-11-28 05:26:28,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 488 transitions, 10210 flow [2024-11-28 05:26:28,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 488 transitions, 10210 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:26:28,972 INFO L231 Difference]: Finished difference. Result has 144 places, 290 transitions, 5399 flow [2024-11-28 05:26:28,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5296, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5399, PETRI_PLACES=144, PETRI_TRANSITIONS=290} [2024-11-28 05:26:28,973 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 110 predicate places. [2024-11-28 05:26:28,973 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 290 transitions, 5399 flow [2024-11-28 05:26:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:28,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:28,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:28,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:26:29,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:29,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:29,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1777423066, now seen corresponding path program 2 times [2024-11-28 05:26:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:29,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849127785] [2024-11-28 05:26:29,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:26:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:29,203 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:29,203 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849127785] [2024-11-28 05:26:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849127785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901865461] [2024-11-28 05:26:29,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:26:29,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:29,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:29,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:29,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:26:29,547 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:29,547 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:29,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 05:26:29,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:29,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:29,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901865461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:29,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:29,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 05:26:29,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605240918] [2024-11-28 05:26:29,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:29,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:26:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:29,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:26:29,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:26:29,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-28 05:26:29,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 290 transitions, 5399 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:29,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:26:29,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-28 05:26:29,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:26:32,744 INFO L124 PetriNetUnfolderBase]: 5205/11807 cut-off events. [2024-11-28 05:26:32,745 INFO L125 PetriNetUnfolderBase]: For 212705/213301 co-relation queries the response was YES. [2024-11-28 05:26:32,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77291 conditions, 11807 events. 5205/11807 cut-off events. For 212705/213301 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 108849 event pairs, 836 based on Foata normal form. 49/11674 useless extension candidates. Maximal degree in co-relation 69540. Up to 5283 conditions per place. [2024-11-28 05:26:32,842 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 604 selfloop transitions, 27 changer transitions 1/682 dead transitions. [2024-11-28 05:26:32,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 682 transitions, 14731 flow [2024-11-28 05:26:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:26:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:26:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-28 05:26:32,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2024-11-28 05:26:32,844 INFO L175 Difference]: Start difference. First operand has 144 places, 290 transitions, 5399 flow. Second operand 6 states and 151 transitions. [2024-11-28 05:26:32,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 682 transitions, 14731 flow [2024-11-28 05:26:33,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 682 transitions, 14683 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-11-28 05:26:33,598 INFO L231 Difference]: Finished difference. Result has 151 places, 306 transitions, 5552 flow [2024-11-28 05:26:33,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5379, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5552, PETRI_PLACES=151, PETRI_TRANSITIONS=306} [2024-11-28 05:26:33,599 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 117 predicate places. [2024-11-28 05:26:33,599 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 306 transitions, 5552 flow [2024-11-28 05:26:33,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:33,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:33,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:33,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 05:26:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:33,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:33,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 250349068, now seen corresponding path program 3 times [2024-11-28 05:26:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661959030] [2024-11-28 05:26:33,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:26:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:33,837 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 05:26:33,837 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661959030] [2024-11-28 05:26:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661959030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595323477] [2024-11-28 05:26:34,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 05:26:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:34,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:34,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:26:34,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 05:26:34,132 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:26:34,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:34,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595323477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:34,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:34,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 05:26:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960115448] [2024-11-28 05:26:34,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:34,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:26:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:34,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:26:34,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:26:34,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-28 05:26:34,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 306 transitions, 5552 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:34,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:26:34,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-28 05:26:34,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:26:38,067 INFO L124 PetriNetUnfolderBase]: 7464/16941 cut-off events. [2024-11-28 05:26:38,068 INFO L125 PetriNetUnfolderBase]: For 313107/313966 co-relation queries the response was YES. [2024-11-28 05:26:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112560 conditions, 16941 events. 7464/16941 cut-off events. For 313107/313966 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 166289 event pairs, 994 based on Foata normal form. 144/16783 useless extension candidates. Maximal degree in co-relation 101240. Up to 6704 conditions per place. [2024-11-28 05:26:38,231 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 684 selfloop transitions, 37 changer transitions 1/772 dead transitions. [2024-11-28 05:26:38,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 772 transitions, 16717 flow [2024-11-28 05:26:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:26:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:26:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-11-28 05:26:38,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-28 05:26:38,233 INFO L175 Difference]: Start difference. First operand has 151 places, 306 transitions, 5552 flow. Second operand 6 states and 153 transitions. [2024-11-28 05:26:38,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 772 transitions, 16717 flow [2024-11-28 05:26:39,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 772 transitions, 16707 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-28 05:26:39,757 INFO L231 Difference]: Finished difference. Result has 157 places, 320 transitions, 5735 flow [2024-11-28 05:26:39,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5542, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5735, PETRI_PLACES=157, PETRI_TRANSITIONS=320} [2024-11-28 05:26:39,758 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 123 predicate places. [2024-11-28 05:26:39,758 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 320 transitions, 5735 flow [2024-11-28 05:26:39,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:39,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:39,758 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:39,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:26:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 05:26:39,959 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash -449906824, now seen corresponding path program 4 times [2024-11-28 05:26:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241850082] [2024-11-28 05:26:39,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:26:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:39,985 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:26:39,985 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241850082] [2024-11-28 05:26:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241850082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951697487] [2024-11-28 05:26:40,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 05:26:40,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:40,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:40,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:40,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:26:40,245 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 05:26:40,245 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:40,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 05:26:40,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:40,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951697487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:40,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 05:26:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074786156] [2024-11-28 05:26:40,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:40,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:26:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:40,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:26:40,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:26:40,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-28 05:26:40,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 320 transitions, 5735 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:40,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:26:40,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-28 05:26:40,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:26:44,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([265] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][97], [Black: 303#(< (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296) 1)), Black: 207#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648))), Black: 367#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (* (div ~N~0 2147483648) 8589934592) 3 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296) (mod ~i1~0 4294967296)) (* ~N~0 4)) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 129#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 356#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0)))), Black: 126#true, Black: 340#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 342#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 102#(and (<= 0 ~d1~0) (<= (mod ~d1~0 256) 0)), Black: 390#true, Black: 392#(not (= (mod ~d2~0 256) 0)), Black: 598#(<= (mod (+ ~pos~0 1) 4294967296) 0), Black: 597#(<= (mod ~pos~0 4294967296) 0), 795#true, Black: 42#(= (mod ~pos~0 4294967296) 0), 57#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 49#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 47#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 28#L61-1true, 76#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 59#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 56#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 113#(or (< (+ (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967294 ~i2~0) 4294967296) (* (div ~N~0 2147483648) 4294967296) 4294967297) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (< (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)) (* 2 ~N~0))), 397#true, 247#(< (mod ~i2~0 4294967296) (* 2 (mod ~N~0 2147483648))), 44#true, Black: 69#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 67#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), 595#true, 87#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 94#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 73#true, Black: 78#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 399#(<= (mod ~pos~0 4294967296) 0), Black: 82#true, 128#(= (mod ~d1~0 256) 0), 19#L46-2true, 393#(< (mod ~d2~0 256) 1), Black: 90#true, Black: 797#(<= (mod ~pos~0 4294967296) 0), Black: 101#(not (= (mod ~d1~0 256) 0)), Black: 99#true, Black: 326#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)) (= (mod (+ 4294967295 ~i2~0) 4294967296) 0)), Black: 338#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 336#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648)) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 132#true, Black: 361#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 994#true, Black: 359#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 349#(and (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 328#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0)))), Black: 344#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 64#true, Black: 363#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 13#L85-4true, Black: 136#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0)))), Black: 353#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 106#true, Black: 365#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 334#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0))), Black: 141#(<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0))]) [2024-11-28 05:26:44,405 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 05:26:44,406 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 05:26:44,406 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:26:44,406 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:26:44,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([265] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][97], [Black: 303#(< (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296) 1)), Black: 207#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648))), Black: 367#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (* (div ~N~0 2147483648) 8589934592) 3 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296) (mod ~i1~0 4294967296)) (* ~N~0 4)) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 129#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 356#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0)))), Black: 126#true, Black: 340#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 342#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 102#(and (<= 0 ~d1~0) (<= (mod ~d1~0 256) 0)), Black: 390#true, Black: 392#(not (= (mod ~d2~0 256) 0)), Black: 598#(<= (mod (+ ~pos~0 1) 4294967296) 0), Black: 597#(<= (mod ~pos~0 4294967296) 0), 795#true, Black: 42#(= (mod ~pos~0 4294967296) 0), 57#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 4#L86true, Black: 49#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 47#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 28#L61-1true, 76#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), Black: 59#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 56#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 113#(or (< (+ (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967294 ~i2~0) 4294967296) (* (div ~N~0 2147483648) 4294967296) 4294967297) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (< (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)) (* 2 ~N~0))), 397#true, 247#(< (mod ~i2~0 4294967296) (* 2 (mod ~N~0 2147483648))), 44#true, Black: 69#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 67#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), 595#true, 87#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 73#true, 94#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 78#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 399#(<= (mod ~pos~0 4294967296) 0), Black: 82#true, 128#(= (mod ~d1~0 256) 0), 19#L46-2true, 393#(< (mod ~d2~0 256) 1), Black: 797#(<= (mod ~pos~0 4294967296) 0), Black: 90#true, Black: 101#(not (= (mod ~d1~0 256) 0)), Black: 99#true, Black: 326#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0)) (= (mod (+ 4294967295 ~i2~0) 4294967296) 0)), Black: 338#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 336#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= 1 (mod ~N~0 2147483648)) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296)))), Black: 132#true, Black: 361#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 359#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 994#true, Black: 349#(and (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 328#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0)))), Black: 344#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), 64#true, Black: 363#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 136#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (+ (mod ~i2~0 4294967296) (* 2 ~N~0)))), Black: 106#true, Black: 353#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0)) (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 365#(and (<= (+ (mod (+ ~i2~0 1) 4294967296) 1) (* 2 (mod ~N~0 2147483648))) (<= (mod (+ ~i2~0 1) 4294967296) (+ (mod (+ ~i2~0 1) 2) (mod ~i1~0 4294967296))) (<= (+ (mod ~i2~0 4294967296) 1) (* 2 (mod ~N~0 2147483648)))), Black: 334#(and (= (mod (+ 4294967295 ~i2~0) 4294967296) 0) (<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod (+ (* 2 ~N~0) (* 4294967295 ~i1~0) 4294967295 ~i2~0) 4294967296)) (* 2 ~N~0))), Black: 141#(<= (+ (* (div ~N~0 2147483648) 4294967296) 2 (mod ~i1~0 4294967296)) (* 2 ~N~0))]) [2024-11-28 05:26:44,475 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-28 05:26:44,475 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:26:44,475 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:26:44,475 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-28 05:26:44,823 INFO L124 PetriNetUnfolderBase]: 9256/21043 cut-off events. [2024-11-28 05:26:44,823 INFO L125 PetriNetUnfolderBase]: For 403615/404757 co-relation queries the response was YES. [2024-11-28 05:26:44,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143762 conditions, 21043 events. 9256/21043 cut-off events. For 403615/404757 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 214699 event pairs, 1212 based on Foata normal form. 269/20967 useless extension candidates. Maximal degree in co-relation 129833. Up to 8640 conditions per place. [2024-11-28 05:26:45,032 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 700 selfloop transitions, 44 changer transitions 1/795 dead transitions. [2024-11-28 05:26:45,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 795 transitions, 17041 flow [2024-11-28 05:26:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:26:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:26:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-11-28 05:26:45,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-28 05:26:45,034 INFO L175 Difference]: Start difference. First operand has 157 places, 320 transitions, 5735 flow. Second operand 6 states and 153 transitions. [2024-11-28 05:26:45,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 795 transitions, 17041 flow [2024-11-28 05:26:47,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 795 transitions, 16977 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-11-28 05:26:47,320 INFO L231 Difference]: Finished difference. Result has 165 places, 343 transitions, 6061 flow [2024-11-28 05:26:47,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5693, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6061, PETRI_PLACES=165, PETRI_TRANSITIONS=343} [2024-11-28 05:26:47,320 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 131 predicate places. [2024-11-28 05:26:47,320 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 343 transitions, 6061 flow [2024-11-28 05:26:47,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:47,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:47,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:47,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:26:47,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:47,521 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2053243764, now seen corresponding path program 5 times [2024-11-28 05:26:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606608605] [2024-11-28 05:26:47,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 05:26:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:47,542 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:47,543 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:26:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606608605] [2024-11-28 05:26:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606608605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:26:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422112517] [2024-11-28 05:26:47,718 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 05:26:47,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:26:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:26:47,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:26:47,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:26:47,784 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:26:47,785 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:26:47,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:26:47,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:26:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:47,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:26:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:26:48,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422112517] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:26:48,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:26:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-28 05:26:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252947220] [2024-11-28 05:26:48,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:26:48,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:26:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:26:48,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:26:48,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:26:48,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-28 05:26:48,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 343 transitions, 6061 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:48,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:26:48,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-28 05:26:48,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:26:53,336 INFO L124 PetriNetUnfolderBase]: 9940/22631 cut-off events. [2024-11-28 05:26:53,336 INFO L125 PetriNetUnfolderBase]: For 445609/446889 co-relation queries the response was YES. [2024-11-28 05:26:53,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159018 conditions, 22631 events. 9940/22631 cut-off events. For 445609/446889 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 233968 event pairs, 1312 based on Foata normal form. 280/22617 useless extension candidates. Maximal degree in co-relation 143340. Up to 12016 conditions per place. [2024-11-28 05:26:53,534 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 648 selfloop transitions, 39 changer transitions 1/738 dead transitions. [2024-11-28 05:26:53,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 738 transitions, 15585 flow [2024-11-28 05:26:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:26:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 05:26:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-28 05:26:53,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2024-11-28 05:26:53,535 INFO L175 Difference]: Start difference. First operand has 165 places, 343 transitions, 6061 flow. Second operand 6 states and 151 transitions. [2024-11-28 05:26:53,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 738 transitions, 15585 flow [2024-11-28 05:26:56,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 738 transitions, 15569 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-28 05:26:56,669 INFO L231 Difference]: Finished difference. Result has 173 places, 362 transitions, 6391 flow [2024-11-28 05:26:56,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6045, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6391, PETRI_PLACES=173, PETRI_TRANSITIONS=362} [2024-11-28 05:26:56,670 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 139 predicate places. [2024-11-28 05:26:56,670 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 362 transitions, 6391 flow [2024-11-28 05:26:56,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:26:56,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:26:56,671 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:26:56,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:26:56,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 05:26:56,871 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:26:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:26:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash -419294308, now seen corresponding path program 6 times [2024-11-28 05:26:56,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:26:56,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576250114] [2024-11-28 05:26:56,872 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 05:26:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:26:56,937 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-28 05:26:56,937 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:27:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:27:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:27:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576250114] [2024-11-28 05:27:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576250114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:27:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930965523] [2024-11-28 05:27:02,063 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 05:27:02,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:27:02,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:27:02,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:27:02,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:27:02,160 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-28 05:27:02,160 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:27:02,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:27:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:27:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:27:05,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:27:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:27:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930965523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:27:24,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:27:24,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 21 [2024-11-28 05:27:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327185135] [2024-11-28 05:27:24,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:27:24,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:27:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:27:24,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:27:24,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=337, Unknown=4, NotChecked=0, Total=420 [2024-11-28 05:27:24,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:27:24,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 362 transitions, 6391 flow. Second operand has 21 states, 21 states have (on average 17.428571428571427) internal successors, (366), 21 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:27:24,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:27:24,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:27:24,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:27:31,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:27:57,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:04,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:09,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:20,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:24,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:35,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:38,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:28:55,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:18,295 WARN L286 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 58 DAG size of output: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:29:22,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:26,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:28,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:32,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:33,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:36,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:29:40,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:04,939 WARN L286 SmtUtils]: Spent 17.60s on a formula simplification. DAG size of input: 66 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:30:08,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:12,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:14,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:37,712 WARN L286 SmtUtils]: Spent 12.58s on a formula simplification. DAG size of input: 52 DAG size of output: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:30:40,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:43,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:30:46,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:12,505 WARN L286 SmtUtils]: Spent 18.30s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:31:16,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:20,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:24,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:28,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:32,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:36,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:40,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:44,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:48,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:31:52,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:32:47,754 WARN L286 SmtUtils]: Spent 24.99s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:32:51,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:32:56,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:00,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:04,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:08,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:12,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:16,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:20,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:24,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:33:28,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:07,613 WARN L286 SmtUtils]: Spent 21.43s on a formula simplification. DAG size of input: 67 DAG size of output: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:34:11,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:15,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:19,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:23,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:27,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:31,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:33,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:37,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:41,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:46,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:50,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:34:54,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:01,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:05,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:07,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:09,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:14,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:18,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:22,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:35,467 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 57 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:35:39,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:43,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:47,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:52,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:35:56,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:36:00,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:36:05,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:36:29,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:36:33,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:36:36,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:36:43,259 INFO L124 PetriNetUnfolderBase]: 22989/52611 cut-off events. [2024-11-28 05:36:43,260 INFO L125 PetriNetUnfolderBase]: For 1210556/1218235 co-relation queries the response was YES. [2024-11-28 05:36:43,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382213 conditions, 52611 events. 22989/52611 cut-off events. For 1210556/1218235 co-relation queries the response was YES. Maximal size of possible extension queue 2122. Compared 610794 event pairs, 700 based on Foata normal form. 2931/55454 useless extension candidates. Maximal degree in co-relation 349490. Up to 10595 conditions per place. [2024-11-28 05:36:44,001 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 893 selfloop transitions, 507 changer transitions 1/1460 dead transitions. [2024-11-28 05:36:44,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 1460 transitions, 25112 flow [2024-11-28 05:36:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-28 05:36:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-11-28 05:36:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 865 transitions. [2024-11-28 05:36:44,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6695046439628483 [2024-11-28 05:36:44,006 INFO L175 Difference]: Start difference. First operand has 173 places, 362 transitions, 6391 flow. Second operand 38 states and 865 transitions. [2024-11-28 05:36:44,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 1460 transitions, 25112 flow [2024-11-28 05:37:00,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1460 transitions, 24824 flow, removed 130 selfloop flow, removed 1 redundant places. [2024-11-28 05:37:00,692 INFO L231 Difference]: Finished difference. Result has 236 places, 765 transitions, 16912 flow [2024-11-28 05:37:00,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6348, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=16912, PETRI_PLACES=236, PETRI_TRANSITIONS=765} [2024-11-28 05:37:00,693 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 202 predicate places. [2024-11-28 05:37:00,693 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 765 transitions, 16912 flow [2024-11-28 05:37:00,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 17.428571428571427) internal successors, (366), 21 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:37:00,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:37:00,694 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:37:00,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:37:00,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 05:37:00,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:37:00,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:37:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1690258318, now seen corresponding path program 7 times [2024-11-28 05:37:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:37:00,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332741010] [2024-11-28 05:37:00,895 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 05:37:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:37:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:37:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:37:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:37:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332741010] [2024-11-28 05:37:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332741010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:37:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349227101] [2024-11-28 05:37:01,358 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 05:37:01,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:37:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:37:01,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:37:01,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89def901-e403-44ac-9edd-224b0e249d6e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:37:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:37:01,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:37:01,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:37:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:37:01,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:37:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:37:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349227101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:37:02,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:37:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-28 05:37:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204991108] [2024-11-28 05:37:02,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:37:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:37:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:37:02,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:37:02,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:37:06,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:37:06,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 05:37:06,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 765 transitions, 16912 flow. Second operand has 19 states, 19 states have (on average 17.63157894736842) internal successors, (335), 19 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) [2024-11-28 05:37:06,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:37:06,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 05:37:06,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:37:15,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:37:38,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:37:44,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:37:54,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:38:16,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:38:18,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:39:20,750 INFO L124 PetriNetUnfolderBase]: 48699/110180 cut-off events. [2024-11-28 05:39:20,750 INFO L125 PetriNetUnfolderBase]: For 4232482/4245966 co-relation queries the response was YES. [2024-11-28 05:39:22,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016647 conditions, 110180 events. 48699/110180 cut-off events. For 4232482/4245966 co-relation queries the response was YES. Maximal size of possible extension queue 3794. Compared 1366821 event pairs, 1353 based on Foata normal form. 8247/118237 useless extension candidates. Maximal degree in co-relation 978238. Up to 23863 conditions per place. [2024-11-28 05:39:23,682 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 1542 selfloop transitions, 937 changer transitions 6/2544 dead transitions. [2024-11-28 05:39:23,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 2544 transitions, 53532 flow [2024-11-28 05:39:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-28 05:39:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2024-11-28 05:39:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 1361 transitions. [2024-11-28 05:39:23,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6456356736242884 [2024-11-28 05:39:23,693 INFO L175 Difference]: Start difference. First operand has 236 places, 765 transitions, 16912 flow. Second operand 62 states and 1361 transitions. [2024-11-28 05:39:23,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 2544 transitions, 53532 flow