./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/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_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:16:48,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:16:48,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:16:48,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:16:48,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:16:48,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:16:48,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:16:48,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:16:48,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:16:48,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:16:48,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:16:48,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:16:48,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:16:48,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:16:48,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:16:48,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:16:48,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:16:48,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:16:48,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:16:48,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:16:48,887 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:16:48,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:16:48,887 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:16:48,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:16:48,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:16:48,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:16:48,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:16:48,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:16:48,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:16:48,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:16:48,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:16:48,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:16:48,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:16:48,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:16:48,889 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_8dbf11f5-3203-4db2-9a2f-3580a8611210/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 ! call(reach_error())) ) 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-28 05:16:49,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:16:49,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:16:49,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:16:49,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:16:49,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:16:49,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-28 05:16:52,134 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/data/064f43226/dd235b80c50b483b928549932c3d34c4/FLAG4efa73237 [2024-11-28 05:16:52,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:16:52,450 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-28 05:16:52,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/data/064f43226/dd235b80c50b483b928549932c3d34c4/FLAG4efa73237 [2024-11-28 05:16:52,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/data/064f43226/dd235b80c50b483b928549932c3d34c4 [2024-11-28 05:16:52,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:16:52,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:16:52,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:16:52,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:16:52,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:16:52,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acd9c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52, skipping insertion in model container [2024-11-28 05:16:52,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:16:52,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2257,2270] [2024-11-28 05:16:52,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:16:52,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:16:52,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2257,2270] [2024-11-28 05:16:52,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:16:52,800 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:16:52,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52 WrapperNode [2024-11-28 05:16:52,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:16:52,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:16:52,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:16:52,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:16:52,816 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:16:52" (1/1) ... [2024-11-28 05:16:52,823 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:16:52" (1/1) ... [2024-11-28 05:16:52,844 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-28 05:16:52,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:16:52,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:16:52,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:16:52,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:16:52,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,866 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:16:52,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:16:52,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:16:52,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:16:52,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:16:52,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (1/1) ... [2024-11-28 05:16:52,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:16:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:52,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/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:16:52,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/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:16:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:16:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 05:16:52,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 05:16:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 05:16:52,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 05:16:52,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 05:16:52,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 05:16:52,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:16:52,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:16:52,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:16:52,956 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:16:53,051 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:16:53,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:16:53,245 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 05:16:53,245 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:16:53,354 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:16:53,354 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 05:16:53,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:16:53 BoogieIcfgContainer [2024-11-28 05:16:53,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:16:53,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:16:53,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:16:53,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:16:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:16:52" (1/3) ... [2024-11-28 05:16:53,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae96358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:16:53, skipping insertion in model container [2024-11-28 05:16:53,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:16:52" (2/3) ... [2024-11-28 05:16:53,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae96358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:16:53, skipping insertion in model container [2024-11-28 05:16:53,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:16:53" (3/3) ... [2024-11-28 05:16:53,368 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-28 05:16:53,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:16:53,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 37 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-28 05:16:53,386 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 05:16:53,452 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 05:16:53,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 101 flow [2024-11-28 05:16:53,544 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-11-28 05:16:53,546 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 05:16:53,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 4/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-28 05:16:53,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 101 flow [2024-11-28 05:16:53,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2024-11-28 05:16:53,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:16:53,593 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=LoopHeads, 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;@6fff4bd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:16:53,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 05:16:53,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 05:16:53,621 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-11-28 05:16:53,621 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 05:16:53,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:53,621 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] [2024-11-28 05:16:53,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:53,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1468491423, now seen corresponding path program 1 times [2024-11-28 05:16:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975698451] [2024-11-28 05:16:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:54,299 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:16:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975698451] [2024-11-28 05:16:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975698451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:16:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919812774] [2024-11-28 05:16:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:54,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:16:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:54,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:16:54,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:16:54,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-28 05:16:54,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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:16:54,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:54,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-28 05:16:54,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:54,784 INFO L124 PetriNetUnfolderBase]: 476/948 cut-off events. [2024-11-28 05:16:54,784 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-28 05:16:54,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 948 events. 476/948 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5542 event pairs, 58 based on Foata normal form. 64/901 useless extension candidates. Maximal degree in co-relation 1486. Up to 403 conditions per place. [2024-11-28 05:16:54,807 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 8 changer transitions 1/63 dead transitions. [2024-11-28 05:16:54,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 264 flow [2024-11-28 05:16:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:16:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 05:16:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-28 05:16:54,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71 [2024-11-28 05:16:54,827 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 90 flow. Second operand 5 states and 142 transitions. [2024-11-28 05:16:54,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 264 flow [2024-11-28 05:16:54,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 05:16:54,845 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 133 flow [2024-11-28 05:16:54,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-28 05:16:54,854 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-11-28 05:16:54,854 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 133 flow [2024-11-28 05:16:54,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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:16:54,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:54,856 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] [2024-11-28 05:16:54,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:16:54,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:54,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1216935627, now seen corresponding path program 2 times [2024-11-28 05:16:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284808343] [2024-11-28 05:16:54,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:16:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:54,889 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 05:16:54,889 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:16:55,014 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:16:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284808343] [2024-11-28 05:16:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284808343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:16:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288151244] [2024-11-28 05:16:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:16:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:16:55,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:16:55,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-28 05:16:55,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:16:55,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:55,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-28 05:16:55,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:55,293 INFO L124 PetriNetUnfolderBase]: 632/1186 cut-off events. [2024-11-28 05:16:55,293 INFO L125 PetriNetUnfolderBase]: For 842/842 co-relation queries the response was YES. [2024-11-28 05:16:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 1186 events. 632/1186 cut-off events. For 842/842 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7035 event pairs, 189 based on Foata normal form. 92/1141 useless extension candidates. Maximal degree in co-relation 1474. Up to 594 conditions per place. [2024-11-28 05:16:55,310 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 26 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2024-11-28 05:16:55,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 222 flow [2024-11-28 05:16:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:16:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:16:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-28 05:16:55,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-28 05:16:55,313 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 133 flow. Second operand 3 states and 84 transitions. [2024-11-28 05:16:55,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 222 flow [2024-11-28 05:16:55,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 05:16:55,321 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 160 flow [2024-11-28 05:16:55,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-11-28 05:16:55,323 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-11-28 05:16:55,323 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 160 flow [2024-11-28 05:16:55,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:16:55,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:55,324 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, 1, 1] [2024-11-28 05:16:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:16:55,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -197948499, now seen corresponding path program 1 times [2024-11-28 05:16:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100189410] [2024-11-28 05:16:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:55,486 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:16:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100189410] [2024-11-28 05:16:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100189410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:16:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954305002] [2024-11-28 05:16:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:16:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:55,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:16:55,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:16:55,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-28 05:16:55,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:16:55,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:55,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-28 05:16:55,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:55,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 26#L46-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,834 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,834 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,834 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,834 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,835 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,835 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,835 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,836 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,836 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,836 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,837 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,837 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 05:16:55,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, 26#L46-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,862 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,862 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,863 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,863 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,863 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,863 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,863 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,863 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 15#L55-1true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,864 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,864 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,864 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,864 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 26#L46-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true]) [2024-11-28 05:16:55,867 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,867 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,867 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,867 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true]) [2024-11-28 05:16:55,868 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,868 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,868 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,868 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true]) [2024-11-28 05:16:55,868 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,868 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,869 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,869 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 26#L46-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,884 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,885 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,885 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 12#L43-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,885 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,885 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,885 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,885 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,886 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,886 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,886 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,886 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 05:16:55,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, 26#L46-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true]) [2024-11-28 05:16:55,891 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:55,891 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, Black: 51#(<= 0 ~pos~0), 12#L43-2true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true]) [2024-11-28 05:16:55,892 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 15#L55-1true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true]) [2024-11-28 05:16:55,892 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,893 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,893 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,893 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,898 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,898 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,898 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,898 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,899 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,899 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 05:16:55,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, 26#L46-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,900 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,900 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,900 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 15#L55-1true, Black: 51#(<= 0 ~pos~0), 28#L41-1true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,901 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,901 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,901 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,901 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 26#L46-2true, Black: 51#(<= 0 ~pos~0), 39#L88-4true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:55,902 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:55,902 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,902 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][16], [5#L89true, 65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L57true, Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,908 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,908 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,908 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,908 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][37], [5#L89true, 65#(<= 1 (mod ~d2~0 256)), 60#(<= 1 (mod ~v_assert~0 256)), 26#L46-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L57true, Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,909 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,909 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,909 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,909 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,909 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,909 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,909 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,910 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,910 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,910 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,913 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 34#L55-3true, 26#L46-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,913 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,913 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,913 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,913 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,914 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,914 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 15#L55-1true, Black: 51#(<= 0 ~pos~0), 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,914 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,915 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,915 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:55,915 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 05:16:55,915 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, 26#L46-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:55,915 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:55,915 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,916 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,916 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 63#true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:55,916 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:55,916 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,916 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:55,916 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,917 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, Black: 51#(<= 0 ~pos~0), 12#L43-2true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,917 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([230] 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][46], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 34#L55-3true, 26#L46-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:55,918 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,918 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:55,920 INFO L124 PetriNetUnfolderBase]: 1341/2305 cut-off events. [2024-11-28 05:16:55,921 INFO L125 PetriNetUnfolderBase]: For 1763/1819 co-relation queries the response was YES. [2024-11-28 05:16:55,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 2305 events. 1341/2305 cut-off events. For 1763/1819 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14215 event pairs, 439 based on Foata normal form. 11/1834 useless extension candidates. Maximal degree in co-relation 3065. Up to 897 conditions per place. [2024-11-28 05:16:55,947 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 34 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-28 05:16:55,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 290 flow [2024-11-28 05:16:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:16:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:16:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-28 05:16:55,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-11-28 05:16:55,949 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 160 flow. Second operand 3 states and 91 transitions. [2024-11-28 05:16:55,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 290 flow [2024-11-28 05:16:55,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:16:55,963 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 172 flow [2024-11-28 05:16:55,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-11-28 05:16:55,964 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-11-28 05:16:55,964 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 172 flow [2024-11-28 05:16:55,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:16:55,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:55,965 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, 1, 1, 1] [2024-11-28 05:16:55,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:16:55,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:55,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 197135441, now seen corresponding path program 1 times [2024-11-28 05:16:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953730558] [2024-11-28 05:16:55,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:56,093 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:16:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:56,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953730558] [2024-11-28 05:16:56,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953730558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:56,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:56,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:16:56,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549782378] [2024-11-28 05:16:56,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:56,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:16:56,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:56,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:16:56,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:16:56,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-28 05:16:56,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:16:56,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:56,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-28 05:16:56,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:56,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 3#L88-3true, 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:56,369 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,369 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:56,369 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:56,369 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:56,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 28#L41-1true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, 68#true, Black: 58#true]) [2024-11-28 05:16:56,386 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,386 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:56,386 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:56,386 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:56,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:56,402 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,402 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,403 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,403 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, 68#true, Black: 58#true]) [2024-11-28 05:16:56,410 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 05:16:56,410 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:56,410 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:56,410 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:56,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:56,465 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,465 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,466 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,466 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L60-->L60-1: Formula: (= (+ v_~pos~0_7 2) v_~pos~0_8) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][45], [Black: 65#(<= 1 (mod ~d2~0 256)), 26#L46-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:56,479 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-28 05:16:56,480 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,480 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:56,480 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L60-->L60-1: Formula: (= (+ v_~pos~0_7 2) v_~pos~0_8) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][45], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 26#L46-2true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:56,488 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:56,489 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,489 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,489 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 05:16:56,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:56,489 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:56,489 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,490 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,490 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,491 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:56,491 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:56,491 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,491 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,491 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,491 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,495 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 63#true, 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:56,496 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:56,496 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,496 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,496 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 05:16:56,496 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,496 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:56,500 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), 28#L41-1true, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:56,500 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 05:16:56,500 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,501 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,501 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,501 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,502 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), 63#true, 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:56,502 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 05:16:56,502 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 05:16:56,502 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,502 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,502 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:56,502 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:56,506 INFO L124 PetriNetUnfolderBase]: 1000/2000 cut-off events. [2024-11-28 05:16:56,506 INFO L125 PetriNetUnfolderBase]: For 1073/1178 co-relation queries the response was YES. [2024-11-28 05:16:56,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 2000 events. 1000/2000 cut-off events. For 1073/1178 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13296 event pairs, 391 based on Foata normal form. 14/1764 useless extension candidates. Maximal degree in co-relation 2415. Up to 731 conditions per place. [2024-11-28 05:16:56,524 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-28 05:16:56,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 285 flow [2024-11-28 05:16:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:16:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 05:16:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-28 05:16:56,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-11-28 05:16:56,526 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 172 flow. Second operand 3 states and 91 transitions. [2024-11-28 05:16:56,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 285 flow [2024-11-28 05:16:56,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:16:56,535 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 188 flow [2024-11-28 05:16:56,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-28 05:16:56,536 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-11-28 05:16:56,536 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 188 flow [2024-11-28 05:16:56,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:16:56,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:56,536 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, 1] [2024-11-28 05:16:56,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:16:56,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash 353346359, now seen corresponding path program 1 times [2024-11-28 05:16:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:56,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563725091] [2024-11-28 05:16:56,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:56,817 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:16:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563725091] [2024-11-28 05:16:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563725091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:16:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086240384] [2024-11-28 05:16:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:56,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:16:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:56,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:16:56,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:16:56,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-11-28 05:16:56,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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:16:56,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:56,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-11-28 05:16:56,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:57,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [38#L87-4true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 70#(<= 1 (mod ~d1~0 256)), Black: 51#(<= 0 ~pos~0), 73#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:57,245 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 05:16:57,245 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:57,245 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:57,245 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:57,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 73#true, Black: 51#(<= 0 ~pos~0), Black: 70#(<= 1 (mod ~d1~0 256)), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 3#L88-3true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-28 05:16:57,284 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 05:16:57,284 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:57,284 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:57,284 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:57,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 73#true, Black: 51#(<= 0 ~pos~0), 39#L88-4true, Black: 70#(<= 1 (mod ~d1~0 256)), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, 68#true, Black: 58#true]) [2024-11-28 05:16:57,325 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 05:16:57,326 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:57,326 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:57,326 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:57,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 70#(<= 1 (mod ~d1~0 256)), Black: 51#(<= 0 ~pos~0), 73#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, 68#true, Black: 58#true]) [2024-11-28 05:16:57,361 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 05:16:57,361 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:57,361 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:57,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:57,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 70#(<= 1 (mod ~d1~0 256)), Black: 51#(<= 0 ~pos~0), 39#L88-4true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:57,393 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-28 05:16:57,393 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:57,393 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:57,393 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:57,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 70#(<= 1 (mod ~d1~0 256)), 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 51#(<= 0 ~pos~0), 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L69-1true]) [2024-11-28 05:16:57,410 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:57,410 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:57,410 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 05:16:57,410 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:57,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 51#(<= 0 ~pos~0), 39#L88-4true, Black: 70#(<= 1 (mod ~d1~0 256)), 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:57,412 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:57,412 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:57,412 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 05:16:57,412 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:57,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 15#L55-1true, Black: 70#(<= 1 (mod ~d1~0 256)), Black: 51#(<= 0 ~pos~0), 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#thread3EXITtrue, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:57,423 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 05:16:57,423 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:57,423 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 05:16:57,423 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 05:16:57,434 INFO L124 PetriNetUnfolderBase]: 1969/3912 cut-off events. [2024-11-28 05:16:57,434 INFO L125 PetriNetUnfolderBase]: For 3297/3457 co-relation queries the response was YES. [2024-11-28 05:16:57,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9643 conditions, 3912 events. 1969/3912 cut-off events. For 3297/3457 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 29546 event pairs, 395 based on Foata normal form. 157/3592 useless extension candidates. Maximal degree in co-relation 6255. Up to 930 conditions per place. [2024-11-28 05:16:57,470 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 38 selfloop transitions, 19 changer transitions 9/86 dead transitions. [2024-11-28 05:16:57,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 461 flow [2024-11-28 05:16:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:16:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:16:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-11-28 05:16:57,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6535714285714286 [2024-11-28 05:16:57,473 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 188 flow. Second operand 7 states and 183 transitions. [2024-11-28 05:16:57,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 461 flow [2024-11-28 05:16:57,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 05:16:57,491 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 325 flow [2024-11-28 05:16:57,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2024-11-28 05:16:57,491 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-11-28 05:16:57,492 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 325 flow [2024-11-28 05:16:57,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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:16:57,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:57,492 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, 1, 1, 1] [2024-11-28 05:16:57,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:16:57,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:57,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1287444426, now seen corresponding path program 1 times [2024-11-28 05:16:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282221950] [2024-11-28 05:16:57,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:57,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:57,816 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:16:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282221950] [2024-11-28 05:16:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282221950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:16:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911335882] [2024-11-28 05:16:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:57,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:16:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:57,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:16:57,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:16:57,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-11-28 05:16:57,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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:16:57,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:57,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-11-28 05:16:57,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:58,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([239] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][83], [26#L46-2true, Black: 63#true, 73#true, Black: 70#(<= 1 (mod ~d1~0 256)), 86#true, 38#L87-4true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,479 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 05:16:58,479 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:58,479 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 05:16:58,479 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:58,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([239] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][83], [Black: 63#true, 26#L46-2true, Black: 70#(<= 1 (mod ~d1~0 256)), 73#true, 3#L88-3true, 86#true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,529 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 05:16:58,529 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:16:58,529 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:58,529 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:58,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([239] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][83], [Black: 63#true, 26#L46-2true, Black: 70#(<= 1 (mod ~d1~0 256)), 73#true, 86#true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,571 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 05:16:58,571 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:58,571 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 05:16:58,571 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:58,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 73#true, Black: 70#(<= 1 (mod ~d1~0 256)), 86#true, 38#L87-4true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 15#L55-1true, Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:58,576 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 05:16:58,576 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:58,576 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:58,576 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:58,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][53], [Black: 63#true, 73#true, Black: 68#true, 86#true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,604 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 05:16:58,604 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:58,604 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 05:16:58,604 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:58,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([239] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][83], [Black: 63#true, 26#L46-2true, Black: 70#(<= 1 (mod ~d1~0 256)), 73#true, 86#true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,607 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 05:16:58,607 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:58,607 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:58,607 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:58,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 73#true, Black: 70#(<= 1 (mod ~d1~0 256)), 3#L88-3true, 86#true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 15#L55-1true, Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), 28#L41-1true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-28 05:16:58,611 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 05:16:58,611 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:58,611 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:58,611 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:58,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][53], [Black: 65#(<= 1 (mod ~d2~0 256)), 73#true, Black: 68#true, 86#true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,629 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 05:16:58,629 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:58,629 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 05:16:58,629 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 05:16:58,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][53], [Black: 63#true, 73#true, Black: 68#true, 86#true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,633 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 05:16:58,633 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 05:16:58,633 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:58,634 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:58,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), 73#true, Black: 70#(<= 1 (mod ~d1~0 256)), 86#true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 15#L55-1true, Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, Black: 58#true]) [2024-11-28 05:16:58,636 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 05:16:58,636 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:58,637 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 05:16:58,637 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:58,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][53], [Black: 65#(<= 1 (mod ~d2~0 256)), 73#true, Black: 68#true, 86#true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true, 23#L60-1true]) [2024-11-28 05:16:58,654 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 05:16:58,654 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 05:16:58,654 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 05:16:58,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:58,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 65#(<= 1 (mod ~d2~0 256)), Black: 70#(<= 1 (mod ~d1~0 256)), 73#true, 86#true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 15#L55-1true, Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 28#L41-1true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 19#$Ultimate##0true, Black: 58#true]) [2024-11-28 05:16:58,659 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 05:16:58,659 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 05:16:58,659 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:16:58,659 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 05:16:58,785 INFO L124 PetriNetUnfolderBase]: 2890/5968 cut-off events. [2024-11-28 05:16:58,785 INFO L125 PetriNetUnfolderBase]: For 11746/12025 co-relation queries the response was YES. [2024-11-28 05:16:58,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16851 conditions, 5968 events. 2890/5968 cut-off events. For 11746/12025 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 47631 event pairs, 488 based on Foata normal form. 143/5323 useless extension candidates. Maximal degree in co-relation 13709. Up to 1640 conditions per place. [2024-11-28 05:16:58,837 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 38 selfloop transitions, 19 changer transitions 39/116 dead transitions. [2024-11-28 05:16:58,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 862 flow [2024-11-28 05:16:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:16:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 05:16:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-11-28 05:16:58,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2024-11-28 05:16:58,840 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 325 flow. Second operand 7 states and 185 transitions. [2024-11-28 05:16:58,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 862 flow [2024-11-28 05:16:58,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 116 transitions, 798 flow, removed 32 selfloop flow, removed 0 redundant places. [2024-11-28 05:16:58,878 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 429 flow [2024-11-28 05:16:58,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-11-28 05:16:58,880 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-11-28 05:16:58,881 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 429 flow [2024-11-28 05:16:58,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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:16:58,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:58,882 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2024-11-28 05:16:58,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:16:58,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:58,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1972506437, now seen corresponding path program 2 times [2024-11-28 05:16:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:58,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382188067] [2024-11-28 05:16:58,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:16:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:58,935 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:16:58,936 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:16:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:16:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382188067] [2024-11-28 05:16:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382188067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:16:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879310546] [2024-11-28 05:16:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:16:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:59,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:16:59,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:16:59,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-28 05:16:59,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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:16:59,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:16:59,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-28 05:16:59,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:16:59,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [Black: 88#(<= 0 ~pos~0), Black: 92#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 89#(<= 1 ~pos~0), Black: 94#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 63#true, 73#true, Black: 68#true, 86#true, 100#true, 10#L69-1true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, Black: 90#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 23#L60-1true]) [2024-11-28 05:16:59,721 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 05:16:59,721 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 05:16:59,721 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 05:16:59,722 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 05:16:59,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [Black: 88#(<= 0 ~pos~0), Black: 92#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 89#(<= 1 ~pos~0), Black: 94#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 63#true, 73#true, Black: 68#true, 86#true, 100#true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 77#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 81#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 2 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#thread3EXITtrue, Black: 58#true, Black: 90#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 23#L60-1true]) [2024-11-28 05:16:59,741 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-28 05:16:59,742 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 05:16:59,742 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-28 05:16:59,742 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 05:16:59,763 INFO L124 PetriNetUnfolderBase]: 2419/4327 cut-off events. [2024-11-28 05:16:59,763 INFO L125 PetriNetUnfolderBase]: For 16771/17484 co-relation queries the response was YES. [2024-11-28 05:16:59,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15120 conditions, 4327 events. 2419/4327 cut-off events. For 16771/17484 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 29373 event pairs, 730 based on Foata normal form. 81/3542 useless extension candidates. Maximal degree in co-relation 11414. Up to 1362 conditions per place. [2024-11-28 05:16:59,807 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 61 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2024-11-28 05:16:59,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 98 transitions, 803 flow [2024-11-28 05:16:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:16:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:16:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-11-28 05:16:59,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-11-28 05:16:59,810 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 429 flow. Second operand 4 states and 124 transitions. [2024-11-28 05:16:59,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 98 transitions, 803 flow [2024-11-28 05:16:59,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 729 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-11-28 05:16:59,845 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 435 flow [2024-11-28 05:16:59,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2024-11-28 05:16:59,846 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-11-28 05:16:59,848 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 435 flow [2024-11-28 05:16:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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:16:59,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:16:59,848 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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:16:59,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:16:59,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:16:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1271503404, now seen corresponding path program 2 times [2024-11-28 05:16:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:59,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273217159] [2024-11-28 05:16:59,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:16:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:59,882 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:16:59,882 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:17:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:17:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273217159] [2024-11-28 05:17:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273217159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:17:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066157978] [2024-11-28 05:17:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:00,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:17:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:17:00,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:17:00,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-28 05:17:00,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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:17:00,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:17:00,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-28 05:17:00,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:17:00,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 88#(<= 0 ~pos~0), Black: 92#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#true, 107#true, Black: 68#true, Black: 102#(= (mod ~d2~0 256) 0), Black: 103#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 100#true, 5#L89true, 51#(<= 0 ~pos~0), Black: 75#(<= 0 ~pos~0), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 76#(<= 2 ~pos~0), 19#$Ultimate##0true, 89#(<= 1 ~pos~0), Black: 58#true, 23#L60-1true]) [2024-11-28 05:17:00,151 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-28 05:17:00,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 05:17:00,152 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 05:17:00,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 05:17:00,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 88#(<= 0 ~pos~0), Black: 92#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 89#(<= 1 ~pos~0), Black: 63#true, Black: 102#(= (mod ~d2~0 256) 0), Black: 68#true, 107#true, 86#true, Black: 100#true, 5#L89true, Black: 75#(<= 0 ~pos~0), Black: 79#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 12#L43-2true, 76#(<= 2 ~pos~0), 103#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 19#$Ultimate##0true, Black: 58#true, 23#L60-1true]) [2024-11-28 05:17:00,237 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 05:17:00,238 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:17:00,238 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 05:17:00,238 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 05:17:00,496 INFO L124 PetriNetUnfolderBase]: 1307/2978 cut-off events. [2024-11-28 05:17:00,496 INFO L125 PetriNetUnfolderBase]: For 4919/5151 co-relation queries the response was YES. [2024-11-28 05:17:00,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9190 conditions, 2978 events. 1307/2978 cut-off events. For 4919/5151 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21983 event pairs, 451 based on Foata normal form. 74/2831 useless extension candidates. Maximal degree in co-relation 6853. Up to 674 conditions per place. [2024-11-28 05:17:00,526 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 47 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-28 05:17:00,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 603 flow [2024-11-28 05:17:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:17:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 05:17:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-28 05:17:00,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-28 05:17:00,527 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 435 flow. Second operand 4 states and 120 transitions. [2024-11-28 05:17:00,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 603 flow [2024-11-28 05:17:00,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 86 transitions, 603 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:17:00,537 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 454 flow [2024-11-28 05:17:00,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-11-28 05:17:00,538 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-11-28 05:17:00,538 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 454 flow [2024-11-28 05:17:00,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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:17:00,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:17:00,538 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:00,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:17:00,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:17:00,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1752987186, now seen corresponding path program 1 times [2024-11-28 05:17:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581987950] [2024-11-28 05:17:00,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581987950] [2024-11-28 05:17:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581987950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:17:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080756840] [2024-11-28 05:17:00,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:17:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:17:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:17:00,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:17:00,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:17:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:17:00,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 05:17:00,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:17:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:01,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:17:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:17:01,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080756840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:17:01,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:17:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-28 05:17:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273843051] [2024-11-28 05:17:01,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:17:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:17:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:01,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:17:01,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:17:01,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-28 05:17:01,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 454 flow. Second operand has 12 states, 12 states have (on average 18.666666666666668) internal successors, (224), 12 states have internal predecessors, (224), 0 states have call successors, (0), 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:17:01,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:17:01,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-28 05:17:01,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:17:02,822 INFO L124 PetriNetUnfolderBase]: 3703/7464 cut-off events. [2024-11-28 05:17:02,822 INFO L125 PetriNetUnfolderBase]: For 18177/18323 co-relation queries the response was YES. [2024-11-28 05:17:02,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26106 conditions, 7464 events. 3703/7464 cut-off events. For 18177/18323 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 57613 event pairs, 359 based on Foata normal form. 216/7654 useless extension candidates. Maximal degree in co-relation 19566. Up to 1934 conditions per place. [2024-11-28 05:17:02,903 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 63 selfloop transitions, 47 changer transitions 25/155 dead transitions. [2024-11-28 05:17:02,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 155 transitions, 1239 flow [2024-11-28 05:17:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:17:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 05:17:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-11-28 05:17:02,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-11-28 05:17:02,905 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 454 flow. Second operand 10 states and 248 transitions. [2024-11-28 05:17:02,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 155 transitions, 1239 flow [2024-11-28 05:17:02,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 155 transitions, 1239 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 05:17:02,928 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 928 flow [2024-11-28 05:17:02,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=928, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2024-11-28 05:17:02,929 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2024-11-28 05:17:02,929 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 928 flow [2024-11-28 05:17:02,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.666666666666668) internal successors, (224), 12 states have internal predecessors, (224), 0 states have call successors, (0), 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:17:02,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 05:17:02,930 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:17:02,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 05:17:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 05:17:03,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-28 05:17:03,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:17:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash 246471420, now seen corresponding path program 2 times [2024-11-28 05:17:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:17:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41959187] [2024-11-28 05:17:03,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:17:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:17:03,167 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:17:03,167 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:17:03,396 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:17:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:17:03,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41959187] [2024-11-28 05:17:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41959187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:17:03,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:17:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:17:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135727040] [2024-11-28 05:17:03,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:17:03,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:17:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:17:03,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:17:03,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:17:03,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-11-28 05:17:03,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 928 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 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:17:03,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 05:17:03,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-11-28 05:17:03,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 05:17:04,163 INFO L124 PetriNetUnfolderBase]: 1597/4440 cut-off events. [2024-11-28 05:17:04,163 INFO L125 PetriNetUnfolderBase]: For 26427/27242 co-relation queries the response was YES. [2024-11-28 05:17:04,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17432 conditions, 4440 events. 1597/4440 cut-off events. For 26427/27242 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 39581 event pairs, 323 based on Foata normal form. 592/4813 useless extension candidates. Maximal degree in co-relation 16594. Up to 907 conditions per place. [2024-11-28 05:17:04,192 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 0 selfloop transitions, 0 changer transitions 163/163 dead transitions. [2024-11-28 05:17:04,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 1808 flow [2024-11-28 05:17:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:17:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 05:17:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-11-28 05:17:04,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.605 [2024-11-28 05:17:04,194 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 928 flow. Second operand 10 states and 242 transitions. [2024-11-28 05:17:04,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 1808 flow [2024-11-28 05:17:04,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 163 transitions, 1626 flow, removed 74 selfloop flow, removed 8 redundant places. [2024-11-28 05:17:04,249 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2024-11-28 05:17:04,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2024-11-28 05:17:04,249 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2024-11-28 05:17:04,250 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2024-11-28 05:17:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 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:17:04,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-28 05:17:04,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-28 05:17:04,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-28 05:17:04,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-28 05:17:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:17:04,253 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2024-11-28 05:17:04,257 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 05:17:04,257 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 05:17:04,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:17:04 BasicIcfg [2024-11-28 05:17:04,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 05:17:04,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 05:17:04,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 05:17:04,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 05:17:04,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:16:53" (3/4) ... [2024-11-28 05:17:04,271 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 05:17:04,274 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 05:17:04,275 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 05:17:04,275 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-28 05:17:04,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2024-11-28 05:17:04,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-28 05:17:04,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-28 05:17:04,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-28 05:17:04,360 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 05:17:04,361 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 05:17:04,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 05:17:04,362 INFO L158 Benchmark]: Toolchain (without parser) took 11873.77ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 93.8MB in the beginning and 394.1MB in the end (delta: -300.4MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2024-11-28 05:17:04,362 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:17:04,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.12ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 81.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:17:04,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.29ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:17:04,363 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:17:04,363 INFO L158 Benchmark]: RCFGBuilder took 470.84ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 59.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 05:17:04,363 INFO L158 Benchmark]: TraceAbstraction took 10908.53ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 59.1MB in the beginning and 402.5MB in the end (delta: -343.5MB). Peak memory consumption was 306.1MB. Max. memory is 16.1GB. [2024-11-28 05:17:04,364 INFO L158 Benchmark]: Witness Printer took 94.49ms. Allocated memory is still 528.5MB. Free memory was 402.5MB in the beginning and 394.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:17:04,365 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 167.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.12ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 81.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.29ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 470.84ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 59.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10908.53ms. Allocated memory was 117.4MB in the beginning and 528.5MB in the end (delta: 411.0MB). Free memory was 59.1MB in the beginning and 402.5MB in the end (delta: -343.5MB). Peak memory consumption was 306.1MB. Max. memory is 16.1GB. * Witness Printer took 94.49ms. Allocated memory is still 528.5MB. Free memory was 402.5MB in the beginning and 394.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 60 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 946 IncrementalHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 12 mSDtfsCounter, 946 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=928occurred in iteration=9, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 952 SizeOfPredicates, 7 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 37/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 05:17:04,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbf11f5-3203-4db2-9a2f-3580a8611210/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE