./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya --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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:59:58,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:59:58,756 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 23:59:58,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:59:58,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:59:58,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:59:58,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:59:58,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:59:58,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:59:58,788 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:59:58,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:59:58,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:59:58,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:59:58,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:59:58,791 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:59:58,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:59:58,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:59:58,792 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:59:58,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:59:58,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:59:58,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:59:58,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:59:58,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:59:58,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:59:58,796 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:59:58,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:59:58,797 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:59:58,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:59:58,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:59:58,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:59:58,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:59:58,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:59:58,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:59:58,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:59:58,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:59:58,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:59:58,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:59:58,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:59:58,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:59:58,801 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:59:58,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:59:58,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:59:58,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2023-11-28 23:59:59,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:59:59,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:59:59,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:59:59,041 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:59:59,042 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:59:59,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2023-11-29 00:00:01,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:00:01,912 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:00:01,912 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2023-11-29 00:00:01,919 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/data/4013bdee5/65f58a3b6f66437ca03faa0cb5502357/FLAG75ebd8510 [2023-11-29 00:00:01,931 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/data/4013bdee5/65f58a3b6f66437ca03faa0cb5502357 [2023-11-29 00:00:01,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:00:01,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:00:01,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:00:01,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:00:01,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:00:01,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:00:01" (1/1) ... [2023-11-29 00:00:01,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755dbd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:01, skipping insertion in model container [2023-11-29 00:00:01,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:00:01" (1/1) ... [2023-11-29 00:00:01,972 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:00:02,140 WARN L240 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_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c[2505,2518] [2023-11-29 00:00:02,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:00:02,155 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:00:02,178 WARN L240 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_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c[2505,2518] [2023-11-29 00:00:02,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:00:02,193 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:00:02,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02 WrapperNode [2023-11-29 00:00:02,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:00:02,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:00:02,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:00:02,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:00:02,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,231 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-11-29 00:00:02,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:00:02,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:00:02,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:00:02,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:00:02,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,263 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 00:00:02,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:00:02,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:00:02,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:00:02,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:00:02,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (1/1) ... [2023-11-29 00:00:02,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:00:02,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:02,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:00:02,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 00:00:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 00:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 00:00:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 00:00:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 00:00:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 00:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 00:00:02,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 00:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:00:02,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:00:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:00:02,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:00:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:00:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:00:02,343 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:00:02,447 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:00:02,449 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:00:02,670 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:00:02,836 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:00:02,836 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 00:00:02,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:00:02 BoogieIcfgContainer [2023-11-29 00:00:02,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:00:02,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:00:02,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:00:02,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:00:02,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:00:01" (1/3) ... [2023-11-29 00:00:02,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4519f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:00:02, skipping insertion in model container [2023-11-29 00:00:02,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:00:02" (2/3) ... [2023-11-29 00:00:02,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4519f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:00:02, skipping insertion in model container [2023-11-29 00:00:02,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:00:02" (3/3) ... [2023-11-29 00:00:02,856 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2023-11-29 00:00:02,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:00:02,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:00:02,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:00:02,870 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:00:02,920 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 00:00:02,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 98 flow [2023-11-29 00:00:02,978 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-11-29 00:00:02,978 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:00:02,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-11-29 00:00:02,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 35 transitions, 98 flow [2023-11-29 00:00:02,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2023-11-29 00:00:02,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:00:03,000 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@220ab927, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:00:03,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 00:00:03,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:00:03,014 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-11-29 00:00:03,014 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:00:03,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:03,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:03,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:03,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1850179278, now seen corresponding path program 1 times [2023-11-29 00:00:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:03,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105637544] [2023-11-29 00:00:03,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:03,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:03,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105637544] [2023-11-29 00:00:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105637544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:03,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:00:03,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304216577] [2023-11-29 00:00:03,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:03,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:00:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:00:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:00:03,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:03,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:03,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:03,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:03,814 INFO L124 PetriNetUnfolderBase]: 1537/1955 cut-off events. [2023-11-29 00:00:03,815 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-11-29 00:00:03,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1955 events. 1537/1955 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6383 event pairs, 141 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-11-29 00:00:03,833 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 41 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2023-11-29 00:00:03,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 243 flow [2023-11-29 00:00:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:00:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:00:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2023-11-29 00:00:03,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-29 00:00:03,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 75 transitions. [2023-11-29 00:00:03,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 75 transitions. [2023-11-29 00:00:03,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:03,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 75 transitions. [2023-11-29 00:00:03,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2023-11-29 00:00:03,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:03,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:03,854 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 84 flow. Second operand 3 states and 75 transitions. [2023-11-29 00:00:03,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 243 flow [2023-11-29 00:00:03,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 00:00:03,862 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 101 flow [2023-11-29 00:00:03,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2023-11-29 00:00:03,867 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-11-29 00:00:03,867 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 101 flow [2023-11-29 00:00:03,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:03,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:03,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:03,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:00:03,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:03,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 205473119, now seen corresponding path program 1 times [2023-11-29 00:00:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888449723] [2023-11-29 00:00:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888449723] [2023-11-29 00:00:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888449723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013101970] [2023-11-29 00:00:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:04,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:00:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:00:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:00:04,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:04,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:04,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:04,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:04,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:04,448 INFO L124 PetriNetUnfolderBase]: 1837/2362 cut-off events. [2023-11-29 00:00:04,449 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-11-29 00:00:04,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 2362 events. 1837/2362 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8351 event pairs, 138 based on Foata normal form. 34/2396 useless extension candidates. Maximal degree in co-relation 1437. Up to 964 conditions per place. [2023-11-29 00:00:04,470 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2023-11-29 00:00:04,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 87 transitions, 415 flow [2023-11-29 00:00:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-29 00:00:04,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2023-11-29 00:00:04,475 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-29 00:00:04,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-29 00:00:04,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:04,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-29 00:00:04,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:04,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:04,478 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:04,478 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 101 flow. Second operand 5 states and 121 transitions. [2023-11-29 00:00:04,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 87 transitions, 415 flow [2023-11-29 00:00:04,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:00:04,482 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 161 flow [2023-11-29 00:00:04,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2023-11-29 00:00:04,483 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-11-29 00:00:04,484 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 161 flow [2023-11-29 00:00:04,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:04,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:04,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:04,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:00:04,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:04,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash -693306653, now seen corresponding path program 1 times [2023-11-29 00:00:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:04,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130094033] [2023-11-29 00:00:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130094033] [2023-11-29 00:00:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130094033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841838344] [2023-11-29 00:00:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:04,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:04,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:00:04,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:00:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:04,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:00:04,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:04,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841838344] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:00:04,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:00:04,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-29 00:00:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867801971] [2023-11-29 00:00:04,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:04,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:00:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:00:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:00:04,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:04,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:04,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:04,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:04,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:05,475 INFO L124 PetriNetUnfolderBase]: 2211/2949 cut-off events. [2023-11-29 00:00:05,475 INFO L125 PetriNetUnfolderBase]: For 3599/3599 co-relation queries the response was YES. [2023-11-29 00:00:05,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8999 conditions, 2949 events. 2211/2949 cut-off events. For 3599/3599 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11957 event pairs, 330 based on Foata normal form. 80/3025 useless extension candidates. Maximal degree in co-relation 3490. Up to 1265 conditions per place. [2023-11-29 00:00:05,504 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 90 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2023-11-29 00:00:05,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 103 transitions, 615 flow [2023-11-29 00:00:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2023-11-29 00:00:05,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-29 00:00:05,506 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 119 transitions. [2023-11-29 00:00:05,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 119 transitions. [2023-11-29 00:00:05,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:05,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 119 transitions. [2023-11-29 00:00:05,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,509 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 161 flow. Second operand 5 states and 119 transitions. [2023-11-29 00:00:05,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 103 transitions, 615 flow [2023-11-29 00:00:05,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 103 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:00:05,514 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 216 flow [2023-11-29 00:00:05,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2023-11-29 00:00:05,515 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-11-29 00:00:05,515 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 216 flow [2023-11-29 00:00:05,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:05,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:05,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:00:05,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:05,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:05,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -750387849, now seen corresponding path program 2 times [2023-11-29 00:00:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:05,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334344940] [2023-11-29 00:00:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334344940] [2023-11-29 00:00:05,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334344940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:05,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:05,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525097108] [2023-11-29 00:00:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:05,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:00:05,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:00:05,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:00:05,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:05,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:05,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:05,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:05,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:06,281 INFO L124 PetriNetUnfolderBase]: 2111/2831 cut-off events. [2023-11-29 00:00:06,282 INFO L125 PetriNetUnfolderBase]: For 4787/4803 co-relation queries the response was YES. [2023-11-29 00:00:06,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10429 conditions, 2831 events. 2111/2831 cut-off events. For 4787/4803 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11826 event pairs, 435 based on Foata normal form. 108/2939 useless extension candidates. Maximal degree in co-relation 5299. Up to 1605 conditions per place. [2023-11-29 00:00:06,312 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 90 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-11-29 00:00:06,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 105 transitions, 677 flow [2023-11-29 00:00:06,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-29 00:00:06,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2023-11-29 00:00:06,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-29 00:00:06,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-29 00:00:06,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:06,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-29 00:00:06,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,316 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,316 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 216 flow. Second operand 5 states and 121 transitions. [2023-11-29 00:00:06,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 105 transitions, 677 flow [2023-11-29 00:00:06,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 105 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:00:06,330 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 270 flow [2023-11-29 00:00:06,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2023-11-29 00:00:06,331 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-11-29 00:00:06,331 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 270 flow [2023-11-29 00:00:06,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:06,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:06,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:00:06,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:06,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 934761512, now seen corresponding path program 1 times [2023-11-29 00:00:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116245866] [2023-11-29 00:00:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:06,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:06,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116245866] [2023-11-29 00:00:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116245866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:06,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629113103] [2023-11-29 00:00:06,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:06,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:00:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:06,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:00:06,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:00:06,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:06,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:06,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:06,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:06,916 INFO L124 PetriNetUnfolderBase]: 2045/2752 cut-off events. [2023-11-29 00:00:06,916 INFO L125 PetriNetUnfolderBase]: For 7530/7534 co-relation queries the response was YES. [2023-11-29 00:00:06,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 2752 events. 2045/2752 cut-off events. For 7530/7534 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11524 event pairs, 165 based on Foata normal form. 67/2819 useless extension candidates. Maximal degree in co-relation 5677. Up to 1169 conditions per place. [2023-11-29 00:00:06,946 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2023-11-29 00:00:06,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 104 transitions, 701 flow [2023-11-29 00:00:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2023-11-29 00:00:06,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2023-11-29 00:00:06,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 120 transitions. [2023-11-29 00:00:06,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 120 transitions. [2023-11-29 00:00:06,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:06,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 120 transitions. [2023-11-29 00:00:06,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,950 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 270 flow. Second operand 5 states and 120 transitions. [2023-11-29 00:00:06,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 104 transitions, 701 flow [2023-11-29 00:00:06,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 692 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-29 00:00:06,968 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 275 flow [2023-11-29 00:00:06,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-11-29 00:00:06,969 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2023-11-29 00:00:06,969 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 275 flow [2023-11-29 00:00:06,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:06,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:06,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:06,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:00:06,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:06,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1268724436, now seen corresponding path program 1 times [2023-11-29 00:00:06,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222974042] [2023-11-29 00:00:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:07,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:07,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222974042] [2023-11-29 00:00:07,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222974042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:07,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:07,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:07,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388418986] [2023-11-29 00:00:07,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:07,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:00:07,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:07,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:00:07,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:00:07,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:07,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:07,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:07,494 INFO L124 PetriNetUnfolderBase]: 2003/2728 cut-off events. [2023-11-29 00:00:07,494 INFO L125 PetriNetUnfolderBase]: For 8524/8528 co-relation queries the response was YES. [2023-11-29 00:00:07,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11350 conditions, 2728 events. 2003/2728 cut-off events. For 8524/8528 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11123 event pairs, 75 based on Foata normal form. 43/2767 useless extension candidates. Maximal degree in co-relation 5727. Up to 1137 conditions per place. [2023-11-29 00:00:07,519 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 104 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2023-11-29 00:00:07,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 937 flow [2023-11-29 00:00:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-29 00:00:07,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2023-11-29 00:00:07,522 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-29 00:00:07,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-29 00:00:07,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:07,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-29 00:00:07,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,524 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,524 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 275 flow. Second operand 5 states and 117 transitions. [2023-11-29 00:00:07,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 937 flow [2023-11-29 00:00:07,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 119 transitions, 912 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 00:00:07,539 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 329 flow [2023-11-29 00:00:07,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-11-29 00:00:07,540 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-11-29 00:00:07,540 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 329 flow [2023-11-29 00:00:07,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:07,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:07,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:00:07,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:07,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash 693111089, now seen corresponding path program 2 times [2023-11-29 00:00:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:07,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091284978] [2023-11-29 00:00:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:07,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091284978] [2023-11-29 00:00:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091284978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:07,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547613728] [2023-11-29 00:00:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:00:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:00:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:00:07,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:07,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:07,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:07,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:07,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:08,016 INFO L124 PetriNetUnfolderBase]: 1801/2440 cut-off events. [2023-11-29 00:00:08,016 INFO L125 PetriNetUnfolderBase]: For 7828/7832 co-relation queries the response was YES. [2023-11-29 00:00:08,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 2440 events. 1801/2440 cut-off events. For 7828/7832 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9543 event pairs, 99 based on Foata normal form. 39/2475 useless extension candidates. Maximal degree in co-relation 6696. Up to 987 conditions per place. [2023-11-29 00:00:08,038 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 98 selfloop transitions, 9 changer transitions 4/116 dead transitions. [2023-11-29 00:00:08,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 917 flow [2023-11-29 00:00:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2023-11-29 00:00:08,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2023-11-29 00:00:08,040 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 116 transitions. [2023-11-29 00:00:08,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 116 transitions. [2023-11-29 00:00:08,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:08,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 116 transitions. [2023-11-29 00:00:08,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,041 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,041 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 329 flow. Second operand 5 states and 116 transitions. [2023-11-29 00:00:08,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 917 flow [2023-11-29 00:00:08,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 904 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 00:00:08,062 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 329 flow [2023-11-29 00:00:08,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 00:00:08,063 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2023-11-29 00:00:08,063 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 329 flow [2023-11-29 00:00:08,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:08,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:08,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:00:08,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:08,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 83147970, now seen corresponding path program 2 times [2023-11-29 00:00:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229190544] [2023-11-29 00:00:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:08,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:08,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229190544] [2023-11-29 00:00:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229190544] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821205839] [2023-11-29 00:00:08,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:00:08,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:08,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:08,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:00:08,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:00:08,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:00:08,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:00:08,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:00:08,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:08,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821205839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:00:08,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:00:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-29 00:00:08,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436291434] [2023-11-29 00:00:08,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:08,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:00:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:00:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:00:08,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:08,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:08,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:08,945 INFO L124 PetriNetUnfolderBase]: 1725/2376 cut-off events. [2023-11-29 00:00:08,945 INFO L125 PetriNetUnfolderBase]: For 8111/8115 co-relation queries the response was YES. [2023-11-29 00:00:08,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10854 conditions, 2376 events. 1725/2376 cut-off events. For 8111/8115 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9867 event pairs, 293 based on Foata normal form. 77/2449 useless extension candidates. Maximal degree in co-relation 6831. Up to 1307 conditions per place. [2023-11-29 00:00:08,982 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 101 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2023-11-29 00:00:08,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 929 flow [2023-11-29 00:00:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-29 00:00:08,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2023-11-29 00:00:08,983 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-29 00:00:08,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-29 00:00:08,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:08,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-29 00:00:08,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,985 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,986 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 329 flow. Second operand 5 states and 113 transitions. [2023-11-29 00:00:08,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 929 flow [2023-11-29 00:00:08,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 114 transitions, 920 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 00:00:08,998 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 370 flow [2023-11-29 00:00:08,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-11-29 00:00:08,998 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2023-11-29 00:00:08,999 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 370 flow [2023-11-29 00:00:08,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:08,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:08,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:09,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:00:09,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 00:00:09,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:09,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1633992060, now seen corresponding path program 2 times [2023-11-29 00:00:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063768993] [2023-11-29 00:00:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063768993] [2023-11-29 00:00:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063768993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:00:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447607853] [2023-11-29 00:00:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:09,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:00:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:00:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:00:09,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:00:09,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:00:09,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:09,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:09,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:00:09,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:09,701 INFO L124 PetriNetUnfolderBase]: 1657/2291 cut-off events. [2023-11-29 00:00:09,701 INFO L125 PetriNetUnfolderBase]: For 8435/8451 co-relation queries the response was YES. [2023-11-29 00:00:09,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11190 conditions, 2291 events. 1657/2291 cut-off events. For 8435/8451 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9642 event pairs, 481 based on Foata normal form. 72/2363 useless extension candidates. Maximal degree in co-relation 9804. Up to 1331 conditions per place. [2023-11-29 00:00:09,715 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 117 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2023-11-29 00:00:09,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1118 flow [2023-11-29 00:00:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:00:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:00:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2023-11-29 00:00:09,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2023-11-29 00:00:09,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 117 transitions. [2023-11-29 00:00:09,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 117 transitions. [2023-11-29 00:00:09,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:09,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 117 transitions. [2023-11-29 00:00:09,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:09,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:09,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:09,718 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 370 flow. Second operand 5 states and 117 transitions. [2023-11-29 00:00:09,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1118 flow [2023-11-29 00:00:09,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 1060 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-29 00:00:09,732 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 407 flow [2023-11-29 00:00:09,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-11-29 00:00:09,733 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2023-11-29 00:00:09,733 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 407 flow [2023-11-29 00:00:09,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:00:09,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:09,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:09,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:00:09,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:00:09,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash 309046099, now seen corresponding path program 1 times [2023-11-29 00:00:09,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:00:09,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561497019] [2023-11-29 00:00:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:09,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:00:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:00:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561497019] [2023-11-29 00:00:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561497019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541984122] [2023-11-29 00:00:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:10,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:00:10,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:00:10,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:00:10,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:00:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:12,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:00:12,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:36,052 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:02:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:46,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541984122] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:27,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:03:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 00:03:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506127314] [2023-11-29 00:03:27,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:27,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:03:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:03:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=166, Unknown=25, NotChecked=0, Total=240 [2023-11-29 00:03:27,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:03:27,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 407 flow. Second operand has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:27,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:27,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:03:27,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:31,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:04:41,529 WARN L293 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 89 DAG size of output: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:04:43,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:04:47,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:04:51,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:04:55,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:04:59,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:03,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:06,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:10,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:14,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:17,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:39,422 WARN L293 SmtUtils]: Spent 13.14s on a formula simplification. DAG size of input: 75 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:05:43,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:44,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:47,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:51,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:52,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:05:56,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:00,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:04,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:06,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:10,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:13,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:17,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:21,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:26,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:30,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:34,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:38,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:43,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:47,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:51,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:55,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:06:59,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:03,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:08,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:12,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div c_~x2~0 4294967296) 4294967296))) (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod (* (div (* (- 1) c_~x1~0) 16) 4294967295) 4294967296)) (.cse4 (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (.cse3 (+ c_~x1~0 .cse2)) (.cse5 (mod c_~x3~0 4294967296))) (and (<= (+ .cse0 1) .cse1) (or (< (+ 2 (* 4294967296 (div c_~n~0 4294967296)) c_~x2~0) (+ c_~n~0 .cse2)) (= .cse3 .cse4)) (<= .cse1 (mod c_~x1~0 4294967296)) (= .cse5 (mod c_~x4~0 4294967296)) (= (mod c_~x2~0 16) 0) (= .cse0 (mod (div c_~x2~0 16) 4294967296)) (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (<= .cse4 .cse3) (= (mod (* c_~x1~0 15) 16) 0) (<= 1 .cse5)))) is different from false [2023-11-29 00:07:13,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:19,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:23,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:27,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:32,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:36,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:40,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:43,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:47,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:02,279 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 47 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:08:08,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:20,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:24,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:26,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:30,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:34,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:38,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:40,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:43,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:45,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:47,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:50,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:53,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:57,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:08:59,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:01,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:03,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:06,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:10,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:09:10,735 INFO L124 PetriNetUnfolderBase]: 2395/3341 cut-off events. [2023-11-29 00:09:10,735 INFO L125 PetriNetUnfolderBase]: For 11642/11642 co-relation queries the response was YES. [2023-11-29 00:09:10,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16735 conditions, 3341 events. 2395/3341 cut-off events. For 11642/11642 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15342 event pairs, 170 based on Foata normal form. 2/3340 useless extension candidates. Maximal degree in co-relation 15235. Up to 2251 conditions per place. [2023-11-29 00:09:10,757 INFO L140 encePairwiseOnDemand]: 18/35 looper letters, 176 selfloop transitions, 65 changer transitions 13/259 dead transitions. [2023-11-29 00:09:10,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 259 transitions, 2022 flow [2023-11-29 00:09:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:09:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 00:09:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 310 transitions. [2023-11-29 00:09:10,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6813186813186813 [2023-11-29 00:09:10,760 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 310 transitions. [2023-11-29 00:09:10,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 310 transitions. [2023-11-29 00:09:10,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:09:10,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 310 transitions. [2023-11-29 00:09:10,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 23.846153846153847) internal successors, (310), 13 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:10,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 35.0) internal successors, (490), 14 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:10,763 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 35.0) internal successors, (490), 14 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:10,764 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 407 flow. Second operand 13 states and 310 transitions. [2023-11-29 00:09:10,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 259 transitions, 2022 flow [2023-11-29 00:09:10,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 259 transitions, 2001 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-29 00:09:10,782 INFO L231 Difference]: Finished difference. Result has 90 places, 118 transitions, 1150 flow [2023-11-29 00:09:10,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1150, PETRI_PLACES=90, PETRI_TRANSITIONS=118} [2023-11-29 00:09:10,783 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2023-11-29 00:09:10,784 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 118 transitions, 1150 flow [2023-11-29 00:09:10,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:10,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:09:10,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:09:10,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:09:10,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:09:10,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 00:09:10,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1294326141, now seen corresponding path program 2 times [2023-11-29 00:09:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:09:10,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084595777] [2023-11-29 00:09:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:09:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:09:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:09:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084595777] [2023-11-29 00:09:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084595777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:09:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89207966] [2023-11-29 00:09:11,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:09:11,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:09:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:09:11,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:09:11,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f6e711-fcb7-4d93-84a4-939cfeb9b0c6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:09:19,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:09:19,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:09:19,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:09:19,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:10:28,314 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:11:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:23,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:12:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89207966] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:12:01,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:12:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-11-29 00:12:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822979607] [2023-11-29 00:12:01,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:12:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:12:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:12:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=170, Unknown=20, NotChecked=0, Total=240 [2023-11-29 00:12:01,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2023-11-29 00:12:01,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 118 transitions, 1150 flow. Second operand has 16 states, 16 states have (on average 12.9375) internal successors, (207), 16 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:01,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:01,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2023-11-29 00:12:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:47,460 WARN L293 SmtUtils]: Spent 42.17s on a formula simplification. DAG size of input: 79 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:12:52,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:12:56,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:00,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:02,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:11,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:31,114 WARN L293 SmtUtils]: Spent 15.03s on a formula simplification. DAG size of input: 76 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:13:35,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:39,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:45,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:47,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:51,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:55,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:13:59,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:03,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:07,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:11,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:15,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:20,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:24,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:28,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:32,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:36,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:40,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:44,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:48,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:14:52,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []