./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc --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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:52:45,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:45,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:45,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:45,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:45,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:45,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:45,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:45,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:45,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:45,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:45,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:45,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:45,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:45,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:45,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:45,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:45,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:45,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:45,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:45,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:45,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:45,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:45,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:45,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:45,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:45,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:45,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:45,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:45,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:45,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:45,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:45,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:45,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:45,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:45,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:45,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:45,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:45,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:45,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:45,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:45,472 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:52:45,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:45,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:45,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:45,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:45,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:52:45,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:52:45,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:45,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:45,499 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:45,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:45,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:45,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:45,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:45,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:45,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:52:45,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:52:45,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:52:45,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:45,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:52:45,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:45,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:52:45,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:45,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:45,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:52:45,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:45,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:45,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:52:45,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:52:45,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:45,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:52:45,506 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:52:45,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:52:45,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:52:45,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/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_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-11-02 20:52:45,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:45,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:45,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:45,806 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:45,807 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:45,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-02 20:52:45,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/data/2585f945e/68a5b8a5c0384109bd6e426e99b294e1/FLAG7af2e55d0 [2022-11-02 20:52:46,310 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:46,311 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-02 20:52:46,319 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/data/2585f945e/68a5b8a5c0384109bd6e426e99b294e1/FLAG7af2e55d0 [2022-11-02 20:52:46,689 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/data/2585f945e/68a5b8a5c0384109bd6e426e99b294e1 [2022-11-02 20:52:46,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:46,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:46,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:46,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:46,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:46,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:46" (1/1) ... [2022-11-02 20:52:46,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350cecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:46, skipping insertion in model container [2022-11-02 20:52:46,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:46" (1/1) ... [2022-11-02 20:52:46,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:46,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:47,003 WARN L230 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_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-02 20:52:47,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:47,031 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:47,069 WARN L230 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_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-02 20:52:47,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:47,086 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:47,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47 WrapperNode [2022-11-02 20:52:47,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:47,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:47,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:47,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:47,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,153 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-11-02 20:52:47,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:47,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:47,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:47,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:47,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:47,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:47,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:47,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:47,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (1/1) ... [2022-11-02 20:52:47,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:47,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:47,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:52:47,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:52:47,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:52:47,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:52:47,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:52:47,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:52:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:52:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:52:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:52:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:52:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:52:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:47,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:52:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:52:47,304 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:52:47,463 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:47,465 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:47,803 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:47,890 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:47,891 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:52:47,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:47 BoogieIcfgContainer [2022-11-02 20:52:47,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:47,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:52:47,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:52:47,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:52:47,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:52:46" (1/3) ... [2022-11-02 20:52:47,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8826fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:47, skipping insertion in model container [2022-11-02 20:52:47,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:47" (2/3) ... [2022-11-02 20:52:47,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8826fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:47, skipping insertion in model container [2022-11-02 20:52:47,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:47" (3/3) ... [2022-11-02 20:52:47,915 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-02 20:52:47,926 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:52:47,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:52:47,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:52:47,936 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:52:48,032 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:52:48,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-11-02 20:52:48,145 INFO L130 PetriNetUnfolder]: 13/156 cut-off events. [2022-11-02 20:52:48,146 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:52:48,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-02 20:52:48,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2022-11-02 20:52:48,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2022-11-02 20:52:48,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:48,175 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;@4edbf7c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:48,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 20:52:48,244 INFO L130 PetriNetUnfolder]: 13/144 cut-off events. [2022-11-02 20:52:48,245 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:52:48,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:48,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:48,246 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 1 more)] === [2022-11-02 20:52:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 281922780, now seen corresponding path program 1 times [2022-11-02 20:52:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:48,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867340441] [2022-11-02 20:52:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:48,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867340441] [2022-11-02 20:52:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867340441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:52:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307815527] [2022-11-02 20:52:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:52:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:52:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:52:48,646 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2022-11-02 20:52:48,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 308 flow. Second operand has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:48,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:48,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2022-11-02 20:52:48,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:48,755 INFO L130 PetriNetUnfolder]: 42/270 cut-off events. [2022-11-02 20:52:48,755 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-11-02 20:52:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 270 events. 42/270 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 713 event pairs, 15 based on Foata normal form. 42/281 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-02 20:52:48,760 INFO L137 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2022-11-02 20:52:48,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2022-11-02 20:52:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:52:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:52:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-11-02 20:52:48,775 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2022-11-02 20:52:48,775 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-11-02 20:52:48,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-11-02 20:52:48,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:48,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-11-02 20:52:48,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:48,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:48,790 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:48,792 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2022-11-02 20:52:48,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2022-11-02 20:52:48,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:52:48,800 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2022-11-02 20:52:48,803 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2022-11-02 20:52:48,806 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-11-02 20:52:48,806 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2022-11-02 20:52:48,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:48,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:48,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:52:48,808 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 1 more)] === [2022-11-02 20:52:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 811959335, now seen corresponding path program 1 times [2022-11-02 20:52:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:48,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189585996] [2022-11-02 20:52:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:49,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189585996] [2022-11-02 20:52:49,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189585996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:49,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:49,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:52:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452151891] [2022-11-02 20:52:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:49,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:49,570 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 159 [2022-11-02 20:52:49,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 272 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:49,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 159 [2022-11-02 20:52:49,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:49,966 INFO L130 PetriNetUnfolder]: 296/684 cut-off events. [2022-11-02 20:52:49,966 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-02 20:52:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 684 events. 296/684 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2941 event pairs, 167 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 1140. Up to 421 conditions per place. [2022-11-02 20:52:49,973 INFO L137 encePairwiseOnDemand]: 149/159 looper letters, 44 selfloop transitions, 6 changer transitions 4/141 dead transitions. [2022-11-02 20:52:49,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 396 flow [2022-11-02 20:52:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:52:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 855 transitions. [2022-11-02 20:52:49,979 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6721698113207547 [2022-11-02 20:52:49,979 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 855 transitions. [2022-11-02 20:52:49,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 855 transitions. [2022-11-02 20:52:49,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:49,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 855 transitions. [2022-11-02 20:52:49,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,989 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,989 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 8 states and 855 transitions. [2022-11-02 20:52:49,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 396 flow [2022-11-02 20:52:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:52:49,994 INFO L231 Difference]: Finished difference. Result has 144 places, 134 transitions, 300 flow [2022-11-02 20:52:49,994 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=144, PETRI_TRANSITIONS=134} [2022-11-02 20:52:49,995 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-11-02 20:52:49,995 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 134 transitions, 300 flow [2022-11-02 20:52:49,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:49,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:49,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:52:49,997 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 1 more)] === [2022-11-02 20:52:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1679007102, now seen corresponding path program 1 times [2022-11-02 20:52:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:49,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26145149] [2022-11-02 20:52:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:50,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26145149] [2022-11-02 20:52:50,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26145149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:50,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769634357] [2022-11-02 20:52:50,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:50,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:50,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:50,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:50,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:52:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:52:50,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:50,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:50,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769634357] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:50,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:50,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-02 20:52:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968719284] [2022-11-02 20:52:50,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:50,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:50,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:50,823 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-11-02 20:52:50,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 134 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:50,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:50,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-11-02 20:52:50,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:51,088 INFO L130 PetriNetUnfolder]: 183/623 cut-off events. [2022-11-02 20:52:51,088 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-02 20:52:51,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 623 events. 183/623 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3092 event pairs, 80 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 941. Up to 141 conditions per place. [2022-11-02 20:52:51,094 INFO L137 encePairwiseOnDemand]: 151/159 looper letters, 33 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2022-11-02 20:52:51,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 398 flow [2022-11-02 20:52:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:52:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-11-02 20:52:51,097 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2022-11-02 20:52:51,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-11-02 20:52:51,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-11-02 20:52:51,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:51,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-11-02 20:52:51,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 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) [2022-11-02 20:52:51,105 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 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) [2022-11-02 20:52:51,105 INFO L175 Difference]: Start difference. First operand has 144 places, 134 transitions, 300 flow. Second operand 7 states and 873 transitions. [2022-11-02 20:52:51,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 398 flow [2022-11-02 20:52:51,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 380 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-02 20:52:51,110 INFO L231 Difference]: Finished difference. Result has 144 places, 136 transitions, 315 flow [2022-11-02 20:52:51,110 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=144, PETRI_TRANSITIONS=136} [2022-11-02 20:52:51,111 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-11-02 20:52:51,111 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 315 flow [2022-11-02 20:52:51,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:51,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:52:51,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:51,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:51,339 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 1 more)] === [2022-11-02 20:52:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1450995219, now seen corresponding path program 1 times [2022-11-02 20:52:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:51,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67654656] [2022-11-02 20:52:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:52:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:51,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67654656] [2022-11-02 20:52:51,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67654656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:51,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:51,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:51,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201843665] [2022-11-02 20:52:51,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:51,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:51,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:51,553 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 159 [2022-11-02 20:52:51,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:51,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 159 [2022-11-02 20:52:51,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:51,658 INFO L130 PetriNetUnfolder]: 43/307 cut-off events. [2022-11-02 20:52:51,658 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-02 20:52:51,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 307 events. 43/307 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 817 event pairs, 4 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 416. Up to 41 conditions per place. [2022-11-02 20:52:51,661 INFO L137 encePairwiseOnDemand]: 154/159 looper letters, 29 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2022-11-02 20:52:51,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 155 transitions, 428 flow [2022-11-02 20:52:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:52:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:52:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2022-11-02 20:52:51,666 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9040880503144654 [2022-11-02 20:52:51,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2022-11-02 20:52:51,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2022-11-02 20:52:51,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:51,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2022-11-02 20:52:51,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,671 INFO L175 Difference]: Start difference. First operand has 144 places, 136 transitions, 315 flow. Second operand 4 states and 575 transitions. [2022-11-02 20:52:51,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 155 transitions, 428 flow [2022-11-02 20:52:51,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 155 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:52:51,676 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 332 flow [2022-11-02 20:52:51,676 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2022-11-02 20:52:51,678 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-11-02 20:52:51,678 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 332 flow [2022-11-02 20:52:51,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:51,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:51,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:52:51,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:52:51,680 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 1 more)] === [2022-11-02 20:52:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1881460569, now seen corresponding path program 1 times [2022-11-02 20:52:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:51,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113909736] [2022-11-02 20:52:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:52:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:51,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113909736] [2022-11-02 20:52:51,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113909736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:51,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448658471] [2022-11-02 20:52:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:51,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:51,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:51,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:52:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:52,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:52:52,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:52:52,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:52:52,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448658471] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:52,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:52,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-02 20:52:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994402017] [2022-11-02 20:52:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:52,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:52,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:52,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:52,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:52:52,607 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2022-11-02 20:52:52,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 332 flow. Second operand has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:52,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:52,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2022-11-02 20:52:52,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:53,230 INFO L130 PetriNetUnfolder]: 958/1861 cut-off events. [2022-11-02 20:52:53,230 INFO L131 PetriNetUnfolder]: For 768/1051 co-relation queries the response was YES. [2022-11-02 20:52:53,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 1861 events. 958/1861 cut-off events. For 768/1051 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10863 event pairs, 261 based on Foata normal form. 283/1941 useless extension candidates. Maximal degree in co-relation 3882. Up to 439 conditions per place. [2022-11-02 20:52:53,245 INFO L137 encePairwiseOnDemand]: 148/159 looper letters, 89 selfloop transitions, 17 changer transitions 0/201 dead transitions. [2022-11-02 20:52:53,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 201 transitions, 731 flow [2022-11-02 20:52:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:52:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:52:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2022-11-02 20:52:53,249 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7587192681532304 [2022-11-02 20:52:53,249 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2022-11-02 20:52:53,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2022-11-02 20:52:53,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:53,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2022-11-02 20:52:53,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.63636363636364) internal successors, (1327), 11 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:53,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 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) [2022-11-02 20:52:53,257 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 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) [2022-11-02 20:52:53,257 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 332 flow. Second operand 11 states and 1327 transitions. [2022-11-02 20:52:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 201 transitions, 731 flow [2022-11-02 20:52:53,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 201 transitions, 731 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:52:53,262 INFO L231 Difference]: Finished difference. Result has 158 places, 150 transitions, 420 flow [2022-11-02 20:52:53,262 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=420, PETRI_PLACES=158, PETRI_TRANSITIONS=150} [2022-11-02 20:52:53,263 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 16 predicate places. [2022-11-02 20:52:53,263 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 150 transitions, 420 flow [2022-11-02 20:52:53,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:53,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:53,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:53,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:53,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:53,479 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 1 more)] === [2022-11-02 20:52:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -796614039, now seen corresponding path program 2 times [2022-11-02 20:52:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702848491] [2022-11-02 20:52:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:53,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:52:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:53,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702848491] [2022-11-02 20:52:53,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702848491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111921785] [2022-11-02 20:52:53,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:52:53,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:53,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:53,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:52:53,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:52:53,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:52:53,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:52:53,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:52:54,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:54,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111921785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:54,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:54,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-02 20:52:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905450156] [2022-11-02 20:52:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:54,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:54,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:54,139 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2022-11-02 20:52:54,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 150 transitions, 420 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:54,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:54,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2022-11-02 20:52:54,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:54,585 INFO L130 PetriNetUnfolder]: 664/1447 cut-off events. [2022-11-02 20:52:54,586 INFO L131 PetriNetUnfolder]: For 1082/1303 co-relation queries the response was YES. [2022-11-02 20:52:54,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 1447 events. 664/1447 cut-off events. For 1082/1303 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8219 event pairs, 200 based on Foata normal form. 258/1673 useless extension candidates. Maximal degree in co-relation 3467. Up to 592 conditions per place. [2022-11-02 20:52:54,601 INFO L137 encePairwiseOnDemand]: 150/159 looper letters, 53 selfloop transitions, 13 changer transitions 0/165 dead transitions. [2022-11-02 20:52:54,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 165 transitions, 616 flow [2022-11-02 20:52:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:52:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2022-11-02 20:52:54,604 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7114779874213837 [2022-11-02 20:52:54,604 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2022-11-02 20:52:54,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2022-11-02 20:52:54,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:54,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2022-11-02 20:52:54,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:54,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:54,610 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:54,610 INFO L175 Difference]: Start difference. First operand has 158 places, 150 transitions, 420 flow. Second operand 8 states and 905 transitions. [2022-11-02 20:52:54,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 165 transitions, 616 flow [2022-11-02 20:52:54,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 165 transitions, 607 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-11-02 20:52:54,619 INFO L231 Difference]: Finished difference. Result has 163 places, 153 transitions, 479 flow [2022-11-02 20:52:54,619 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=479, PETRI_PLACES=163, PETRI_TRANSITIONS=153} [2022-11-02 20:52:54,620 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 21 predicate places. [2022-11-02 20:52:54,620 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 153 transitions, 479 flow [2022-11-02 20:52:54,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:54,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:54,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:52:54,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:54,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:52:54,846 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 1 more)] === [2022-11-02 20:52:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1649673646, now seen corresponding path program 1 times [2022-11-02 20:52:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:54,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832658153] [2022-11-02 20:52:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:56,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832658153] [2022-11-02 20:52:56,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832658153] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:56,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771369070] [2022-11-02 20:52:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:56,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:56,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:56,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:56,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:52:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:52:56,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:58,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:52:58,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 43 [2022-11-02 20:52:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:59,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:00,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:00,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 93 [2022-11-02 20:53:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:02,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771369070] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:02,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:02,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 23] total 56 [2022-11-02 20:53:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292006279] [2022-11-02 20:53:02,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:02,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 20:53:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:02,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 20:53:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=2479, Unknown=0, NotChecked=0, Total=3080 [2022-11-02 20:53:02,101 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 159 [2022-11-02 20:53:02,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 153 transitions, 479 flow. Second operand has 56 states, 56 states have (on average 74.82142857142857) internal successors, (4190), 56 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:02,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:02,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 159 [2022-11-02 20:53:02,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:08,898 INFO L130 PetriNetUnfolder]: 4329/8635 cut-off events. [2022-11-02 20:53:08,898 INFO L131 PetriNetUnfolder]: For 8959/8995 co-relation queries the response was YES. [2022-11-02 20:53:08,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22782 conditions, 8635 events. 4329/8635 cut-off events. For 8959/8995 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 71041 event pairs, 270 based on Foata normal form. 4/8574 useless extension candidates. Maximal degree in co-relation 22766. Up to 2136 conditions per place. [2022-11-02 20:53:08,994 INFO L137 encePairwiseOnDemand]: 121/159 looper letters, 343 selfloop transitions, 165 changer transitions 18/590 dead transitions. [2022-11-02 20:53:08,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 590 transitions, 3377 flow [2022-11-02 20:53:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-02 20:53:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-11-02 20:53:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 4990 transitions. [2022-11-02 20:53:09,007 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.49815313966257363 [2022-11-02 20:53:09,007 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 4990 transitions. [2022-11-02 20:53:09,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 4990 transitions. [2022-11-02 20:53:09,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:09,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 4990 transitions. [2022-11-02 20:53:09,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 79.2063492063492) internal successors, (4990), 63 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:09,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 159.0) internal successors, (10176), 64 states have internal predecessors, (10176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:09,042 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 159.0) internal successors, (10176), 64 states have internal predecessors, (10176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:09,042 INFO L175 Difference]: Start difference. First operand has 163 places, 153 transitions, 479 flow. Second operand 63 states and 4990 transitions. [2022-11-02 20:53:09,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 590 transitions, 3377 flow [2022-11-02 20:53:09,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 590 transitions, 3266 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-02 20:53:09,101 INFO L231 Difference]: Finished difference. Result has 258 places, 320 transitions, 2023 flow [2022-11-02 20:53:09,102 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2023, PETRI_PLACES=258, PETRI_TRANSITIONS=320} [2022-11-02 20:53:09,102 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 116 predicate places. [2022-11-02 20:53:09,103 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 320 transitions, 2023 flow [2022-11-02 20:53:09,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 74.82142857142857) internal successors, (4190), 56 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:09,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:09,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:53:09,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:09,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:09,328 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 1 more)] === [2022-11-02 20:53:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1157394404, now seen corresponding path program 1 times [2022-11-02 20:53:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:09,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495763342] [2022-11-02 20:53:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:11,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495763342] [2022-11-02 20:53:11,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495763342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:11,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695705328] [2022-11-02 20:53:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:11,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:11,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:53:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-02 20:53:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:12,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:53:13,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:13,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:14,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:14,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-11-02 20:53:14,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:14,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 39 [2022-11-02 20:53:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:15,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:16,475 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-11-02 20:53:18,241 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (= .cse1 c_~max3~0) (not (< c_~max1~0 .cse1)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_208 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (= .cse3 .cse4) (not (< c_~max2~0 .cse3)) (not (< c_~max3~0 .cse3)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse4)))))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_208 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (< c_~max1~0 (select (select .cse7 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse8)) (not (< c_~max3~0 .cse8)) (= c_~max1~0 .cse8) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-02 20:53:18,966 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (< c_~max1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse1)) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse1)) (= .cse1 c_~max1~0) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse2)) (not (< ~M~0 c_~N~0)) (= .cse2 .cse3) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse3)))))) (or (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) .cse6 (= c_~max1~0 c_~max3~0)) (or .cse6 (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= .cse8 c_~max3~0) (not (< c_~max1~0 .cse8)) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-11-02 20:53:20,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (= .cse0 .cse1) (not (< c_~max3~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse1)))))) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (< c_~max1~0 (select (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse4) (not (< c_~max2~0 .cse4)) (not (< c_~max3~0 .cse4)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse5 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (< c_~max1~0 (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (or .cse5 (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< ~M~0 c_~N~0)) (= .cse7 c_~max3~0) (not (< c_~max1~0 .cse7)) (< c_~max3~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-11-02 20:53:20,424 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse2 .cse3) (not (< c_~max2~0 .cse3)) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse3)) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse2)))))) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse5) (not (< c_~max3~0 .cse5)) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (or (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse7 c_~max3~0) (not (< ~M~0 c_~N~0)) (not (< c_~max1~0 .cse7)) (< c_~max3~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) .cse0))) is different from false [2022-11-02 20:53:20,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (< c_~max1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max2~0 .cse1)) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse1)) (= c_~max1~0 .cse1) (< (+ ~M~0 1) c_~N~0))))))) (or .cse2 (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse3)) (not (< ~M~0 c_~N~0)) (= .cse3 c_~max3~0) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse5)) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max2~0 .cse6)) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse6)) (= .cse5 .cse6) (< (+ ~M~0 1) c_~N~0)))))))) (or .cse2 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_207) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_208))) (or (< c_~max1~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))))) is different from false [2022-11-02 20:53:22,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:22,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 99 [2022-11-02 20:53:22,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:22,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4106 treesize of output 3792 [2022-11-02 20:53:22,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:22,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3782 treesize of output 3372 [2022-11-02 20:53:22,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3314 treesize of output 2738 [2022-11-02 20:53:22,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:22,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2786 treesize of output 2586 [2022-11-02 20:53:24,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:24,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 60 [2022-11-02 20:53:24,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:53:24,874 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:24,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 163 [2022-11-02 20:53:24,895 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:24,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 143 [2022-11-02 20:53:24,913 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:24,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 97 treesize of output 91 [2022-11-02 20:53:25,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:25,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2022-11-02 20:53:25,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:53:25,071 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:25,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 239 [2022-11-02 20:53:25,094 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:25,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 235 treesize of output 207 [2022-11-02 20:53:25,116 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:25,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 191 [2022-11-02 20:53:25,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:25,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-11-02 20:53:25,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:53:25,294 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:25,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 239 [2022-11-02 20:53:25,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:25,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 165 [2022-11-02 20:53:25,323 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:53:25,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 215 treesize of output 179 [2022-11-02 20:53:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:53:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695705328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:27,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:27,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 34] total 90 [2022-11-02 20:53:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838657988] [2022-11-02 20:53:27,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:27,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-02 20:53:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-02 20:53:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=6009, Unknown=14, NotChecked=1014, Total=8010 [2022-11-02 20:53:27,199 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 159 [2022-11-02 20:53:27,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 320 transitions, 2023 flow. Second operand has 90 states, 90 states have (on average 61.333333333333336) internal successors, (5520), 90 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:27,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:27,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 159 [2022-11-02 20:53:27,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:40,583 INFO L130 PetriNetUnfolder]: 7172/14714 cut-off events. [2022-11-02 20:53:40,583 INFO L131 PetriNetUnfolder]: For 33858/34182 co-relation queries the response was YES. [2022-11-02 20:53:40,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48835 conditions, 14714 events. 7172/14714 cut-off events. For 33858/34182 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 137491 event pairs, 611 based on Foata normal form. 180/14776 useless extension candidates. Maximal degree in co-relation 48782. Up to 3706 conditions per place. [2022-11-02 20:53:40,946 INFO L137 encePairwiseOnDemand]: 113/159 looper letters, 454 selfloop transitions, 269 changer transitions 12/792 dead transitions. [2022-11-02 20:53:40,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 792 transitions, 6046 flow [2022-11-02 20:53:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-02 20:53:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-11-02 20:53:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 4415 transitions. [2022-11-02 20:53:40,959 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.420716599961883 [2022-11-02 20:53:40,960 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 4415 transitions. [2022-11-02 20:53:40,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 4415 transitions. [2022-11-02 20:53:40,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:40,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 4415 transitions. [2022-11-02 20:53:40,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 66.89393939393939) internal successors, (4415), 66 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:40,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 159.0) internal successors, (10653), 67 states have internal predecessors, (10653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:40,991 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 159.0) internal successors, (10653), 67 states have internal predecessors, (10653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:40,991 INFO L175 Difference]: Start difference. First operand has 258 places, 320 transitions, 2023 flow. Second operand 66 states and 4415 transitions. [2022-11-02 20:53:40,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 792 transitions, 6046 flow [2022-11-02 20:53:41,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 792 transitions, 5841 flow, removed 75 selfloop flow, removed 22 redundant places. [2022-11-02 20:53:41,327 INFO L231 Difference]: Finished difference. Result has 316 places, 472 transitions, 4003 flow [2022-11-02 20:53:41,328 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1936, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=4003, PETRI_PLACES=316, PETRI_TRANSITIONS=472} [2022-11-02 20:53:41,332 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 174 predicate places. [2022-11-02 20:53:41,332 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 472 transitions, 4003 flow [2022-11-02 20:53:41,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 61.333333333333336) internal successors, (5520), 90 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:41,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:41,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:41,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:41,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:53:41,551 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 1 more)] === [2022-11-02 20:53:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2130934002, now seen corresponding path program 2 times [2022-11-02 20:53:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:41,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362128480] [2022-11-02 20:53:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:43,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362128480] [2022-11-02 20:53:43,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362128480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:43,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207468155] [2022-11-02 20:53:43,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:53:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:43,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:43,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:53:44,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:53:44,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:44,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-02 20:53:44,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:44,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:44,273 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:53:44,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:53:44,702 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:53:44,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-11-02 20:53:45,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-11-02 20:53:45,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:45,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-11-02 20:53:46,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:46,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 39 [2022-11-02 20:53:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:47,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:49,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:49,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 431 treesize of output 403 [2022-11-02 20:53:49,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 344 treesize of output 308 [2022-11-02 20:53:49,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 308 treesize of output 290 [2022-11-02 20:53:49,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 290 treesize of output 278 [2022-11-02 20:53:49,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 278 treesize of output 254 [2022-11-02 20:53:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:52,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207468155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:52,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:52,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 81 [2022-11-02 20:53:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892159574] [2022-11-02 20:53:52,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:52,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-02 20:53:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-02 20:53:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=5594, Unknown=4, NotChecked=0, Total=6480 [2022-11-02 20:53:52,735 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 159 [2022-11-02 20:53:52,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 472 transitions, 4003 flow. Second operand has 81 states, 81 states have (on average 61.641975308641975) internal successors, (4993), 81 states have internal predecessors, (4993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:52,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:52,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 159 [2022-11-02 20:53:52,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:08,664 INFO L130 PetriNetUnfolder]: 12251/25145 cut-off events. [2022-11-02 20:54:08,665 INFO L131 PetriNetUnfolder]: For 98258/98957 co-relation queries the response was YES. [2022-11-02 20:54:09,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98597 conditions, 25145 events. 12251/25145 cut-off events. For 98258/98957 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 254202 event pairs, 786 based on Foata normal form. 485/25479 useless extension candidates. Maximal degree in co-relation 98531. Up to 5018 conditions per place. [2022-11-02 20:54:09,356 INFO L137 encePairwiseOnDemand]: 114/159 looper letters, 653 selfloop transitions, 502 changer transitions 16/1227 dead transitions. [2022-11-02 20:54:09,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 1227 transitions, 12145 flow [2022-11-02 20:54:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-02 20:54:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-11-02 20:54:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 6230 transitions. [2022-11-02 20:54:09,382 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.42131602082910663 [2022-11-02 20:54:09,382 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 6230 transitions. [2022-11-02 20:54:09,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 6230 transitions. [2022-11-02 20:54:09,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:09,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 6230 transitions. [2022-11-02 20:54:09,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 66.98924731182795) internal successors, (6230), 93 states have internal predecessors, (6230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 159.0) internal successors, (14946), 94 states have internal predecessors, (14946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,441 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 159.0) internal successors, (14946), 94 states have internal predecessors, (14946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,441 INFO L175 Difference]: Start difference. First operand has 316 places, 472 transitions, 4003 flow. Second operand 93 states and 6230 transitions. [2022-11-02 20:54:09,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 1227 transitions, 12145 flow [2022-11-02 20:54:11,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 1227 transitions, 11662 flow, removed 198 selfloop flow, removed 32 redundant places. [2022-11-02 20:54:11,553 INFO L231 Difference]: Finished difference. Result has 414 places, 727 transitions, 8024 flow [2022-11-02 20:54:11,553 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=3776, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=8024, PETRI_PLACES=414, PETRI_TRANSITIONS=727} [2022-11-02 20:54:11,554 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 272 predicate places. [2022-11-02 20:54:11,554 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 727 transitions, 8024 flow [2022-11-02 20:54:11,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 61.641975308641975) internal successors, (4993), 81 states have internal predecessors, (4993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:11,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:11,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-02 20:54:11,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:11,770 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 1 more)] === [2022-11-02 20:54:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash -100125364, now seen corresponding path program 2 times [2022-11-02 20:54:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:11,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974018481] [2022-11-02 20:54:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:13,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974018481] [2022-11-02 20:54:13,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974018481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:13,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859332074] [2022-11-02 20:54:13,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:54:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:13,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:13,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:13,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef4ae261-98b2-4959-ac7e-7ef4790f26cd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:54:13,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:54:13,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:54:13,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 20:54:13,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:13,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:54:13,805 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:13,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-02 20:54:14,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-02 20:54:15,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:15,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 46 [2022-11-02 20:54:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:54:15,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:17,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:17,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 147 [2022-11-02 20:54:17,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 82 [2022-11-02 20:54:17,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 70 [2022-11-02 20:54:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:54:18,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859332074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:54:18,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:54:18,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 25] total 68 [2022-11-02 20:54:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732429863] [2022-11-02 20:54:18,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:18,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-02 20:54:18,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-02 20:54:18,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=3636, Unknown=6, NotChecked=0, Total=4556 [2022-11-02 20:54:18,687 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 159 [2022-11-02 20:54:18,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 727 transitions, 8024 flow. Second operand has 68 states, 68 states have (on average 59.161764705882355) internal successors, (4023), 68 states have internal predecessors, (4023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:18,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 159 [2022-11-02 20:54:18,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand