./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN --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 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --- 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-6b4ec56 [2022-11-20 12:35:22,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:35:22,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:35:22,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:35:22,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:35:22,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:35:22,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:35:22,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:35:22,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:35:22,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:35:22,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:35:22,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:35:22,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:35:22,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:35:22,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:35:22,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:35:22,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:35:22,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:35:22,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:35:22,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:35:22,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:35:22,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:35:22,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:35:22,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:35:22,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:35:22,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:35:22,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:35:22,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:35:22,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:35:22,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:35:22,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:35:22,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:35:22,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:35:22,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:35:22,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:35:22,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:35:22,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:35:22,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:35:22,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:35:22,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:35:22,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:35:22,346 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:35:22,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:35:22,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:35:22,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:35:22,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:35:22,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:35:22,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:35:22,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:35:22,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:35:22,381 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:35:22,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:35:22,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:35:22,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:35:22,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:35:22,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:35:22,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:35:22,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:35:22,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:35:22,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:35:22,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:35:22,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:35:22,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:35:22,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:35:22,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:35:22,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:35:22,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:35:22,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:35:22,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:35:22,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:35:22,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:35:22,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:35:22,384 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:35:22,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:35:22,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:35:22,385 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_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/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_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN 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 -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 [2022-11-20 12:35:22,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:35:22,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:35:22,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:35:22,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:35:22,697 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:35:22,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-20 12:35:25,686 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:35:25,990 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:35:25,991 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2022-11-20 12:35:25,999 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/data/b32397d78/6c28eaeafd764ebf9850e3cf33cee393/FLAG0c6f5eeac [2022-11-20 12:35:26,013 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/data/b32397d78/6c28eaeafd764ebf9850e3cf33cee393 [2022-11-20 12:35:26,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:35:26,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:35:26,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:35:26,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:35:26,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:35:26,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a4d327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26, skipping insertion in model container [2022-11-20 12:35:26,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:35:26,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:35:26,214 WARN L237 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_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-20 12:35:26,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:35:26,234 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:35:26,258 WARN L237 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_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-11-20 12:35:26,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:35:26,277 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:35:26,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26 WrapperNode [2022-11-20 12:35:26,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:35:26,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:35:26,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:35:26,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:35:26,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,329 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-11-20 12:35:26,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:35:26,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:35:26,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:35:26,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:35:26,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,356 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:35:26,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:35:26,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:35:26,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:35:26,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (1/1) ... [2022-11-20 12:35:26,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:35:26,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:26,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:35:26,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:35:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:35:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 12:35:26,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 12:35:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 12:35:26,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 12:35:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:35:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:35:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:35:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 12:35:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 12:35:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:35:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:35:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:35:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:35:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:35:26,454 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:35:26,557 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:35:26,560 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:35:26,921 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:35:27,158 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:35:27,158 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 12:35:27,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:27 BoogieIcfgContainer [2022-11-20 12:35:27,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:35:27,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:35:27,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:35:27,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:35:27,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:35:26" (1/3) ... [2022-11-20 12:35:27,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487c8720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:35:27, skipping insertion in model container [2022-11-20 12:35:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:26" (2/3) ... [2022-11-20 12:35:27,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487c8720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:35:27, skipping insertion in model container [2022-11-20 12:35:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:27" (3/3) ... [2022-11-20 12:35:27,174 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-11-20 12:35:27,180 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:35:27,188 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:35:27,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:35:27,188 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:35:27,255 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 12:35:27,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 178 transitions, 372 flow [2022-11-20 12:35:27,377 INFO L130 PetriNetUnfolder]: 13/176 cut-off events. [2022-11-20 12:35:27,377 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:35:27,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 176 events. 13/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-11-20 12:35:27,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 178 transitions, 372 flow [2022-11-20 12:35:27,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 167 transitions, 346 flow [2022-11-20 12:35:27,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:35:27,405 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;@737f0db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:35:27,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-20 12:35:27,450 INFO L130 PetriNetUnfolder]: 13/166 cut-off events. [2022-11-20 12:35:27,451 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:35:27,451 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:27,452 INFO L209 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, 1] [2022-11-20 12:35:27,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1458705349, now seen corresponding path program 1 times [2022-11-20 12:35:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771647801] [2022-11-20 12:35:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:27,887 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-20 12:35:27,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:27,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771647801] [2022-11-20 12:35:27,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771647801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:27,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:27,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:35:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113647753] [2022-11-20 12:35:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:27,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:35:27,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:35:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:35:27,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 178 [2022-11-20 12:35:27,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 167 transitions, 346 flow. Second operand has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 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-20 12:35:27,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:27,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 178 [2022-11-20 12:35:27,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:28,138 INFO L130 PetriNetUnfolder]: 17/189 cut-off events. [2022-11-20 12:35:28,138 INFO L131 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2022-11-20 12:35:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 189 events. 17/189 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 8 based on Foata normal form. 15/191 useless extension candidates. Maximal degree in co-relation 137. Up to 25 conditions per place. [2022-11-20 12:35:28,143 INFO L137 encePairwiseOnDemand]: 169/178 looper letters, 8 selfloop transitions, 0 changer transitions 5/158 dead transitions. [2022-11-20 12:35:28,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 344 flow [2022-11-20 12:35:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:35:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 12:35:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2022-11-20 12:35:28,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9466292134831461 [2022-11-20 12:35:28,179 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2022-11-20 12:35:28,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2022-11-20 12:35:28,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:28,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2022-11-20 12:35:28,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-20 12:35:28,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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-20 12:35:28,222 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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-20 12:35:28,224 INFO L175 Difference]: Start difference. First operand has 161 places, 167 transitions, 346 flow. Second operand 2 states and 337 transitions. [2022-11-20 12:35:28,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 344 flow [2022-11-20 12:35:28,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 158 transitions, 336 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:35:28,248 INFO L231 Difference]: Finished difference. Result has 158 places, 153 transitions, 310 flow [2022-11-20 12:35:28,250 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=310, PETRI_PLACES=158, PETRI_TRANSITIONS=153} [2022-11-20 12:35:28,260 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, -3 predicate places. [2022-11-20 12:35:28,261 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 153 transitions, 310 flow [2022-11-20 12:35:28,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 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-20 12:35:28,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:28,262 INFO L209 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, 1] [2022-11-20 12:35:28,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:35:28,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1666625947, now seen corresponding path program 1 times [2022-11-20 12:35:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:28,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529158315] [2022-11-20 12:35:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:28,887 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-20 12:35:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529158315] [2022-11-20 12:35:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529158315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:35:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306916104] [2022-11-20 12:35:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:28,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:35:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:35:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:35:28,892 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 178 [2022-11-20 12:35:28,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 153 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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-20 12:35:28,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:28,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 178 [2022-11-20 12:35:28,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:29,160 INFO L130 PetriNetUnfolder]: 112/418 cut-off events. [2022-11-20 12:35:29,161 INFO L131 PetriNetUnfolder]: For 20/33 co-relation queries the response was YES. [2022-11-20 12:35:29,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 418 events. 112/418 cut-off events. For 20/33 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1480 event pairs, 33 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 673. Up to 120 conditions per place. [2022-11-20 12:35:29,168 INFO L137 encePairwiseOnDemand]: 171/178 looper letters, 59 selfloop transitions, 5 changer transitions 4/183 dead transitions. [2022-11-20 12:35:29,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 183 transitions, 511 flow [2022-11-20 12:35:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:35:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:35:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2022-11-20 12:35:29,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7668539325842697 [2022-11-20 12:35:29,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2022-11-20 12:35:29,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2022-11-20 12:35:29,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:29,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2022-11-20 12:35:29,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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-20 12:35:29,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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-20 12:35:29,184 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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-20 12:35:29,185 INFO L175 Difference]: Start difference. First operand has 158 places, 153 transitions, 310 flow. Second operand 6 states and 819 transitions. [2022-11-20 12:35:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 183 transitions, 511 flow [2022-11-20 12:35:29,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 183 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:35:29,193 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 339 flow [2022-11-20 12:35:29,194 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2022-11-20 12:35:29,195 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2022-11-20 12:35:29,195 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 339 flow [2022-11-20 12:35:29,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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-20 12:35:29,197 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:29,198 INFO L209 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:29,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:35:29,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1017288057, now seen corresponding path program 1 times [2022-11-20 12:35:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:29,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862759696] [2022-11-20 12:35:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:29,479 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-20 12:35:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:29,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862759696] [2022-11-20 12:35:29,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862759696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:29,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:29,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:35:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510512879] [2022-11-20 12:35:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:29,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:35:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:35:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:35:29,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2022-11-20 12:35:29,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 339 flow. Second operand has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-20 12:35:29,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:29,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2022-11-20 12:35:29,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:29,693 INFO L130 PetriNetUnfolder]: 109/423 cut-off events. [2022-11-20 12:35:29,693 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-11-20 12:35:29,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 423 events. 109/423 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1595 event pairs, 48 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 706. Up to 117 conditions per place. [2022-11-20 12:35:29,696 INFO L137 encePairwiseOnDemand]: 168/178 looper letters, 37 selfloop transitions, 11 changer transitions 4/184 dead transitions. [2022-11-20 12:35:29,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 184 transitions, 515 flow [2022-11-20 12:35:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:35:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 12:35:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 789 transitions. [2022-11-20 12:35:29,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8865168539325843 [2022-11-20 12:35:29,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 789 transitions. [2022-11-20 12:35:29,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 789 transitions. [2022-11-20 12:35:29,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:29,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 789 transitions. [2022-11-20 12:35:29,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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-20 12:35:29,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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-20 12:35:29,708 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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-20 12:35:29,709 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 339 flow. Second operand 5 states and 789 transitions. [2022-11-20 12:35:29,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 184 transitions, 515 flow [2022-11-20 12:35:29,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 184 transitions, 511 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-20 12:35:29,718 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 392 flow [2022-11-20 12:35:29,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2022-11-20 12:35:29,721 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 2 predicate places. [2022-11-20 12:35:29,722 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 392 flow [2022-11-20 12:35:29,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-20 12:35:29,723 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:29,723 INFO L209 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:29,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:35:29,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1113997575, now seen corresponding path program 2 times [2022-11-20 12:35:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:29,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850842749] [2022-11-20 12:35:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:29,944 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-20 12:35:29,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:29,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850842749] [2022-11-20 12:35:29,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850842749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:29,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:35:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250764256] [2022-11-20 12:35:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:29,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:35:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:29,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:35:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:35:29,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2022-11-20 12:35:29,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 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-20 12:35:29,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:29,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2022-11-20 12:35:29,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:30,101 INFO L130 PetriNetUnfolder]: 91/366 cut-off events. [2022-11-20 12:35:30,101 INFO L131 PetriNetUnfolder]: For 116/126 co-relation queries the response was YES. [2022-11-20 12:35:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 366 events. 91/366 cut-off events. For 116/126 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1173 event pairs, 28 based on Foata normal form. 12/370 useless extension candidates. Maximal degree in co-relation 682. Up to 116 conditions per place. [2022-11-20 12:35:30,105 INFO L137 encePairwiseOnDemand]: 170/178 looper letters, 33 selfloop transitions, 7 changer transitions 6/178 dead transitions. [2022-11-20 12:35:30,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 532 flow [2022-11-20 12:35:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:35:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 12:35:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 929 transitions. [2022-11-20 12:35:30,108 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8698501872659176 [2022-11-20 12:35:30,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 929 transitions. [2022-11-20 12:35:30,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 929 transitions. [2022-11-20 12:35:30,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:30,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 929 transitions. [2022-11-20 12:35:30,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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-20 12:35:30,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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-20 12:35:30,121 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 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-20 12:35:30,121 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 392 flow. Second operand 6 states and 929 transitions. [2022-11-20 12:35:30,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 532 flow [2022-11-20 12:35:30,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 518 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:35:30,127 INFO L231 Difference]: Finished difference. Result has 166 places, 158 transitions, 385 flow [2022-11-20 12:35:30,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=166, PETRI_TRANSITIONS=158} [2022-11-20 12:35:30,129 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 5 predicate places. [2022-11-20 12:35:30,133 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 158 transitions, 385 flow [2022-11-20 12:35:30,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 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-20 12:35:30,135 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:30,135 INFO L209 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:35:30,136 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -373622335, now seen corresponding path program 1 times [2022-11-20 12:35:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:30,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377758605] [2022-11-20 12:35:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:30,334 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-20 12:35:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:30,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377758605] [2022-11-20 12:35:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377758605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:30,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:30,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:35:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421081711] [2022-11-20 12:35:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:30,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:35:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:35:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:35:30,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 178 [2022-11-20 12:35:30,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 158 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 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-20 12:35:30,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:30,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 178 [2022-11-20 12:35:30,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:30,472 INFO L130 PetriNetUnfolder]: 31/275 cut-off events. [2022-11-20 12:35:30,472 INFO L131 PetriNetUnfolder]: For 53/59 co-relation queries the response was YES. [2022-11-20 12:35:30,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 275 events. 31/275 cut-off events. For 53/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 568 event pairs, 14 based on Foata normal form. 5/271 useless extension candidates. Maximal degree in co-relation 462. Up to 56 conditions per place. [2022-11-20 12:35:30,474 INFO L137 encePairwiseOnDemand]: 169/178 looper letters, 35 selfloop transitions, 6 changer transitions 4/166 dead transitions. [2022-11-20 12:35:30,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 493 flow [2022-11-20 12:35:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:35:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:35:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2022-11-20 12:35:30,477 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7881219903691814 [2022-11-20 12:35:30,477 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2022-11-20 12:35:30,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2022-11-20 12:35:30,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:30,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2022-11-20 12:35:30,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 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-20 12:35:30,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 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-20 12:35:30,484 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 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-20 12:35:30,484 INFO L175 Difference]: Start difference. First operand has 166 places, 158 transitions, 385 flow. Second operand 7 states and 982 transitions. [2022-11-20 12:35:30,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 493 flow [2022-11-20 12:35:30,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 473 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-20 12:35:30,490 INFO L231 Difference]: Finished difference. Result has 170 places, 159 transitions, 389 flow [2022-11-20 12:35:30,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=170, PETRI_TRANSITIONS=159} [2022-11-20 12:35:30,491 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 9 predicate places. [2022-11-20 12:35:30,491 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 159 transitions, 389 flow [2022-11-20 12:35:30,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 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-20 12:35:30,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:30,492 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:30,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:35:30,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1152719248, now seen corresponding path program 1 times [2022-11-20 12:35:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207071252] [2022-11-20 12:35:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:30,675 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-20 12:35:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207071252] [2022-11-20 12:35:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207071252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162075993] [2022-11-20 12:35:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:30,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:30,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:30,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:35:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:30,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:35:30,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:31,431 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-20 12:35:31,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:31,686 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-20 12:35:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162075993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:31,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:31,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-20 12:35:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109589805] [2022-11-20 12:35:31,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:31,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:35:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:31,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:35:31,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:35:31,691 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2022-11-20 12:35:31,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 159 transitions, 389 flow. Second operand has 11 states, 11 states have (on average 150.9090909090909) internal successors, (1660), 11 states have internal predecessors, (1660), 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-20 12:35:31,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:31,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2022-11-20 12:35:31,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:31,959 INFO L130 PetriNetUnfolder]: 110/441 cut-off events. [2022-11-20 12:35:31,960 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-11-20 12:35:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 441 events. 110/441 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1471 event pairs, 20 based on Foata normal form. 7/444 useless extension candidates. Maximal degree in co-relation 861. Up to 70 conditions per place. [2022-11-20 12:35:31,963 INFO L137 encePairwiseOnDemand]: 170/178 looper letters, 58 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2022-11-20 12:35:31,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 210 transitions, 713 flow [2022-11-20 12:35:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:35:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-20 12:35:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1843 transitions. [2022-11-20 12:35:31,968 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8628277153558053 [2022-11-20 12:35:31,968 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1843 transitions. [2022-11-20 12:35:31,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1843 transitions. [2022-11-20 12:35:31,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:31,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1843 transitions. [2022-11-20 12:35:31,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 153.58333333333334) internal successors, (1843), 12 states have internal predecessors, (1843), 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-20 12:35:31,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 178.0) internal successors, (2314), 13 states have internal predecessors, (2314), 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-20 12:35:31,978 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 178.0) internal successors, (2314), 13 states have internal predecessors, (2314), 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-20 12:35:31,978 INFO L175 Difference]: Start difference. First operand has 170 places, 159 transitions, 389 flow. Second operand 12 states and 1843 transitions. [2022-11-20 12:35:31,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 210 transitions, 713 flow [2022-11-20 12:35:31,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 210 transitions, 703 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 12:35:31,986 INFO L231 Difference]: Finished difference. Result has 181 places, 170 transitions, 498 flow [2022-11-20 12:35:31,987 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=498, PETRI_PLACES=181, PETRI_TRANSITIONS=170} [2022-11-20 12:35:31,989 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 20 predicate places. [2022-11-20 12:35:31,990 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 170 transitions, 498 flow [2022-11-20 12:35:31,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 150.9090909090909) internal successors, (1660), 11 states have internal predecessors, (1660), 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-20 12:35:31,993 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:31,993 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:32,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:35:32,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:32,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:32,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash -17716140, now seen corresponding path program 1 times [2022-11-20 12:35:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:32,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011077602] [2022-11-20 12:35:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:35:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011077602] [2022-11-20 12:35:32,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011077602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:32,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:32,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:35:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214493680] [2022-11-20 12:35:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:32,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:35:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:32,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:35:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:35:32,396 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 178 [2022-11-20 12:35:32,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 170 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 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-20 12:35:32,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:32,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 178 [2022-11-20 12:35:32,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:35:32,572 INFO L130 PetriNetUnfolder]: 46/388 cut-off events. [2022-11-20 12:35:32,573 INFO L131 PetriNetUnfolder]: For 233/236 co-relation queries the response was YES. [2022-11-20 12:35:32,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 388 events. 46/388 cut-off events. For 233/236 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1006 event pairs, 21 based on Foata normal form. 4/381 useless extension candidates. Maximal degree in co-relation 737. Up to 90 conditions per place. [2022-11-20 12:35:32,575 INFO L137 encePairwiseOnDemand]: 167/178 looper letters, 40 selfloop transitions, 8 changer transitions 17/191 dead transitions. [2022-11-20 12:35:32,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 682 flow [2022-11-20 12:35:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:35:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:35:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1262 transitions. [2022-11-20 12:35:32,579 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.787765293383271 [2022-11-20 12:35:32,579 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1262 transitions. [2022-11-20 12:35:32,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1262 transitions. [2022-11-20 12:35:32,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:35:32,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1262 transitions. [2022-11-20 12:35:32,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 140.22222222222223) internal successors, (1262), 9 states have internal predecessors, (1262), 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-20 12:35:32,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 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-20 12:35:32,587 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 178.0) internal successors, (1780), 10 states have internal predecessors, (1780), 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-20 12:35:32,587 INFO L175 Difference]: Start difference. First operand has 181 places, 170 transitions, 498 flow. Second operand 9 states and 1262 transitions. [2022-11-20 12:35:32,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 682 flow [2022-11-20 12:35:32,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 191 transitions, 645 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-20 12:35:32,594 INFO L231 Difference]: Finished difference. Result has 187 places, 171 transitions, 491 flow [2022-11-20 12:35:32,594 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=491, PETRI_PLACES=187, PETRI_TRANSITIONS=171} [2022-11-20 12:35:32,595 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 26 predicate places. [2022-11-20 12:35:32,595 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 171 transitions, 491 flow [2022-11-20 12:35:32,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 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-20 12:35:32,596 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:35:32,596 INFO L209 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, 1, 1, 1, 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-20 12:35:32,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:35:32,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:35:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1730991474, now seen corresponding path program 1 times [2022-11-20 12:35:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572213737] [2022-11-20 12:35:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:37,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:37,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572213737] [2022-11-20 12:35:37,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572213737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:37,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435136835] [2022-11-20 12:35:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:37,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:37,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:37,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:35:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:37,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-20 12:35:37,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:42,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:35:42,430 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:35:42,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 18 [2022-11-20 12:35:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:42,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:44,165 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-11-20 12:35:44,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 236 [2022-11-20 12:35:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:53,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435136835] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:53,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:53,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 31] total 103 [2022-11-20 12:35:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176534937] [2022-11-20 12:35:53,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:53,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-11-20 12:35:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:53,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-11-20 12:35:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=9461, Unknown=0, NotChecked=0, Total=10506 [2022-11-20 12:35:53,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 178 [2022-11-20 12:35:53,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 171 transitions, 491 flow. Second operand has 103 states, 103 states have (on average 66.63106796116504) internal successors, (6863), 103 states have internal predecessors, (6863), 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-20 12:35:53,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:53,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 178 [2022-11-20 12:35:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:36:20,410 INFO L130 PetriNetUnfolder]: 1364/2913 cut-off events. [2022-11-20 12:36:20,411 INFO L131 PetriNetUnfolder]: For 1999/1999 co-relation queries the response was YES. [2022-11-20 12:36:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 2913 events. 1364/2913 cut-off events. For 1999/1999 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 19573 event pairs, 34 based on Foata normal form. 31/2938 useless extension candidates. Maximal degree in co-relation 7501. Up to 433 conditions per place. [2022-11-20 12:36:20,441 INFO L137 encePairwiseOnDemand]: 120/178 looper letters, 383 selfloop transitions, 394 changer transitions 36/867 dead transitions. [2022-11-20 12:36:20,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 867 transitions, 4594 flow [2022-11-20 12:36:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-11-20 12:36:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2022-11-20 12:36:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 11548 transitions. [2022-11-20 12:36:20,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3861690743713216 [2022-11-20 12:36:20,475 INFO L72 ComplementDD]: Start complementDD. Operand 168 states and 11548 transitions. [2022-11-20 12:36:20,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 11548 transitions. [2022-11-20 12:36:20,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:36:20,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 168 states and 11548 transitions. [2022-11-20 12:36:20,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 169 states, 168 states have (on average 68.73809523809524) internal successors, (11548), 168 states have internal predecessors, (11548), 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-20 12:36:20,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 169 states, 169 states have (on average 178.0) internal successors, (30082), 169 states have internal predecessors, (30082), 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-20 12:36:20,555 INFO L81 ComplementDD]: Finished complementDD. Result has 169 states, 169 states have (on average 178.0) internal successors, (30082), 169 states have internal predecessors, (30082), 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-20 12:36:20,556 INFO L175 Difference]: Start difference. First operand has 187 places, 171 transitions, 491 flow. Second operand 168 states and 11548 transitions. [2022-11-20 12:36:20,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 867 transitions, 4594 flow [2022-11-20 12:36:20,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 867 transitions, 4373 flow, removed 83 selfloop flow, removed 7 redundant places. [2022-11-20 12:36:20,661 INFO L231 Difference]: Finished difference. Result has 410 places, 557 transitions, 3329 flow [2022-11-20 12:36:20,662 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=168, PETRI_FLOW=3329, PETRI_PLACES=410, PETRI_TRANSITIONS=557} [2022-11-20 12:36:20,665 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 249 predicate places. [2022-11-20 12:36:20,666 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 557 transitions, 3329 flow [2022-11-20 12:36:20,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 66.63106796116504) internal successors, (6863), 103 states have internal predecessors, (6863), 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-20 12:36:20,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:36:20,669 INFO L209 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, 1, 1, 1, 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-20 12:36:20,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:36:20,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:36:20,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:36:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash 402750100, now seen corresponding path program 2 times [2022-11-20 12:36:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:20,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047686269] [2022-11-20 12:36:20,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:20,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:27,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047686269] [2022-11-20 12:36:27,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047686269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:36:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798787188] [2022-11-20 12:36:27,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:36:27,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:36:27,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:36:27,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:36:27,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:36:27,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:36:27,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:36:27,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 12:36:28,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:36:29,066 INFO L350 Elim1Store]: Elim1 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-20 12:36:29,521 INFO L350 Elim1Store]: Elim1 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-20 12:36:31,062 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:36:31,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 12:36:31,627 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 12:36:32,799 INFO L350 Elim1Store]: Elim1 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-20 12:36:33,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:36:33,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-20 12:36:34,146 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 56 treesize of output 16 [2022-11-20 12:36:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:36:34,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:36:52,915 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-20 12:36:52,915 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 214 treesize of output 112 [2022-11-20 12:36:53,033 INFO L321 Elim1Store]: treesize reduction 65, result has 60.1 percent of original size [2022-11-20 12:36:53,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 277 treesize of output 334 [2022-11-20 12:36:53,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:36:53,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 191 treesize of output 199 [2022-11-20 12:36:53,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:36:53,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:36:53,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 153 [2022-11-20 12:36:56,314 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-20 12:36:56,314 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 214 treesize of output 112 [2022-11-20 12:36:56,430 INFO L321 Elim1Store]: treesize reduction 69, result has 57.7 percent of original size [2022-11-20 12:36:56,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 277 treesize of output 330 [2022-11-20 12:36:56,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:36:56,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 191 treesize of output 199 [2022-11-20 12:36:56,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:36:56,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:36:56,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 153 [2022-11-20 12:37:02,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:37:02,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 91 [2022-11-20 12:37:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:37:04,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798787188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:37:04,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:37:04,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 125 [2022-11-20 12:37:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024173150] [2022-11-20 12:37:04,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:37:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-11-20 12:37:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:37:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-11-20 12:37:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=14571, Unknown=36, NotChecked=0, Total=15500 [2022-11-20 12:37:04,513 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 178 [2022-11-20 12:37:04,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 557 transitions, 3329 flow. Second operand has 125 states, 125 states have (on average 56.256) internal successors, (7032), 125 states have internal predecessors, (7032), 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-20 12:37:04,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:37:04,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 178 [2022-11-20 12:37:04,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:37:17,086 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (<= (+ c_~q1_front~0 1) 0))) (let ((.cse0 (= c_~i~0 0)) (.cse20 (<= c_~q1_front~0 c_~q1_back~0)) (.cse23 (or (<= c_~q1_back~0 c_~q1_front~0) (not .cse19))) (.cse14 (not (<= 0 c_~q1_back~0))) (.cse15 (not (< c_~q2_back~0 c_~n2~0))) (.cse16 (not (< c_~q1_back~0 c_~n1~0))) (.cse1 (<= c_~n2~0 c_~q2_front~0)) (.cse17 (< c_~q2_front~0 0)) (.cse18 (not (<= 0 c_~q2_back~0))) (.cse3 (* c_~q2_back~0 4)) (.cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (* c_~q2_front~0 4)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse6 (+ c_~i~0 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse21 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse22 (= c_~j~0 0))) (and (<= 0 c_~i~0) .cse0 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not .cse1) (<= c_~q2_front~0 c_~q2_back~0)) (or (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse4 (select .cse8 c_~q1~0.base))) (or (< (select .cse4 .cse5) .cse6) (not (= c_~j~0 (select .cse4 .cse7))) (< (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse13 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse12 (select .cse13 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse12 .cse7))) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< (select .cse12 .cse5) c_~i~0)))))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0))))) .cse14 .cse15 .cse16 .cse1 .cse17 .cse18) (or (and (or .cse19 (and (<= c_~q2_back~0 c_~q2_front~0) .cse20 .cse21 .cse22)) .cse0 .cse23) .cse1) (= c_~q2_front~0 c_~q2_back~0) (or (and .cse20 .cse21 .cse22) .cse19) .cse23 (or .cse14 .cse15 .cse16 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse17 .cse18 (let ((.cse27 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ .cse27 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= c_~i~0 (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse26 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse25 (select .cse26 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse25 .cse7))) (< (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< (select .cse25 .cse5) c_~i~0)))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ .cse27 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= c_~i~0 (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse3 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse30 (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse29 (select .cse30 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse29 .cse7))) (< (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse29 .cse5) .cse6))))))))))) .cse21 (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse22))) is different from false [2022-11-20 12:37:45,816 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q2_front~0 4))) (let ((.cse58 (select |c_#memory_int| c_~q2~0.base)) (.cse28 (+ c_~q2~0.offset .cse5)) (.cse6 (+ c_~i~0 1)) (.cse45 (* c_~q1_back~0 4)) (.cse44 (* c_~q1_front~0 4))) (let ((.cse60 (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|))) (.cse63 (< c_~j~0 c_~i~0)) (.cse61 (< 0 c_~q2_front~0)) (.cse64 (= .cse45 .cse44)) (.cse66 (< c_~j~0 .cse6)) (.cse62 (< 0 c_~q2_back~0)) (.cse0 (select .cse58 .cse28)) (.cse1 (+ c_~q1_front~0 1)) (.cse11 (+ .cse44 c_~q1~0.offset)) (.cse8 (* c_~q2_back~0 4))) (let ((.cse46 (<= 1 c_~N~0)) (.cse31 (+ .cse8 c_~q2~0.offset)) (.cse51 (<= .cse11 0)) (.cse47 (<= 0 c_~q2_front~0)) (.cse52 (<= .cse1 0)) (.cse48 (= .cse0 0)) (.cse49 (<= .cse28 0)) (.cse59 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse23 (not (< c_~q2_back~0 c_~n2~0))) (.cse10 (+ .cse45 c_~q1~0.offset)) (.cse24 (<= c_~n2~0 c_~q2_front~0)) (.cse53 (and (or .cse60 .cse61 .cse62 .cse63) (or .cse61 (and .cse64 .cse66) .cse62))) (.cse25 (select (select |c_#memory_int| c_~q1~0.base) .cse11)) (.cse26 (let ((.cse84 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse82 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (v_subst_1 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse83 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) v_subst_1) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse85 (store .cse83 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse81 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (< (select .cse81 .cse82) c_~i~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~i~0 (select (select .cse83 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 v_subst_1)))) (not (= c_~j~0 (select .cse81 .cse84))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (< (select (select .cse85 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 v_subst_1)) .cse6) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (v_subst_2 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse86 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) v_subst_2) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse88 (store .cse86 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse87 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select (select .cse86 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 v_subst_2)) c_~i~0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse87 .cse84))) (< (select (select .cse88 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 v_subst_2)) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse87 .cse82) .cse6))))))))) (.cse2 (not (<= 0 c_~q1_back~0))) (.cse3 (not (< c_~q1_back~0 c_~n1~0))) (.cse15 (< c_~q2_front~0 0)) (.cse16 (not (<= 0 c_~q2_back~0))) (.cse50 (= c_~j~0 0))) (and (< .cse0 c_~N~0) (= c_~q2~0.offset 0) (< 0 .cse1) (<= 0 c_~i~0) (or .cse2 .cse3 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse7 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse9 (select .cse4 c_~q1~0.base))) (or (< (select (select .cse4 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~i~0 (select (select .cse7 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse9 .cse10))) (< (select .cse9 .cse11) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse12 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse13 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse14 (select .cse13 c_~q1~0.base))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~i~0 (select (select .cse12 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (< (select (select .cse13 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse14 .cse10))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse14 .cse11) .cse6))))))) .cse15 .cse16) (= c_~q1~0.offset 0) (or (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse17 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse18 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse19 (select .cse18 c_~q1~0.base))) (or (not (= c_~i~0 (select (select .cse17 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (< (select (select .cse18 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse19 .cse10))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse19 .cse11) .cse6) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse21 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse22 (select .cse20 c_~q1~0.base))) (or (< (select (select .cse20 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (not (= c_~i~0 (select (select .cse21 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (= c_~j~0 (select .cse22 .cse10))) (< (select .cse22 .cse11) c_~i~0) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))))))) .cse2 .cse23 .cse3 .cse24 .cse15 .cse16) (= c_~i~0 0) (<= .cse25 0) (<= 0 c_~q1_front~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse26 .cse2 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post25#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse15 .cse16) (or .cse2 .cse23 .cse3 (and (forall ((v_ArrVal_172 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse27 (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse29 (select .cse27 c_~q1~0.base))) (or (< (select (select .cse27 c_~q2~0.base) .cse28) c_~i~0) (not (= (select .cse29 .cse10) c_~j~0)) (< (select .cse29 .cse11) .cse6))))) (not (= (select (select .cse30 c_~q2~0.base) .cse31) c_~i~0))))) (forall ((v_ArrVal_172 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= (select (select .cse32 c_~q2~0.base) .cse31) c_~i~0)) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse33 (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse34 (select .cse33 c_~q1~0.base))) (or (< (select (select .cse33 c_~q2~0.base) .cse28) .cse6) (< (select .cse34 .cse11) c_~i~0) (not (= (select .cse34 .cse10) c_~j~0)))))))))) .cse24 .cse15 .cse16) (exists ((~q1~0.offset Int) (~q1~0.base Int) (v_~q1_front~0_40 Int)) (let ((.cse35 (select (select |c_#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_40))))) (and (<= 0 v_~q1_front~0_40) (<= .cse35 0) (<= c_~i~0 .cse35) (<= v_~q1_front~0_40 0) (not (= ~q1~0.base c_~q2~0.base))))) (< c_~q2_front~0 c_~n2~0) (<= 0 .cse0) (or .cse2 .cse3 .cse15 .cse16 (let ((.cse37 (+ .cse45 |c_ULTIMATE.start_main_#t~ret16#1.offset|)) (.cse38 (+ .cse44 |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse39 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse40 (store .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse36 (select .cse40 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (or (not (= (select .cse36 .cse37) c_~j~0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (< (select .cse36 .cse38) .cse6) (not (= c_~i~0 (select (select .cse39 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (< (select (select .cse40 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse43 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse41 (store .cse43 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (or (< (select (select .cse41 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (not (= (select .cse42 .cse37) c_~j~0)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~i~0 (select (select .cse43 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse42 .cse38) c_~i~0))))))))) .cse46 (not (= c_~q1~0.base c_~q2~0.base)) (or (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) .cse46 (< 0 (+ .cse45 c_~q1~0.offset 1)) .cse47 .cse48 (or (<= c_~n1~0 1) (<= .cse10 0)) .cse49 (or (not (= .cse10 0)) (and (or (not (= .cse11 0)) .cse50) (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 1)) .cse51)))) .cse52) (or .cse2 .cse53 .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse15 .cse16) (or (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse54 (select .cse55 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse54 .cse10))) (< (select (select .cse55 c_~q2~0.base) .cse28) .cse6) (< (select .cse54 .cse11) c_~i~0))))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse56 (select .cse57 c_~q1~0.base))) (or (< (select .cse56 .cse11) .cse6) (not (= c_~j~0 (select .cse56 .cse10))) (< (select (select .cse57 c_~q2~0.base) .cse28) c_~i~0)))))) .cse2 .cse23 .cse3 .cse24 .cse15 .cse16 (not (= c_~i~0 (select .cse58 .cse31)))) (<= c_~j~0 c_~N~0) .cse51 (or (and (<= c_~q1_front~0 c_~q1_back~0) .cse59 .cse50) .cse52) .cse47 (<= c_~n2~0 1) (or (<= c_~q1_back~0 c_~q1_front~0) (not .cse52)) (or .cse2 (and (or .cse60 .cse61 .cse62 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) .cse63) (or .cse61 .cse62 (let ((.cse65 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))))) (and (or .cse64 .cse65) (or .cse66 .cse65))))) .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16) .cse48 .cse49 .cse59 (<= c_~j~0 0) (or .cse2 .cse23 .cse3 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse67 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= c_~i~0 (select (select .cse67 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse68 (store .cse67 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse69 (select .cse68 c_~q1~0.base))) (or (< (select (select .cse68 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~j~0 (select .cse69 .cse10))) (< (select .cse69 .cse11) .cse6)))))))))) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int)) (let ((.cse70 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (or (not (= c_~i~0 (select (select .cse70 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse71 (store .cse70 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse72 (select .cse71 c_~q1~0.base))) (or (< (select (select .cse71 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (not (= c_~j~0 (select .cse72 .cse10))) (< (select .cse72 .cse11) c_~i~0)))))))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))) .cse24 .cse15 .cse16) (or .cse2 .cse53 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse15 .cse16) (<= c_~q1_front~0 0) (<= c_~i~0 1) (= .cse25 0) (or .cse2 .cse3 .cse15 (let ((.cse77 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse76 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse74 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse75 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select (select .cse73 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~i~0 (select (select .cse74 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (not (= c_~j~0 (select .cse75 .cse76))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|)) (< (select .cse75 .cse77) c_~i~0)))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_172 (Array Int Int)) (v_ArrVal_171 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| Int)) (let ((.cse78 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_171)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_172))) (let ((.cse80 (store .cse78 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse79 (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_front~0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| c_~q2_back~0) (not (= c_~i~0 (select (select .cse78 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse79 .cse77) .cse6) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) 0)) (< (select (select .cse80 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22|) (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~j~0 (select .cse79 .cse76))) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_27| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_22| |c_#StackHeapBarrier|))))))))) .cse16) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse26 .cse2 .cse3 .cse15 .cse16) .cse50))))) is different from true [2022-11-20 12:37:59,209 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 330 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:38:38,426 INFO L130 PetriNetUnfolder]: 2432/5097 cut-off events. [2022-11-20 12:38:38,426 INFO L131 PetriNetUnfolder]: For 23593/23649 co-relation queries the response was YES. [2022-11-20 12:38:38,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22299 conditions, 5097 events. 2432/5097 cut-off events. For 23593/23649 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 39409 event pairs, 160 based on Foata normal form. 20/5106 useless extension candidates. Maximal degree in co-relation 22220. Up to 1285 conditions per place. [2022-11-20 12:38:38,494 INFO L137 encePairwiseOnDemand]: 116/178 looper letters, 568 selfloop transitions, 810 changer transitions 16/1442 dead transitions. [2022-11-20 12:38:38,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 1442 transitions, 12722 flow [2022-11-20 12:38:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2022-11-20 12:38:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2022-11-20 12:38:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 12811 transitions. [2022-11-20 12:38:38,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.325664751639636 [2022-11-20 12:38:38,523 INFO L72 ComplementDD]: Start complementDD. Operand 221 states and 12811 transitions. [2022-11-20 12:38:38,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 12811 transitions. [2022-11-20 12:38:38,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:38:38,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 221 states and 12811 transitions. [2022-11-20 12:38:38,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 222 states, 221 states have (on average 57.9683257918552) internal successors, (12811), 221 states have internal predecessors, (12811), 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-20 12:38:38,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 222 states, 222 states have (on average 178.0) internal successors, (39516), 222 states have internal predecessors, (39516), 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-20 12:38:38,616 INFO L81 ComplementDD]: Finished complementDD. Result has 222 states, 222 states have (on average 178.0) internal successors, (39516), 222 states have internal predecessors, (39516), 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-20 12:38:38,616 INFO L175 Difference]: Start difference. First operand has 410 places, 557 transitions, 3329 flow. Second operand 221 states and 12811 transitions. [2022-11-20 12:38:38,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 1442 transitions, 12722 flow [2022-11-20 12:38:38,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 1442 transitions, 11179 flow, removed 540 selfloop flow, removed 32 redundant places. [2022-11-20 12:38:38,818 INFO L231 Difference]: Finished difference. Result has 650 places, 1102 transitions, 8550 flow [2022-11-20 12:38:38,819 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=221, PETRI_FLOW=8550, PETRI_PLACES=650, PETRI_TRANSITIONS=1102} [2022-11-20 12:38:38,819 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 489 predicate places. [2022-11-20 12:38:38,819 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 1102 transitions, 8550 flow [2022-11-20 12:38:38,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 56.256) internal successors, (7032), 125 states have internal predecessors, (7032), 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-20 12:38:38,823 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:38:38,823 INFO L209 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, 1, 1, 1, 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-20 12:38:38,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:38:39,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:39,029 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:38:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:38:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -659806804, now seen corresponding path program 3 times [2022-11-20 12:38:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:38:39,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682097948] [2022-11-20 12:38:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:38:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:38:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:38:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:38:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682097948] [2022-11-20 12:38:44,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682097948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:38:44,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641171149] [2022-11-20 12:38:44,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:38:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:38:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:38:44,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:38:44,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:38:44,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:38:44,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:38:44,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-20 12:38:44,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:38:48,131 INFO L350 Elim1Store]: Elim1 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-20 12:38:49,179 INFO L350 Elim1Store]: Elim1 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-20 12:38:49,650 INFO L350 Elim1Store]: Elim1 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-20 12:38:50,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:38:50,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 34 [2022-11-20 12:38:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:38:51,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:38:57,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:38:57,010 INFO L350 Elim1Store]: Elim1 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 121 treesize of output 85 [2022-11-20 12:38:57,113 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-11-20 12:38:57,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 503 [2022-11-20 12:38:57,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:38:57,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 308 treesize of output 360 [2022-11-20 12:38:57,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:38:57,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 371 treesize of output 387 [2022-11-20 12:39:33,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:39:33,999 INFO L350 Elim1Store]: Elim1 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 121 treesize of output 85 [2022-11-20 12:39:34,075 INFO L321 Elim1Store]: treesize reduction 55, result has 45.5 percent of original size [2022-11-20 12:39:34,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 452 [2022-11-20 12:39:34,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:39:34,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:39:34,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:39:34,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 308 treesize of output 304 [2022-11-20 12:39:34,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:39:34,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:39:34,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:39:34,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 371 treesize of output 331 [2022-11-20 12:39:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:39:39,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641171149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:39:39,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:39:39,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 45, 37] total 114 [2022-11-20 12:39:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948777235] [2022-11-20 12:39:39,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:39:39,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2022-11-20 12:39:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:39:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2022-11-20 12:39:39,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=11442, Unknown=69, NotChecked=0, Total=12882 [2022-11-20 12:39:39,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 178 [2022-11-20 12:39:39,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 1102 transitions, 8550 flow. Second operand has 114 states, 114 states have (on average 59.44736842105263) internal successors, (6777), 114 states have internal predecessors, (6777), 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-20 12:39:39,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:39:39,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 178 [2022-11-20 12:39:39,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:40:35,580 INFO L130 PetriNetUnfolder]: 4552/9094 cut-off events. [2022-11-20 12:40:35,580 INFO L131 PetriNetUnfolder]: For 139717/139817 co-relation queries the response was YES. [2022-11-20 12:40:35,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57919 conditions, 9094 events. 4552/9094 cut-off events. For 139717/139817 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 78186 event pairs, 149 based on Foata normal form. 59/9130 useless extension candidates. Maximal degree in co-relation 57793. Up to 1825 conditions per place. [2022-11-20 12:40:35,797 INFO L137 encePairwiseOnDemand]: 118/178 looper letters, 750 selfloop transitions, 1636 changer transitions 17/2454 dead transitions. [2022-11-20 12:40:35,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 882 places, 2454 transitions, 28449 flow [2022-11-20 12:40:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-11-20 12:40:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2022-11-20 12:40:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 14741 transitions. [2022-11-20 12:40:35,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3465046307178788 [2022-11-20 12:40:35,822 INFO L72 ComplementDD]: Start complementDD. Operand 239 states and 14741 transitions. [2022-11-20 12:40:35,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 239 states and 14741 transitions. [2022-11-20 12:40:35,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:40:35,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 239 states and 14741 transitions. [2022-11-20 12:40:35,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 240 states, 239 states have (on average 61.67782426778243) internal successors, (14741), 239 states have internal predecessors, (14741), 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-20 12:40:35,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 240 states, 240 states have (on average 178.0) internal successors, (42720), 240 states have internal predecessors, (42720), 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-20 12:40:35,911 INFO L81 ComplementDD]: Finished complementDD. Result has 240 states, 240 states have (on average 178.0) internal successors, (42720), 240 states have internal predecessors, (42720), 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-20 12:40:35,911 INFO L175 Difference]: Start difference. First operand has 650 places, 1102 transitions, 8550 flow. Second operand 239 states and 14741 transitions. [2022-11-20 12:40:35,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 882 places, 2454 transitions, 28449 flow [2022-11-20 12:40:36,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 822 places, 2454 transitions, 27411 flow, removed 444 selfloop flow, removed 60 redundant places. [2022-11-20 12:40:37,008 INFO L231 Difference]: Finished difference. Result has 861 places, 1997 transitions, 20302 flow [2022-11-20 12:40:37,009 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=7914, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=784, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=239, PETRI_FLOW=20302, PETRI_PLACES=861, PETRI_TRANSITIONS=1997} [2022-11-20 12:40:37,009 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 700 predicate places. [2022-11-20 12:40:37,009 INFO L495 AbstractCegarLoop]: Abstraction has has 861 places, 1997 transitions, 20302 flow [2022-11-20 12:40:37,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 114 states have (on average 59.44736842105263) internal successors, (6777), 114 states have internal predecessors, (6777), 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-20 12:40:37,011 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:40:37,011 INFO L209 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, 1, 1, 1, 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-20 12:40:37,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:37,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:40:37,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:40:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash -494881520, now seen corresponding path program 4 times [2022-11-20 12:40:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:37,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260108245] [2022-11-20 12:40:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:43,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260108245] [2022-11-20 12:40:43,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260108245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:40:43,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162161231] [2022-11-20 12:40:43,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:40:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:43,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:40:43,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:40:43,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:40:43,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:40:43,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 12:40:43,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:48,357 INFO L350 Elim1Store]: Elim1 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-20 12:40:49,754 INFO L350 Elim1Store]: Elim1 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-20 12:40:50,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:40:50,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 12:40:51,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:40:51,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2022-11-20 12:40:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:51,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:40:56,462 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse2 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ c_~i~0 1)) (.cse4 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse7 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_244 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_244))) (or (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (< (select .cse0 .cse1) c_~i~0) (not (= c_~j~0 (select .cse0 .cse2))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse4) .cse5))))) (not (= c_~i~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7)))))) (forall ((v_ArrVal_244 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_244))) (or (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse8 (select .cse9 ~q1~0.base))) (or (not (= c_~j~0 (select .cse8 .cse2))) (< (select .cse8 .cse1) .cse5) (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse4) c_~i~0))))) (not (= c_~i~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7)))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-20 12:40:56,554 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ c_~i~0 1))) (and (forall ((v_ArrVal_244 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_244))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) c_~i~0) (not (= c_~j~0 (select .cse4 .cse5))) (< (select .cse4 .cse6) .cse7)))))))) (forall ((v_ArrVal_244 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_244))) (or (not (= c_~i~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (< (select .cse9 .cse6) c_~i~0) (not (= c_~j~0 (select .cse9 .cse5))) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) .cse7)))))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-20 12:40:56,649 WARN L837 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (let ((.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ c_~i~0 1))) (and (forall ((v_ArrVal_244 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_244))) (or (not (= c_~i~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) c_~i~0) (not (= c_~j~0 (select .cse4 .cse5))) (< (select .cse4 .cse6) .cse7)))))))) (forall ((v_ArrVal_244 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_244))) (or (not (= c_~i~0 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse9 (select .cse10 ~q1~0.base))) (or (< (select .cse9 .cse6) c_~i~0) (not (= c_~j~0 (select .cse9 .cse5))) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) .cse7)))))))))) (not (<= 0 c_~q2_back~0))) is different from false [2022-11-20 12:40:58,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:40:58,020 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 82 [2022-11-20 12:40:58,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:40:58,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 407 treesize of output 459 [2022-11-20 12:40:58,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:40:58,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 316 [2022-11-20 12:40:58,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:40:58,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 305 treesize of output 289 [2022-11-20 12:41:27,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:41:27,188 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 82 [2022-11-20 12:41:27,300 INFO L321 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-20 12:41:27,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 417 [2022-11-20 12:41:27,418 INFO L321 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-20 12:41:27,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 268 treesize of output 280 [2022-11-20 12:41:27,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:41:27,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 313 treesize of output 297 [2022-11-20 12:41:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 12:41:38,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162161231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:41:38,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:41:38,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 45, 40] total 118 [2022-11-20 12:41:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118755872] [2022-11-20 12:41:38,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:41:38,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-11-20 12:41:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:41:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-11-20 12:41:38,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=12095, Unknown=96, NotChecked=684, Total=13806 [2022-11-20 12:41:38,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 178 [2022-11-20 12:41:38,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 1997 transitions, 20302 flow. Second operand has 118 states, 118 states have (on average 59.347457627118644) internal successors, (7003), 118 states have internal predecessors, (7003), 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-20 12:41:38,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:41:38,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 178 [2022-11-20 12:41:38,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:42:05,850 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~q2_back~0 c_~q2_front~0) (= c_~i~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~q1_back~0 c_~q1_front~0) (= c_~q2_front~0 c_~q2_back~0) (<= c_~q1_front~0 c_~q1_back~0) (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0)) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (+ c_~i~0 1)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~i~0) (not (= (select .cse2 .cse3) c_~j~0)) (< (select .cse2 .cse4) .cse5))))) (forall ((~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse7 (select .cse6 ~q1~0.base))) (or (< (select (select .cse6 c_~q2~0.base) .cse1) .cse5) (< (select .cse7 .cse4) c_~i~0) (not (= (select .cse7 .cse3) c_~j~0))))))))) (<= c_~q2_front~0 c_~q2_back~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_~j~0 0)) is different from false [2022-11-20 12:43:08,658 INFO L130 PetriNetUnfolder]: 6590/12796 cut-off events. [2022-11-20 12:43:08,658 INFO L131 PetriNetUnfolder]: For 261136/261245 co-relation queries the response was YES. [2022-11-20 12:43:08,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94555 conditions, 12796 events. 6590/12796 cut-off events. For 261136/261245 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 114484 event pairs, 354 based on Foata normal form. 77/12837 useless extension candidates. Maximal degree in co-relation 94400. Up to 3172 conditions per place. [2022-11-20 12:43:09,087 INFO L137 encePairwiseOnDemand]: 118/178 looper letters, 1150 selfloop transitions, 2183 changer transitions 32/3416 dead transitions. [2022-11-20 12:43:09,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1068 places, 3416 transitions, 44708 flow [2022-11-20 12:43:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-11-20 12:43:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2022-11-20 12:43:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 13083 transitions. [2022-11-20 12:43:09,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.34345794392523366 [2022-11-20 12:43:09,107 INFO L72 ComplementDD]: Start complementDD. Operand 214 states and 13083 transitions. [2022-11-20 12:43:09,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 13083 transitions. [2022-11-20 12:43:09,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:43:09,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 214 states and 13083 transitions. [2022-11-20 12:43:09,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 215 states, 214 states have (on average 61.13551401869159) internal successors, (13083), 214 states have internal predecessors, (13083), 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-20 12:43:09,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 215 states, 215 states have (on average 178.0) internal successors, (38270), 215 states have internal predecessors, (38270), 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-20 12:43:09,171 INFO L81 ComplementDD]: Finished complementDD. Result has 215 states, 215 states have (on average 178.0) internal successors, (38270), 215 states have internal predecessors, (38270), 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-20 12:43:09,171 INFO L175 Difference]: Start difference. First operand has 861 places, 1997 transitions, 20302 flow. Second operand 214 states and 13083 transitions. [2022-11-20 12:43:09,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1068 places, 3416 transitions, 44708 flow [2022-11-20 12:43:12,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 3416 transitions, 41323 flow, removed 1388 selfloop flow, removed 61 redundant places. [2022-11-20 12:43:13,071 INFO L231 Difference]: Finished difference. Result has 1079 places, 2954 transitions, 36718 flow [2022-11-20 12:43:13,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=18435, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=214, PETRI_FLOW=36718, PETRI_PLACES=1079, PETRI_TRANSITIONS=2954} [2022-11-20 12:43:13,074 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 918 predicate places. [2022-11-20 12:43:13,074 INFO L495 AbstractCegarLoop]: Abstraction has has 1079 places, 2954 transitions, 36718 flow [2022-11-20 12:43:13,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 59.347457627118644) internal successors, (7003), 118 states have internal predecessors, (7003), 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-20 12:43:13,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:43:13,076 INFO L209 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, 1, 1, 1, 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-20 12:43:13,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 12:43:13,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 12:43:13,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:43:13,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:43:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash 991374206, now seen corresponding path program 5 times [2022-11-20 12:43:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:43:13,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459044035] [2022-11-20 12:43:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:43:13,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:43:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:43:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:43:22,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:43:22,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459044035] [2022-11-20 12:43:22,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459044035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:43:22,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698172632] [2022-11-20 12:43:22,552 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:43:22,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:43:22,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:43:22,553 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:43:22,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:43:22,735 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:43:22,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:43:22,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 12:43:22,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:43:24,624 INFO L350 Elim1Store]: Elim1 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-20 12:43:25,468 INFO L350 Elim1Store]: Elim1 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-20 12:43:25,661 INFO L350 Elim1Store]: Elim1 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-20 12:43:26,843 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-11-20 12:43:26,843 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 41 [2022-11-20 12:43:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:43:27,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:43:30,530 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q1_back~0 4)) (.cse3 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (forall ((~q2_back~0 Int) (~q2_front~0 Int)) (let ((.cse0 (select .cse1 c_~q2~0.base))) (or (< ~q2_back~0 ~q2_front~0) (not (< ~q2_back~0 c_~n2~0)) (< ~q2_front~0 0) (not (= c_~i~0 (select .cse0 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (< (select .cse0 (+ (* 4 ~q2_front~0) c_~q2~0.offset)) c_~j~0)))) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse1 ~q1~0.base))) (or (< (select .cse2 (+ .cse3 ~q1~0.offset)) (+ c_~j~0 1)) (not (= (select .cse2 (+ .cse4 ~q1~0.offset)) c_~j~0)))))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_281 (Array Int Int)) (~q1~0.base Int) (~q2_front~0 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse6 (select .cse8 c_~q2~0.base))) (let ((.cse5 (select .cse8 ~q1~0.base)) (.cse7 (select .cse6 (+ (* 4 ~q2_front~0) c_~q2~0.offset)))) (or (< ~q2_back~0 ~q2_front~0) (not (< ~q2_back~0 c_~n2~0)) (not (= (select .cse5 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< ~q2_front~0 0) (not (= c_~i~0 (select .cse6 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (< .cse7 (+ (select .cse5 (+ .cse3 ~q1~0.offset)) 1)) (< .cse7 c_~j~0)))))))) is different from false [2022-11-20 12:43:31,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~q1_back~0 4)) (.cse3 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (~q1~0.base Int) (~q2_front~0 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse0 (select .cse5 ~q1~0.base)) (.cse2 (select .cse4 (+ (* 4 ~q2_front~0) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) (or (not (= c_~j~0 (select .cse0 (+ .cse1 ~q1~0.offset)))) (< ~q2_back~0 ~q2_front~0) (not (< ~q2_back~0 c_~n2~0)) (< ~q2_front~0 0) (< .cse2 (+ (select .cse0 (+ .cse3 ~q1~0.offset)) 1)) (not (= (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4))) c_~i~0)) (< .cse2 c_~j~0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (not (= c_~j~0 (select .cse6 (+ .cse1 ~q1~0.offset)))) (< (select .cse6 (+ .cse3 ~q1~0.offset)) (+ c_~j~0 1))))) (forall ((~q2_back~0 Int) (~q2_front~0 Int)) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (< ~q2_back~0 ~q2_front~0) (not (< ~q2_back~0 c_~n2~0)) (< ~q2_front~0 0) (not (= (select .cse8 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4))) c_~i~0)) (< (select .cse8 (+ (* 4 ~q2_front~0) |c_ULTIMATE.start_main_#t~ret17#1.offset|)) c_~j~0))))))))) is different from false [2022-11-20 12:43:32,050 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~q1_front~0 4)) (.cse1 (* c_~q1_back~0 4))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ .cse1 ~q1~0.offset)))) (< (select .cse0 (+ .cse2 ~q1~0.offset)) (+ c_~j~0 1))))) (forall ((~q2_back~0 Int) (~q2_front~0 Int)) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< ~q2_back~0 ~q2_front~0) (not (< ~q2_back~0 c_~n2~0)) (< (select .cse4 (+ (* 4 ~q2_front~0) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~j~0) (< ~q2_front~0 0) (not (= c_~i~0 (select .cse4 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (~q1~0.base Int) (~q2_front~0 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse6 (select .cse8 ~q1~0.base)) (.cse5 (select .cse7 (+ (* 4 ~q2_front~0) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse5 (+ (select .cse6 (+ .cse2 ~q1~0.offset)) 1)) (not (= c_~j~0 (select .cse6 (+ .cse1 ~q1~0.offset)))) (< ~q2_back~0 ~q2_front~0) (not (< ~q2_back~0 c_~n2~0)) (< .cse5 c_~j~0) (< ~q2_front~0 0) (not (= c_~i~0 (select .cse7 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))))) is different from false [2022-11-20 12:43:36,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:43:36,490 INFO L350 Elim1Store]: Elim1 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 121 treesize of output 85 [2022-11-20 12:43:36,599 INFO L321 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2022-11-20 12:43:36,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 502 [2022-11-20 12:43:36,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:43:36,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:43:36,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 407 treesize of output 411 [2022-11-20 12:43:36,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:43:36,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:43:36,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 314 treesize of output 354 [2022-11-20 12:44:04,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:44:04,773 INFO L350 Elim1Store]: Elim1 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-20 12:44:04,860 INFO L321 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-20 12:44:04,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 649 treesize of output 611 [2022-11-20 12:44:04,951 INFO L321 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-20 12:44:04,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 561 treesize of output 477 [2022-11-20 12:44:05,049 INFO L321 Elim1Store]: treesize reduction 40, result has 55.1 percent of original size [2022-11-20 12:44:05,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 390 [2022-11-20 12:44:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-20 12:44:17,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698172632] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:44:17,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:44:17,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 33, 29] total 98 [2022-11-20 12:44:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566908600] [2022-11-20 12:44:17,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:44:17,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-11-20 12:44:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:44:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-11-20 12:44:17,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=8298, Unknown=53, NotChecked=564, Total=9506 [2022-11-20 12:44:17,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 178 [2022-11-20 12:44:17,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1079 places, 2954 transitions, 36718 flow. Second operand has 98 states, 98 states have (on average 55.96938775510204) internal successors, (5485), 98 states have internal predecessors, (5485), 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-20 12:44:17,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:44:17,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 178 [2022-11-20 12:44:17,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:45:08,239 INFO L130 PetriNetUnfolder]: 8910/17298 cut-off events. [2022-11-20 12:45:08,239 INFO L131 PetriNetUnfolder]: For 579956/580105 co-relation queries the response was YES. [2022-11-20 12:45:08,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153892 conditions, 17298 events. 8910/17298 cut-off events. For 579956/580105 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 161554 event pairs, 538 based on Foata normal form. 87/17353 useless extension candidates. Maximal degree in co-relation 153672. Up to 8695 conditions per place. [2022-11-20 12:45:09,076 INFO L137 encePairwiseOnDemand]: 123/178 looper letters, 2661 selfloop transitions, 2012 changer transitions 12/4732 dead transitions. [2022-11-20 12:45:09,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1199 places, 4732 transitions, 71314 flow [2022-11-20 12:45:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-20 12:45:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2022-11-20 12:45:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 7642 transitions. [2022-11-20 12:45:09,090 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.32524685052774943 [2022-11-20 12:45:09,090 INFO L72 ComplementDD]: Start complementDD. Operand 132 states and 7642 transitions. [2022-11-20 12:45:09,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 7642 transitions. [2022-11-20 12:45:09,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:45:09,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 132 states and 7642 transitions. [2022-11-20 12:45:09,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 133 states, 132 states have (on average 57.89393939393939) internal successors, (7642), 132 states have internal predecessors, (7642), 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-20 12:45:09,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 133 states, 133 states have (on average 178.0) internal successors, (23674), 133 states have internal predecessors, (23674), 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-20 12:45:09,132 INFO L81 ComplementDD]: Finished complementDD. Result has 133 states, 133 states have (on average 178.0) internal successors, (23674), 133 states have internal predecessors, (23674), 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-20 12:45:09,132 INFO L175 Difference]: Start difference. First operand has 1079 places, 2954 transitions, 36718 flow. Second operand 132 states and 7642 transitions. [2022-11-20 12:45:09,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1199 places, 4732 transitions, 71314 flow [2022-11-20 12:45:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1125 places, 4732 transitions, 68737 flow, removed 1160 selfloop flow, removed 74 redundant places. [2022-11-20 12:45:22,313 INFO L231 Difference]: Finished difference. Result has 1175 places, 3952 transitions, 57173 flow [2022-11-20 12:45:22,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=35159, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=132, PETRI_FLOW=57173, PETRI_PLACES=1175, PETRI_TRANSITIONS=3952} [2022-11-20 12:45:22,317 INFO L288 CegarLoopForPetriNet]: 161 programPoint places, 1014 predicate places. [2022-11-20 12:45:22,317 INFO L495 AbstractCegarLoop]: Abstraction has has 1175 places, 3952 transitions, 57173 flow [2022-11-20 12:45:22,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 55.96938775510204) internal successors, (5485), 98 states have internal predecessors, (5485), 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-20 12:45:22,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:45:22,319 INFO L209 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, 1, 1, 1, 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-20 12:45:22,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:22,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:45:22,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 12:45:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash 965845916, now seen corresponding path program 6 times [2022-11-20 12:45:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:22,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860769859] [2022-11-20 12:45:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:45:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:29,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860769859] [2022-11-20 12:45:29,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860769859] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:29,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570881207] [2022-11-20 12:45:29,686 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 12:45:29,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:45:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:45:29,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:45:29,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a4fa1ab-9f05-43b0-b30b-c189430afa2a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:45:29,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-20 12:45:29,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:45:29,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-20 12:45:29,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:34,055 INFO L350 Elim1Store]: Elim1 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-20 12:45:35,384 INFO L350 Elim1Store]: Elim1 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-20 12:45:36,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:45:36,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-20 12:45:36,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:45:36,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 34 [2022-11-20 12:45:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:45:37,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:44,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:45:44,954 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 82 [2022-11-20 12:45:45,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:45:45,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 325 treesize of output 385 [2022-11-20 12:45:45,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:45:45,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 261 treesize of output 257 [2022-11-20 12:45:45,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:45:45,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 270 [2022-11-20 12:46:03,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:46:03,090 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 82 [2022-11-20 12:46:03,185 INFO L321 Elim1Store]: treesize reduction 50, result has 50.5 percent of original size [2022-11-20 12:46:03,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 265 [2022-11-20 12:46:03,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:46:03,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:46:03,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 171 [2022-11-20 12:46:03,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:46:03,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:46:03,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 153 [2022-11-20 12:46:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:46:12,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570881207] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:46:12,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:46:12,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 45, 40] total 118 [2022-11-20 12:46:12,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603579799] [2022-11-20 12:46:12,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:46:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-11-20 12:46:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:46:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-11-20 12:46:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=12796, Unknown=15, NotChecked=0, Total=13806 [2022-11-20 12:46:12,682 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 178 [2022-11-20 12:46:12,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1175 places, 3952 transitions, 57173 flow. Second operand has 118 states, 118 states have (on average 59.36440677966102) internal successors, (7005), 118 states have internal predecessors, (7005), 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-20 12:46:12,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:46:12,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 178 [2022-11-20 12:46:12,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:46:47,387 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (not (<= 0 c_~q1_back~0))) (.cse5 (not (< c_~q2_back~0 c_~n2~0))) (.cse6 (not (< c_~q1_back~0 c_~n1~0))) (.cse7 (<= c_~n2~0 c_~q2_front~0)) (.cse8 (< c_~q2_front~0 0)) (.cse9 (not (<= 0 c_~q2_back~0))) (.cse2 (* c_~q2_back~0 4)) (.cse0 (* c_~q1_back~0 4)) (.cse1 (* c_~q1_front~0 4)) (.cse3 (* c_~q2_front~0 4)) (.cse17 (<= (+ c_~q2_front~0 1) 0))) (and (<= 0 c_~i~0) (= c_~i~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and (= .cse0 .cse1) (< c_~j~0 (+ c_~i~0 1)) (or (and (= .cse2 .cse3) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< c_~j~0 c_~i~0))) .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 .cse7 .cse8 .cse9) (<= c_~q1_back~0 c_~q1_front~0) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ .cse2 c_~q2~0.offset)))) (let ((.cse14 (+ c_~q2~0.offset .cse3)) (.cse11 (+ .cse1 c_~q1~0.offset)) (.cse12 (+ .cse0 c_~q1~0.offset))) (and (forall ((v_ArrVal_317 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (or (forall ((~q1~0.base Int)) (let ((.cse10 (select .cse13 ~q1~0.base))) (or (< (+ (select .cse10 .cse11) 1) c_~N~0) (not (= c_~j~0 (select .cse10 .cse12)))))) (< (select (select .cse13 c_~q2~0.base) .cse14) c_~N~0)))) (forall ((v_ArrVal_317 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (or (< (+ (select (select .cse15 c_~q2~0.base) .cse14) 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse16 (select .cse15 ~q1~0.base))) (or (< (select .cse16 .cse11) c_~N~0) (not (= c_~j~0 (select .cse16 .cse12)))))))))))) (or (<= c_~q2_back~0 c_~q2_front~0) (not .cse17)) (or .cse17 (<= c_~q2_front~0 c_~q2_back~0)) (<= c_~q1_front~0 c_~q1_back~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_~j~0 0))) is different from false [2022-11-20 12:46:47,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_~q1_back~0 4)) (.cse28 (* c_~q1_front~0 4))) (let ((.cse21 (+ .cse28 c_~q1~0.offset)) (.cse12 (<= c_~n1~0 1)) (.cse22 (+ .cse29 c_~q1~0.offset)) (.cse0 (+ c_~q1_front~0 c_~n1~0)) (.cse31 (<= (+ c_~q2_front~0 1) 0))) (let ((.cse11 (<= c_~q1_back~0 c_~q1_front~0)) (.cse5 (or .cse31 (<= c_~q2_front~0 c_~q2_back~0))) (.cse1 (<= .cse0 (+ c_~q1_back~0 1))) (.cse6 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse19 (* c_~q2_back~0 4)) (.cse27 (* c_~q2_front~0 4)) (.cse13 (not (<= 0 c_~q1_back~0))) (.cse14 (not (< c_~q2_back~0 c_~n2~0))) (.cse15 (not (< c_~q1_back~0 c_~n1~0))) (.cse16 (<= c_~n2~0 c_~q2_front~0)) (.cse17 (< c_~q2_front~0 0)) (.cse18 (not (<= 0 c_~q2_back~0))) (.cse3 (not (= .cse22 0))) (.cse4 (or (<= c_~q2_back~0 c_~q2_front~0) (not .cse31))) (.cse9 (<= c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse10 (or .cse31 (<= (+ c_~q2_front~0 c_~n2~0) (+ c_~q2_back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))) (.cse30 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse8 (or .cse12 (<= .cse22 0))) (.cse2 (not (= .cse21 0))) (.cse7 (= c_~j~0 0))) (and (<= 0 c_~i~0) (= c_~q1~0.offset 0) (= c_~i~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= .cse0 (+ c_~q1_back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse1 (or .cse2 (and (or .cse3 (and .cse4 .cse5 .cse6 .cse7)) .cse8)) (or (and (or .cse3 (and .cse4 .cse9 .cse10 .cse6 .cse7)) .cse8) .cse2) .cse11 .cse12 (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ .cse19 c_~q2~0.offset)))) (let ((.cse24 (+ c_~q2~0.offset .cse27))) (and (forall ((v_ArrVal_317 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (or (forall ((~q1~0.base Int)) (let ((.cse20 (select .cse23 ~q1~0.base))) (or (< (+ (select .cse20 .cse21) 1) c_~N~0) (not (= c_~j~0 (select .cse20 .cse22)))))) (< (select (select .cse23 c_~q2~0.base) .cse24) c_~N~0)))) (forall ((v_ArrVal_317 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (or (< (+ (select (select .cse25 c_~q2~0.base) .cse24) 1) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse26 (select .cse25 ~q1~0.base))) (or (< (select .cse26 .cse21) c_~N~0) (not (= c_~j~0 (select .cse26 .cse22)))))))))))) .cse4 (or .cse11 (< 0 (+ .cse28 c_~q1~0.offset 1))) .cse5 (= c_~q2_front~0 c_~q2_back~0) (<= c_~q1_front~0 c_~q1_back~0) (or .cse1 (<= .cse21 0)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse6 (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (<= c_~n1~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (= .cse29 .cse28) (< c_~j~0 (+ c_~i~0 1)) (or (and (= .cse19 .cse27) .cse30) (< c_~j~0 c_~i~0))) .cse13 .cse14 .cse15 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16 .cse17 .cse18) (or (and (or .cse3 (and .cse4 .cse9 .cse10 .cse30 .cse7)) .cse8) .cse2) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse7)))) is different from false [2022-11-20 12:47:35,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~i~0 1)) (.cse51 (* c_~q1_back~0 4)) (.cse35 (* c_~q1_front~0 4)) (.cse29 (* c_~q2_back~0 4)) (.cse30 (* c_~q2_front~0 4))) (let ((.cse32 (= .cse29 .cse30)) (.cse50 (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|))) (.cse33 (< c_~j~0 c_~i~0)) (.cse31 (= .cse51 .cse35)) (.cse34 (< c_~j~0 .cse6))) (let ((.cse18 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse20 (<= 1 c_~N~0)) (.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse1 (and (or .cse50 .cse33) .cse31 .cse34)) (.cse16 (+ .cse29 c_~q2~0.offset)) (.cse8 (+ c_~q2~0.offset .cse30)) (.cse9 (+ .cse51 c_~q1~0.offset)) (.cse5 (+ .cse35 c_~q1~0.offset)) (.cse19 (and .cse31 (or (and .cse50 .cse32) .cse33) .cse34)) (.cse17 (and .cse31 .cse34 (or (and .cse32 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse33))) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse2 (not (< c_~q2_back~0 c_~n2~0))) (.cse3 (not (< c_~q1_back~0 c_~n1~0))) (.cse12 (<= c_~n2~0 c_~q2_front~0)) (.cse13 (< c_~q2_front~0 0)) (.cse14 (not (<= 0 c_~q2_back~0)))) (and (= c_~q2~0.offset 0) (<= 0 c_~i~0) (or .cse0 (< 0 c_~q1_back~0) .cse1) (= c_~q1~0.offset 0) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse4 (select .cse7 ~q1~0.base))) (or (< (select .cse4 .cse5) .cse6) (< (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0) (not (= c_~j~0 (select .cse4 .cse9))))))) (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse8) .cse6) (< (select .cse11 .cse5) c_~i~0) (not (= c_~j~0 (select .cse11 .cse9)))))))) .cse12 .cse13 .cse14 (not (= c_~i~0 (select .cse15 .cse16)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (< c_~i~0 c_~N~0)) (or .cse17 .cse0 .cse18 .cse2 .cse3 .cse12 .cse13 .cse14) (or .cse0 .cse18 .cse2 .cse3 .cse12 .cse19 .cse13 .cse14) .cse20 (or .cse0 .cse2 .cse3 (let ((.cse22 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse30)) (.cse25 (+ .cse29 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse21 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse23 (select .cse21 ~q1~0.base))) (or (< (select (select .cse21 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse22) c_~i~0) (< (select .cse23 .cse5) .cse6) (not (= c_~j~0 (select .cse23 .cse9))))))) (not (= (select (select .cse24 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse25) c_~i~0))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse26 (select .cse27 ~q1~0.base))) (or (not (= c_~j~0 (select .cse26 .cse9))) (< (select (select .cse27 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse22) .cse6) (< (select .cse26 .cse5) c_~i~0))))) (not (= (select (select .cse28 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse25) c_~i~0))))))) .cse12 .cse13 .cse14) (or .cse0 (and .cse31 (or (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|)) .cse32) .cse33) .cse34) .cse18 .cse2 .cse3 .cse12 .cse13 .cse14) (or (not (= .cse5 0)) (and (or (not (= .cse9 0)) (and (< 0 (+ c_~q2_front~0 1)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (<= c_~q2_front~0 0) .cse20 (= (select .cse15 .cse8) 0) (= c_~j~0 0))) (or (<= c_~n1~0 1) (<= .cse9 0)))) (<= c_~j~0 c_~N~0) (or (<= c_~q1_back~0 c_~q1_front~0) (< 0 (+ .cse35 c_~q1~0.offset 1))) (or (< 0 c_~q2_front~0) .cse0 .cse3 (< 0 c_~q2_back~0) .cse1 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse12 .cse13 .cse14 (let ((.cse38 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse40 (+ .cse29 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse36 (select .cse37 ~q1~0.base))) (or (not (= c_~j~0 (select .cse36 .cse9))) (< (select .cse36 .cse5) c_~i~0) (< (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse38) .cse6))))) (not (= (select (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse40) c_~i~0))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse41 (select .cse42 ~q1~0.base))) (or (< (select .cse41 .cse5) .cse6) (not (= c_~j~0 (select .cse41 .cse9))) (< (select (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse38) c_~i~0))))) (not (= (select (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse40) c_~i~0)))))))) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (not (= (select (select .cse44 c_~q2~0.base) .cse16) c_~i~0)) (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse45 (store .cse44 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse46 (select .cse45 ~q1~0.base))) (or (< (select (select .cse45 c_~q2~0.base) .cse8) .cse6) (not (= c_~j~0 (select .cse46 .cse9))) (< (select .cse46 .cse5) c_~i~0)))))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (not (= (select (select .cse47 c_~q2~0.base) .cse16) c_~i~0)) (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse49 (store .cse47 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse48 (select .cse49 ~q1~0.base))) (or (< (select .cse48 .cse5) .cse6) (< (select (select .cse49 c_~q2~0.base) .cse8) c_~i~0) (not (= c_~j~0 (select .cse48 .cse9))))))))))) .cse12 .cse13 .cse14) (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 1)) (<= .cse5 0)) (<= c_~j~0 0) (or .cse0 .cse2 .cse3 .cse12 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse19 .cse13 .cse14) (or .cse17 .cse0 .cse2 .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12 .cse13 .cse14) (<= c_~i~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-11-20 12:48:35,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~i~0 1)) (.cse59 (* c_~q1_back~0 4)) (.cse43 (* c_~q1_front~0 4)) (.cse25 (* c_~q2_back~0 4)) (.cse26 (* c_~q2_front~0 4))) (let ((.cse40 (= .cse25 .cse26)) (.cse58 (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|))) (.cse41 (< c_~j~0 c_~i~0)) (.cse39 (= .cse59 .cse43)) (.cse42 (< c_~j~0 .cse6))) (let ((.cse28 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse30 (<= 1 c_~N~0)) (.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse1 (and (or .cse58 .cse41) .cse39 .cse42)) (.cse16 (+ .cse25 c_~q2~0.offset)) (.cse8 (+ c_~q2~0.offset .cse26)) (.cse9 (+ .cse59 c_~q1~0.offset)) (.cse5 (+ .cse43 c_~q1~0.offset)) (.cse29 (and .cse39 (or (and .cse58 .cse40) .cse41) .cse42)) (.cse27 (and .cse39 .cse42 (or (and .cse40 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse41))) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse2 (not (< c_~q2_back~0 c_~n2~0))) (.cse3 (not (< c_~q1_back~0 c_~n1~0))) (.cse12 (<= c_~n2~0 c_~q2_front~0)) (.cse13 (< c_~q2_front~0 0)) (.cse14 (not (<= 0 c_~q2_back~0)))) (and (= c_~q2~0.offset 0) (<= 0 c_~i~0) (or .cse0 (< 0 c_~q1_back~0) .cse1) (= c_~q1~0.offset 0) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse4 (select .cse7 ~q1~0.base))) (or (< (select .cse4 .cse5) .cse6) (< (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0) (not (= c_~j~0 (select .cse4 .cse9))))))) (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse8) .cse6) (< (select .cse11 .cse5) c_~i~0) (not (= c_~j~0 (select .cse11 .cse9)))))))) .cse12 .cse13 .cse14 (not (= c_~i~0 (select .cse15 .cse16)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (< c_~i~0 c_~N~0)) (or .cse0 (let ((.cse19 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse21 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse17 (select .cse18 ~q1~0.base))) (or (not (= c_~j~0 (select .cse17 .cse9))) (< (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) .cse6) (< (select .cse17 .cse5) c_~i~0))))) (not (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) c_~i~0))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse23 (select .cse22 ~q1~0.base))) (or (< (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19) c_~i~0) (< (select .cse23 .cse5) .cse6) (not (= c_~j~0 (select .cse23 .cse9))))))) (not (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse21) c_~i~0))))))) .cse2 .cse3 .cse12 .cse13 .cse14) (or .cse27 .cse0 .cse28 .cse2 .cse3 .cse12 .cse13 .cse14) (or .cse0 .cse28 .cse2 .cse3 .cse12 .cse29 .cse13 .cse14) .cse30 (or .cse0 .cse2 .cse3 (let ((.cse32 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse26)) (.cse35 (+ .cse25 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse31 (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse33 (select .cse31 ~q1~0.base))) (or (< (select (select .cse31 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse32) c_~i~0) (< (select .cse33 .cse5) .cse6) (not (= c_~j~0 (select .cse33 .cse9))))))) (not (= (select (select .cse34 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse35) c_~i~0))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse36 (select .cse37 ~q1~0.base))) (or (not (= c_~j~0 (select .cse36 .cse9))) (< (select (select .cse37 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse32) .cse6) (< (select .cse36 .cse5) c_~i~0))))) (not (= (select (select .cse38 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse35) c_~i~0))))))) .cse12 .cse13 .cse14) (or .cse0 (and .cse39 (or (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|)) .cse40) .cse41) .cse42) .cse28 .cse2 .cse3 .cse12 .cse13 .cse14) (or (not (= .cse5 0)) (and (or (not (= .cse9 0)) (and (< 0 (+ c_~q2_front~0 1)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (<= c_~q2_front~0 0) .cse30 (= (select .cse15 .cse8) 0) (= c_~j~0 0))) (or (<= c_~n1~0 1) (<= .cse9 0)))) (<= c_~j~0 c_~N~0) (or (<= c_~q1_back~0 c_~q1_front~0) (< 0 (+ .cse43 c_~q1~0.offset 1))) (or (< 0 c_~q2_front~0) .cse0 .cse3 (< 0 c_~q2_back~0) .cse1 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse12 .cse13 .cse14 (let ((.cse46 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse48 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse45 (store .cse47 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse44 (select .cse45 ~q1~0.base))) (or (not (= c_~j~0 (select .cse44 .cse9))) (< (select .cse44 .cse5) c_~i~0) (< (select (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse46) .cse6))))) (not (= (select (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse48) c_~i~0))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse50 (store .cse51 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse49 (select .cse50 ~q1~0.base))) (or (< (select .cse49 .cse5) .cse6) (not (= c_~j~0 (select .cse49 .cse9))) (< (select (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse46) c_~i~0))))) (not (= (select (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse48) c_~i~0)))))))) (or .cse0 .cse2 .cse3 (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (not (= (select (select .cse52 c_~q2~0.base) .cse16) c_~i~0)) (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse53 (store .cse52 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse54 (select .cse53 ~q1~0.base))) (or (< (select (select .cse53 c_~q2~0.base) .cse8) .cse6) (not (= c_~j~0 (select .cse54 .cse9))) (< (select .cse54 .cse5) c_~i~0)))))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_316))) (or (not (= (select (select .cse55 c_~q2~0.base) .cse16) c_~i~0)) (forall ((v_ArrVal_317 (Array Int Int)) (~q1~0.base Int)) (let ((.cse57 (store .cse55 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_317))) (let ((.cse56 (select .cse57 ~q1~0.base))) (or (< (select .cse56 .cse5) .cse6) (< (select (select .cse57 c_~q2~0.base) .cse8) c_~i~0) (not (= c_~j~0 (select .cse56 .cse9))))))))))) .cse12 .cse13 .cse14) (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 1)) (<= .cse5 0)) (<= c_~j~0 0) (or .cse0 .cse2 .cse3 .cse12 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse29 .cse13 .cse14) (or .cse27 .cse0 .cse2 .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12 .cse13 .cse14) (<= c_~i~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false