./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:06:29,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:29,873 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:06:29,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:29,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:29,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:29,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:29,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:29,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:29,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:29,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:29,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:29,922 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:29,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:29,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:06:29,923 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:06:29,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:06:29,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:06:29,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:29,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:06:29,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:29,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:06:29,927 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:06:29,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:06:29,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:29,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:29,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:29,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:29,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:29,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:29,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:29,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:06:29,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:06:29,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:06:29,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:29,932 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:06:29,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:29,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:29,933 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:29,934 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_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 [2023-11-06 22:06:30,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:30,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:30,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:30,233 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:30,234 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:30,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2023-11-06 22:06:33,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:33,605 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:33,606 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2023-11-06 22:06:33,614 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/data/62da62cc4/b2126cb1d48a4f1d9ac807f1b0d1529f/FLAG6d0553dbd [2023-11-06 22:06:33,629 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/data/62da62cc4/b2126cb1d48a4f1d9ac807f1b0d1529f [2023-11-06 22:06:33,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:33,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:33,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:33,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:33,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:33,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:33,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fd07dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33, skipping insertion in model container [2023-11-06 22:06:33,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:33,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:33,860 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_3bc765be-3fa5-4838-842e-46cfda9e0426/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2023-11-06 22:06:33,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:33,881 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:06:33,913 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_3bc765be-3fa5-4838-842e-46cfda9e0426/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2023-11-06 22:06:33,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:33,929 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:06:33,929 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:06:33,937 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:06:33,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33 WrapperNode [2023-11-06 22:06:33,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:33,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:33,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:06:33,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:06:33,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:33,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:33,986 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-06 22:06:33,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:33,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:06:33,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:06:33,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:06:33,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:33,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:06:34,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:06:34,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:06:34,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:06:34,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (1/1) ... [2023-11-06 22:06:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:34,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:34,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:06:34,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:06:34,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:06:34,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:06:34,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:06:34,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:06:34,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 22:06:34,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 22:06:34,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 22:06:34,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 22:06:34,132 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 22:06:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 22:06:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-06 22:06:34,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-06 22:06:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:06:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:06:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:06:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:06:34,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:06:34,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:06:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:06:34,138 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:06:34,307 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:06:34,309 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:06:34,665 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:06:34,803 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:06:34,803 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:06:34,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:34 BoogieIcfgContainer [2023-11-06 22:06:34,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:06:34,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:06:34,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:06:34,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:06:34,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:33" (1/3) ... [2023-11-06 22:06:34,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f129bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:34, skipping insertion in model container [2023-11-06 22:06:34,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:33" (2/3) ... [2023-11-06 22:06:34,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f129bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:34, skipping insertion in model container [2023-11-06 22:06:34,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:34" (3/3) ... [2023-11-06 22:06:34,816 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2023-11-06 22:06:34,825 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:06:34,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:06:34,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:06:34,837 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:06:34,930 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 22:06:34,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 174 transitions, 376 flow [2023-11-06 22:06:35,094 INFO L124 PetriNetUnfolderBase]: 12/170 cut-off events. [2023-11-06 22:06:35,095 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:06:35,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 170 events. 12/170 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2023-11-06 22:06:35,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 174 transitions, 376 flow [2023-11-06 22:06:35,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 157 transitions, 338 flow [2023-11-06 22:06:35,115 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:06:35,134 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 157 transitions, 338 flow [2023-11-06 22:06:35,138 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 157 transitions, 338 flow [2023-11-06 22:06:35,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 157 transitions, 338 flow [2023-11-06 22:06:35,196 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-11-06 22:06:35,196 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:06:35,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 157 events. 12/157 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2023-11-06 22:06:35,201 INFO L119 LiptonReduction]: Number of co-enabled transitions 2548 [2023-11-06 22:06:42,896 INFO L134 LiptonReduction]: Checked pairs total: 3715 [2023-11-06 22:06:42,897 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-11-06 22:06:42,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:06:42,939 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=LoopsAndPotentialCycles, 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;@462524b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:06:42,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 22:06:42,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:06:42,948 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-11-06 22:06:42,949 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:06:42,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:42,950 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-06 22:06:42,950 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-06 22:06:42,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2023207393, now seen corresponding path program 1 times [2023-11-06 22:06:42,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887797053] [2023-11-06 22:06:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887797053] [2023-11-06 22:06:43,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887797053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082601507] [2023-11-06 22:06:43,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:43,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:43,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 318 [2023-11-06 22:06:43,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:43,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:43,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 318 [2023-11-06 22:06:43,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:43,987 INFO L124 PetriNetUnfolderBase]: 1426/1904 cut-off events. [2023-11-06 22:06:43,988 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-06 22:06:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 1904 events. 1426/1904 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7105 event pairs, 769 based on Foata normal form. 0/1426 useless extension candidates. Maximal degree in co-relation 3512. Up to 1560 conditions per place. [2023-11-06 22:06:44,008 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-11-06 22:06:44,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-11-06 22:06:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:06:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:06:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2023-11-06 22:06:44,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2023-11-06 22:06:44,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 630 transitions. [2023-11-06 22:06:44,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 630 transitions. [2023-11-06 22:06:44,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:44,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 630 transitions. [2023-11-06 22:06:44,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,051 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,053 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 630 transitions. [2023-11-06 22:06:44,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-11-06 22:06:44,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 22:06:44,064 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-11-06 22:06:44,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-11-06 22:06:44,070 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-06 22:06:44,070 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-11-06 22:06:44,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:44,071 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-06 22:06:44,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:06:44,072 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-06 22:06:44,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash -460981397, now seen corresponding path program 1 times [2023-11-06 22:06:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207114408] [2023-11-06 22:06:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:44,273 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-06 22:06:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207114408] [2023-11-06 22:06:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207114408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:44,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096714653] [2023-11-06 22:06:44,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:44,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:44,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:44,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 318 [2023-11-06 22:06:44,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:44,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 318 [2023-11-06 22:06:44,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:44,699 INFO L124 PetriNetUnfolderBase]: 1718/2336 cut-off events. [2023-11-06 22:06:44,699 INFO L125 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2023-11-06 22:06:44,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8133 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 1800. Up to 1790 conditions per place. [2023-11-06 22:06:44,719 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-11-06 22:06:44,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-11-06 22:06:44,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:06:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:06:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 633 transitions. [2023-11-06 22:06:44,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49764150943396224 [2023-11-06 22:06:44,724 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 633 transitions. [2023-11-06 22:06:44,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 633 transitions. [2023-11-06 22:06:44,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:44,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 633 transitions. [2023-11-06 22:06:44,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,733 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,733 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 633 transitions. [2023-11-06 22:06:44,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-11-06 22:06:44,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:44,737 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-11-06 22:06:44,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-06 22:06:44,738 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-06 22:06:44,738 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-11-06 22:06:44,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:44,739 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, 1] [2023-11-06 22:06:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:06:44,740 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-06 22:06:44,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1662630820, now seen corresponding path program 1 times [2023-11-06 22:06:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883172840] [2023-11-06 22:06:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883172840] [2023-11-06 22:06:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883172840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:06:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849530898] [2023-11-06 22:06:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:44,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:06:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:44,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:06:44,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:06:44,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 318 [2023-11-06 22:06:44,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:44,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:44,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 318 [2023-11-06 22:06:44,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:45,275 INFO L124 PetriNetUnfolderBase]: 1632/2230 cut-off events. [2023-11-06 22:06:45,275 INFO L125 PetriNetUnfolderBase]: For 536/688 co-relation queries the response was YES. [2023-11-06 22:06:45,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 2230 events. 1632/2230 cut-off events. For 536/688 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8433 event pairs, 977 based on Foata normal form. 152/1983 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-11-06 22:06:45,294 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-11-06 22:06:45,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-11-06 22:06:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:06:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:06:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2023-11-06 22:06:45,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2023-11-06 22:06:45,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 630 transitions. [2023-11-06 22:06:45,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 630 transitions. [2023-11-06 22:06:45,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:45,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 630 transitions. [2023-11-06 22:06:45,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,306 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,306 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 630 transitions. [2023-11-06 22:06:45,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-11-06 22:06:45,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:45,309 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-11-06 22:06:45,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-06 22:06:45,310 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 22:06:45,311 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-11-06 22:06:45,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:45,312 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, 1, 1] [2023-11-06 22:06:45,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:06:45,312 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-06 22:06:45,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash -672595191, now seen corresponding path program 1 times [2023-11-06 22:06:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851158404] [2023-11-06 22:06:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:06:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851158404] [2023-11-06 22:06:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851158404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:06:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:06:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:06:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393798390] [2023-11-06 22:06:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:06:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:06:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:06:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:06:45,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 318 [2023-11-06 22:06:45,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:45,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 318 [2023-11-06 22:06:45,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:06:45,844 INFO L124 PetriNetUnfolderBase]: 1632/2231 cut-off events. [2023-11-06 22:06:45,844 INFO L125 PetriNetUnfolderBase]: For 874/1026 co-relation queries the response was YES. [2023-11-06 22:06:45,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 2231 events. 1632/2231 cut-off events. For 874/1026 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8195 event pairs, 1243 based on Foata normal form. 152/1980 useless extension candidates. Maximal degree in co-relation 1879. Up to 2223 conditions per place. [2023-11-06 22:06:45,863 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-06 22:06:45,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-11-06 22:06:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:06:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:06:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-11-06 22:06:45,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4863731656184486 [2023-11-06 22:06:45,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-11-06 22:06:45,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-11-06 22:06:45,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:06:45,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-11-06 22:06:45,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,872 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 464 transitions. [2023-11-06 22:06:45,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-11-06 22:06:45,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:06:45,876 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-11-06 22:06:45,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-06 22:06:45,877 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-06 22:06:45,878 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-11-06 22:06:45,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:45,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:06:45,879 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, 1, 1, 1] [2023-11-06 22:06:45,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:06:45,879 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-06 22:06:45,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash 673826750, now seen corresponding path program 1 times [2023-11-06 22:06:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282167590] [2023-11-06 22:06:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:06:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:46,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282167590] [2023-11-06 22:06:46,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282167590] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:46,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662902616] [2023-11-06 22:06:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:46,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:46,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:06:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:46,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:06:46,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:47,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:47,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:06:47,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2023-11-06 22:06:47,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:47,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:47,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-11-06 22:06:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:06:47,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:49,787 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) (.cse10 (+ c_~min~0 1))) (and (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse4 (select .cse3 c_~A~0.base))) (let ((.cse2 (select .cse4 .cse5))) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse0 (select .cse4 c_~A~0.offset)) (.cse1 (select (select (store (store .cse3 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ .cse0 1)) (< 2147483645 .cse1) (< .cse0 (+ .cse1 1)) (< .cse2 (+ .cse1 3))))) (< c_~min~0 .cse2)))))) (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse9 (select .cse8 c_~A~0.base))) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse6 (select .cse9 c_~A~0.offset)) (.cse7 (select (select (store (store .cse8 c_~A~0.base (store .cse9 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ .cse6 1)) (< 2147483645 .cse7) (< c_~min~0 (+ .cse7 3)) (< .cse6 (+ .cse7 1))))) (< (select .cse9 .cse5) .cse10))))) (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse12 (select .cse14 c_~A~0.base))) (let ((.cse11 (select .cse12 .cse5))) (or (< c_~min~0 .cse11) (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse14 c_~A~0.base (store .cse12 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ (select .cse12 c_~A~0.offset) 1)) (< .cse11 (+ 2 .cse13)) (< 2147483646 .cse13))))))))) (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse15 (select .cse17 c_~A~0.base))) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 c_~A~0.base (store .cse15 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ (select .cse15 c_~A~0.offset) 1)) (< c_~min~0 (+ 2 .cse16)) (< 2147483646 .cse16)))) (< (select .cse15 .cse5) .cse10))))))) is different from false [2023-11-06 22:06:49,923 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~min~0 1))) (and (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse4 (select .cse3 c_~A~0.base))) (let ((.cse0 (select .cse4 c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse3 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ .cse0 1)) (< 2147483645 .cse2) (< c_~min~0 (+ .cse2 3)))))))))) (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse8 (select .cse7 c_~A~0.base))) (let ((.cse5 (select .cse8 c_~A~0.offset))) (or (< c_~min~0 .cse5) (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 c_~A~0.base (store .cse8 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 (+ .cse6 3)) (< v_ArrVal_123 (+ .cse5 1)) (< 2147483645 .cse6))))))))) (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse12 (select .cse11 c_~A~0.base))) (let ((.cse9 (select .cse12 c_~A~0.offset))) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse11 c_~A~0.base (store .cse12 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ .cse9 1)) (< c_~min~0 (+ 2 .cse10)) (< 2147483646 .cse10)))) (< .cse9 .cse1)))))) (forall ((v_ArrVal_121 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_121))) (let ((.cse16 (select .cse15 c_~A~0.base))) (let ((.cse13 (select .cse16 c_~A~0.offset))) (or (forall ((v_ArrVal_123 Int) (v_ArrVal_124 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse15 c_~A~0.base (store .cse16 c_~A~0.offset v_ArrVal_123)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_124) c_~A~0.base) c_~A~0.offset))) (or (< v_ArrVal_123 (+ .cse13 1)) (< .cse13 (+ 2 .cse14)) (< 2147483646 .cse14)))) (< c_~min~0 .cse13)))))))) is different from false [2023-11-06 22:06:50,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2023-11-06 22:06:50,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2023-11-06 22:06:50,117 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2023-11-06 22:06:50,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:06:50,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2023-11-06 22:06:50,165 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2023-11-06 22:06:50,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:06:50,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2023-11-06 22:06:50,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:06:50,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2023-11-06 22:06:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:06:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662902616] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:52,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:52,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 33 [2023-11-06 22:06:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622691360] [2023-11-06 22:06:52,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:52,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:06:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:52,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:06:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=860, Unknown=29, NotChecked=126, Total=1190 [2023-11-06 22:06:52,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 318 [2023-11-06 22:06:52,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 35 states, 35 states have (on average 106.65714285714286) internal successors, (3733), 35 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:06:52,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:06:52,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 318 [2023-11-06 22:06:52,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:11,983 INFO L124 PetriNetUnfolderBase]: 19724/27069 cut-off events. [2023-11-06 22:07:11,983 INFO L125 PetriNetUnfolderBase]: For 7450/7450 co-relation queries the response was YES. [2023-11-06 22:07:12,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69912 conditions, 27069 events. 19724/27069 cut-off events. For 7450/7450 co-relation queries the response was YES. Maximal size of possible extension queue 965. Compared 149859 event pairs, 1152 based on Foata normal form. 14/21384 useless extension candidates. Maximal degree in co-relation 69898. Up to 5877 conditions per place. [2023-11-06 22:07:12,113 INFO L140 encePairwiseOnDemand]: 304/318 looper letters, 431 selfloop transitions, 120 changer transitions 514/1065 dead transitions. [2023-11-06 22:07:12,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 1065 transitions, 5309 flow [2023-11-06 22:07:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-06 22:07:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-11-06 22:07:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 7944 transitions. [2023-11-06 22:07:12,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37285271754435373 [2023-11-06 22:07:12,145 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 7944 transitions. [2023-11-06 22:07:12,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 7944 transitions. [2023-11-06 22:07:12,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:12,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 7944 transitions. [2023-11-06 22:07:12,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 118.56716417910448) internal successors, (7944), 67 states have internal predecessors, (7944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:12,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 318.0) internal successors, (21624), 68 states have internal predecessors, (21624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:12,221 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 318.0) internal successors, (21624), 68 states have internal predecessors, (21624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:12,222 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 67 states and 7944 transitions. [2023-11-06 22:07:12,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 1065 transitions, 5309 flow [2023-11-06 22:07:12,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 1065 transitions, 5305 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:07:12,436 INFO L231 Difference]: Finished difference. Result has 167 places, 176 transitions, 1329 flow [2023-11-06 22:07:12,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=1329, PETRI_PLACES=167, PETRI_TRANSITIONS=176} [2023-11-06 22:07:12,438 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2023-11-06 22:07:12,438 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 176 transitions, 1329 flow [2023-11-06 22:07:12,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 106.65714285714286) internal successors, (3733), 35 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:12,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:12,440 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, 1, 1, 1] [2023-11-06 22:07:12,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:07:12,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:12,646 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-06 22:07:12,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 237498856, now seen corresponding path program 2 times [2023-11-06 22:07:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035489903] [2023-11-06 22:07:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:07:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:12,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035489903] [2023-11-06 22:07:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035489903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453738760] [2023-11-06 22:07:12,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:07:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:12,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:12,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:13,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:07:13,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:07:13,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:07:13,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:07:13,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:07:13,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:07:13,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453738760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:07:13,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:07:13,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-06 22:07:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766859540] [2023-11-06 22:07:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:07:13,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:07:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:07:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:07:13,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 318 [2023-11-06 22:07:13,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 176 transitions, 1329 flow. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:13,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:13,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 318 [2023-11-06 22:07:13,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:18,014 INFO L124 PetriNetUnfolderBase]: 16175/22432 cut-off events. [2023-11-06 22:07:18,014 INFO L125 PetriNetUnfolderBase]: For 943641/946380 co-relation queries the response was YES. [2023-11-06 22:07:18,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169952 conditions, 22432 events. 16175/22432 cut-off events. For 943641/946380 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 127048 event pairs, 2840 based on Foata normal form. 1579/22184 useless extension candidates. Maximal degree in co-relation 169871. Up to 12976 conditions per place. [2023-11-06 22:07:18,303 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 150 selfloop transitions, 6 changer transitions 311/470 dead transitions. [2023-11-06 22:07:18,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 470 transitions, 4558 flow [2023-11-06 22:07:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:07:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:07:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 812 transitions. [2023-11-06 22:07:18,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106918238993711 [2023-11-06 22:07:18,312 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 812 transitions. [2023-11-06 22:07:18,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 812 transitions. [2023-11-06 22:07:18,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:07:18,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 812 transitions. [2023-11-06 22:07:18,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:18,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:18,323 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:18,323 INFO L175 Difference]: Start difference. First operand has 167 places, 176 transitions, 1329 flow. Second operand 5 states and 812 transitions. [2023-11-06 22:07:18,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 470 transitions, 4558 flow [2023-11-06 22:07:24,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 470 transitions, 4243 flow, removed 156 selfloop flow, removed 30 redundant places. [2023-11-06 22:07:24,713 INFO L231 Difference]: Finished difference. Result has 111 places, 116 transitions, 818 flow [2023-11-06 22:07:24,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=818, PETRI_PLACES=111, PETRI_TRANSITIONS=116} [2023-11-06 22:07:24,715 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-11-06 22:07:24,715 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 116 transitions, 818 flow [2023-11-06 22:07:24,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:24,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:07:24,716 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, 1, 1, 1] [2023-11-06 22:07:24,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:07:24,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:07:24,917 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-06 22:07:24,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:07:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash -514433478, now seen corresponding path program 3 times [2023-11-06 22:07:24,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:07:24,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550083376] [2023-11-06 22:07:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:07:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:07:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:07:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:07:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:07:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550083376] [2023-11-06 22:07:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550083376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:07:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099375438] [2023-11-06 22:07:25,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:07:25,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:07:25,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:07:25,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:07:25,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:07:26,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 22:07:26,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:07:26,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:07:26,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:07:26,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:26,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:07:26,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:07:26,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:26,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:07:26,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:07:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:07:26,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:26,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_216) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) is different from false [2023-11-06 22:07:29,145 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_214 Int) (v_ArrVal_216 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_214)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_216) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0)) (< v_ArrVal_214 (+ (select .cse1 c_~A~0.offset) 1)))))) is different from false [2023-11-06 22:07:29,212 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_214 Int) (v_ArrVal_216 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_214)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_216) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse0 2)) (< 2147483646 .cse0) (< v_ArrVal_214 (+ (select .cse1 c_~A~0.offset) 1))))))) is different from false [2023-11-06 22:07:29,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 120 [2023-11-06 22:07:29,810 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2023-11-06 22:07:29,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 22:07:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-06 22:07:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099375438] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:29,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 32 [2023-11-06 22:07:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392388280] [2023-11-06 22:07:29,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:29,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 22:07:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:29,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 22:07:29,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=772, Unknown=11, NotChecked=180, Total=1122 [2023-11-06 22:07:30,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 318 [2023-11-06 22:07:30,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 116 transitions, 818 flow. Second operand has 34 states, 34 states have (on average 106.55882352941177) internal successors, (3623), 34 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:07:30,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:07:30,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 318 [2023-11-06 22:07:30,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:07:41,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:07:43,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:07:57,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:03,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:07,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:09,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:11,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:15,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:17,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:19,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:23,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:25,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:27,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:30,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:33,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:35,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:37,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:40,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:42,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:44,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:48,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:53,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:56,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:08:58,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:09:00,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:09:02,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:09:03,712 INFO L124 PetriNetUnfolderBase]: 26153/35858 cut-off events. [2023-11-06 22:09:03,712 INFO L125 PetriNetUnfolderBase]: For 914707/914707 co-relation queries the response was YES. [2023-11-06 22:09:03,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243108 conditions, 35858 events. 26153/35858 cut-off events. For 914707/914707 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 204034 event pairs, 2116 based on Foata normal form. 15/33437 useless extension candidates. Maximal degree in co-relation 243053. Up to 8848 conditions per place. [2023-11-06 22:09:04,124 INFO L140 encePairwiseOnDemand]: 298/318 looper letters, 427 selfloop transitions, 160 changer transitions 306/893 dead transitions. [2023-11-06 22:09:04,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 893 transitions, 9295 flow [2023-11-06 22:09:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-06 22:09:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-06 22:09:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 5209 transitions. [2023-11-06 22:09:04,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.372284162378502 [2023-11-06 22:09:04,146 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 5209 transitions. [2023-11-06 22:09:04,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 5209 transitions. [2023-11-06 22:09:04,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:04,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 5209 transitions. [2023-11-06 22:09:04,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 118.38636363636364) internal successors, (5209), 44 states have internal predecessors, (5209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:04,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 318.0) internal successors, (14310), 45 states have internal predecessors, (14310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:04,213 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 318.0) internal successors, (14310), 45 states have internal predecessors, (14310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:04,213 INFO L175 Difference]: Start difference. First operand has 111 places, 116 transitions, 818 flow. Second operand 44 states and 5209 transitions. [2023-11-06 22:09:04,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 893 transitions, 9295 flow [2023-11-06 22:09:10,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 893 transitions, 7911 flow, removed 663 selfloop flow, removed 15 redundant places. [2023-11-06 22:09:10,679 INFO L231 Difference]: Finished difference. Result has 147 places, 231 transitions, 2345 flow [2023-11-06 22:09:10,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2345, PETRI_PLACES=147, PETRI_TRANSITIONS=231} [2023-11-06 22:09:10,681 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2023-11-06 22:09:10,681 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 231 transitions, 2345 flow [2023-11-06 22:09:10,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 106.55882352941177) internal successors, (3623), 34 states have internal predecessors, (3623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:10,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:10,683 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, 1, 1, 1] [2023-11-06 22:09:10,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:10,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:09:10,889 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-06 22:09:10,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1716971778, now seen corresponding path program 4 times [2023-11-06 22:09:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910389906] [2023-11-06 22:09:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:09:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910389906] [2023-11-06 22:09:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910389906] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656559377] [2023-11-06 22:09:11,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:09:11,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:11,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:11,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:09:11,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:09:11,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:09:11,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:09:11,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:12,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:12,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:09:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:09:12,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:09:12,308 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:12,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 38 [2023-11-06 22:09:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:09:12,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:12,944 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0)) (forall ((thread2Thread1of1ForFork3_~i~1 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread2Thread1of1ForFork3_~i~1 4))))) (or (< 2147483645 .cse1) (< c_~min~0 (+ .cse1 3))))))))) (forall ((thread2Thread1of1ForFork3_~i~1 Int) (v_ArrVal_262 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* thread2Thread1of1ForFork3_~i~1 4))))) (or (< .cse3 (select .cse4 c_~A~0.offset)) (< c_~min~0 (+ .cse3 2)) (< 2147483646 .cse3)))))) is different from false [2023-11-06 22:09:14,423 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:14,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1624 treesize of output 1532 [2023-11-06 22:09:14,635 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:14,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 862 treesize of output 851 [2023-11-06 22:09:14,748 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:14,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 842 treesize of output 811 [2023-11-06 22:09:14,851 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:14,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 802 treesize of output 795 [2023-11-06 22:09:14,951 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:14,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 786 treesize of output 763 [2023-11-06 22:09:15,073 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:15,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 754 treesize of output 743 [2023-11-06 22:09:15,192 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:15,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 734 treesize of output 703 [2023-11-06 22:09:15,310 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:15,311 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 694 treesize of output 671 [2023-11-06 22:09:15,424 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:09:15,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 662 treesize of output 655 [2023-11-06 22:09:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:09:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656559377] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:22,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:22,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 21 [2023-11-06 22:09:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371063600] [2023-11-06 22:09:22,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:22,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:09:22,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:09:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=379, Unknown=7, NotChecked=40, Total=506 [2023-11-06 22:09:24,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 318 [2023-11-06 22:09:24,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 231 transitions, 2345 flow. Second operand has 23 states, 23 states have (on average 125.6086956521739) internal successors, (2889), 23 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:24,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:24,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 318 [2023-11-06 22:09:24,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:35,189 INFO L124 PetriNetUnfolderBase]: 32550/44997 cut-off events. [2023-11-06 22:09:35,189 INFO L125 PetriNetUnfolderBase]: For 1102542/1104154 co-relation queries the response was YES. [2023-11-06 22:09:35,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348830 conditions, 44997 events. 32550/44997 cut-off events. For 1102542/1104154 co-relation queries the response was YES. Maximal size of possible extension queue 1688. Compared 272100 event pairs, 7156 based on Foata normal form. 899/45356 useless extension candidates. Maximal degree in co-relation 348764. Up to 26591 conditions per place. [2023-11-06 22:09:35,641 INFO L140 encePairwiseOnDemand]: 309/318 looper letters, 354 selfloop transitions, 39 changer transitions 316/724 dead transitions. [2023-11-06 22:09:35,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 724 transitions, 9116 flow [2023-11-06 22:09:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:09:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:09:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1480 transitions. [2023-11-06 22:09:35,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4230989136649514 [2023-11-06 22:09:35,647 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1480 transitions. [2023-11-06 22:09:35,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1480 transitions. [2023-11-06 22:09:35,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:35,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1480 transitions. [2023-11-06 22:09:35,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.54545454545453) internal successors, (1480), 11 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:35,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 318.0) internal successors, (3816), 12 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:35,659 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 318.0) internal successors, (3816), 12 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:35,659 INFO L175 Difference]: Start difference. First operand has 147 places, 231 transitions, 2345 flow. Second operand 11 states and 1480 transitions. [2023-11-06 22:09:35,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 724 transitions, 9116 flow [2023-11-06 22:09:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 724 transitions, 8511 flow, removed 226 selfloop flow, removed 16 redundant places. [2023-11-06 22:09:48,808 INFO L231 Difference]: Finished difference. Result has 137 places, 264 transitions, 2681 flow [2023-11-06 22:09:48,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2681, PETRI_PLACES=137, PETRI_TRANSITIONS=264} [2023-11-06 22:09:48,809 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2023-11-06 22:09:48,809 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 264 transitions, 2681 flow [2023-11-06 22:09:48,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 125.6086956521739) internal successors, (2889), 23 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:48,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:09:48,810 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, 1, 1, 1] [2023-11-06 22:09:48,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:49,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:49,016 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-06 22:09:49,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 629731122, now seen corresponding path program 5 times [2023-11-06 22:09:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439088196] [2023-11-06 22:09:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:09:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439088196] [2023-11-06 22:09:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439088196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:09:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619782090] [2023-11-06 22:09:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:09:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:09:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:09:49,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 318 [2023-11-06 22:09:49,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 264 transitions, 2681 flow. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:49,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:09:49,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 318 [2023-11-06 22:09:49,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:09:57,376 INFO L124 PetriNetUnfolderBase]: 30502/42796 cut-off events. [2023-11-06 22:09:57,377 INFO L125 PetriNetUnfolderBase]: For 788536/789898 co-relation queries the response was YES. [2023-11-06 22:09:57,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304019 conditions, 42796 events. 30502/42796 cut-off events. For 788536/789898 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 264387 event pairs, 6657 based on Foata normal form. 825/43163 useless extension candidates. Maximal degree in co-relation 303954. Up to 31689 conditions per place. [2023-11-06 22:09:57,960 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 262 selfloop transitions, 10 changer transitions 206/493 dead transitions. [2023-11-06 22:09:57,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 493 transitions, 5941 flow [2023-11-06 22:09:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:09:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:09:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2023-11-06 22:09:57,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069182389937107 [2023-11-06 22:09:57,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2023-11-06 22:09:57,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2023-11-06 22:09:57,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:09:57,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2023-11-06 22:09:57,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:57,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:57,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:57,968 INFO L175 Difference]: Start difference. First operand has 137 places, 264 transitions, 2681 flow. Second operand 5 states and 806 transitions. [2023-11-06 22:09:57,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 493 transitions, 5941 flow [2023-11-06 22:10:05,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 493 transitions, 5810 flow, removed 64 selfloop flow, removed 5 redundant places. [2023-11-06 22:10:05,744 INFO L231 Difference]: Finished difference. Result has 135 places, 255 transitions, 2558 flow [2023-11-06 22:10:05,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=2610, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2558, PETRI_PLACES=135, PETRI_TRANSITIONS=255} [2023-11-06 22:10:05,745 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 95 predicate places. [2023-11-06 22:10:05,746 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 255 transitions, 2558 flow [2023-11-06 22:10:05,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:05,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:05,746 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, 1, 1, 1] [2023-11-06 22:10:05,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:10:05,746 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-06 22:10:05,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:05,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1804506586, now seen corresponding path program 6 times [2023-11-06 22:10:05,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:05,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227388205] [2023-11-06 22:10:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:10:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227388205] [2023-11-06 22:10:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227388205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:10:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501910948] [2023-11-06 22:10:06,557 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:10:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:06,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:06,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc765be-3fa5-4838-842e-46cfda9e0426/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:10:06,797 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-06 22:10:06,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:06,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-06 22:10:06,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:07,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:07,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:07,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:07,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:07,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:10:07,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:10:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:10:07,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:10,709 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_330 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_330))) (or (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_331) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ .cse0 2))))) (< (select (select .cse1 c_~A~0.base) c_~A~0.offset) (+ c_~min~0 1))))) (forall ((v_ArrVal_330 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_330))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_331) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse3) (< .cse2 (+ .cse3 2)))))))))) is different from false [2023-11-06 22:10:10,813 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_329 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_330))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_331) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< .cse1 (+ 2 .cse0))))) (< c_~min~0 .cse1))))) (forall ((v_ArrVal_329 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_330))) (or (forall ((v_ArrVal_331 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_331) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse3)) (< 2147483646 .cse3)))) (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) (+ c_~min~0 1)))))) is different from false [2023-11-06 22:10:10,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 718 treesize of output 662 [2023-11-06 22:10:10,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 175 [2023-11-06 22:10:10,866 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2023-11-06 22:10:10,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 105 [2023-11-06 22:10:11,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:11,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 146 [2023-11-06 22:10:11,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122 [2023-11-06 22:10:11,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2023-11-06 22:10:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:10:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501910948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:10:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 31 [2023-11-06 22:10:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044731377] [2023-11-06 22:10:17,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:17,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:10:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:10:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=753, Unknown=10, NotChecked=118, Total=1056 [2023-11-06 22:10:17,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 318 [2023-11-06 22:10:17,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 255 transitions, 2558 flow. Second operand has 33 states, 33 states have (on average 109.72727272727273) internal successors, (3621), 33 states have internal predecessors, (3621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:17,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:17,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 318 [2023-11-06 22:10:17,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:27,251 INFO L124 PetriNetUnfolderBase]: 26766/37381 cut-off events. [2023-11-06 22:10:27,251 INFO L125 PetriNetUnfolderBase]: For 791507/792987 co-relation queries the response was YES. [2023-11-06 22:10:27,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276057 conditions, 37381 events. 26766/37381 cut-off events. For 791507/792987 co-relation queries the response was YES. Maximal size of possible extension queue 1531. Compared 226996 event pairs, 1058 based on Foata normal form. 763/35205 useless extension candidates. Maximal degree in co-relation 275993. Up to 21649 conditions per place. [2023-11-06 22:10:27,531 INFO L140 encePairwiseOnDemand]: 307/318 looper letters, 163 selfloop transitions, 79 changer transitions 626/879 dead transitions. [2023-11-06 22:10:27,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 879 transitions, 10666 flow [2023-11-06 22:10:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-06 22:10:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-06 22:10:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3556 transitions. [2023-11-06 22:10:27,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37274633123689727 [2023-11-06 22:10:27,539 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3556 transitions. [2023-11-06 22:10:27,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3556 transitions. [2023-11-06 22:10:27,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:27,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3556 transitions. [2023-11-06 22:10:27,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 118.53333333333333) internal successors, (3556), 30 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:27,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 318.0) internal successors, (9858), 31 states have internal predecessors, (9858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:27,563 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 318.0) internal successors, (9858), 31 states have internal predecessors, (9858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:27,563 INFO L175 Difference]: Start difference. First operand has 135 places, 255 transitions, 2558 flow. Second operand 30 states and 3556 transitions. [2023-11-06 22:10:27,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 879 transitions, 10666 flow