./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8 --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 23bd321b64eb98f17ff91aefc669d9f5b78966b876ea50803bd27f8c9b624679 --- 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-2329fc7 [2022-12-13 17:29:58,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:29:58,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:29:58,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:29:58,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:29:58,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:29:58,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:29:58,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:29:58,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:29:58,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:29:58,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:29:58,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:29:58,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:29:58,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:29:58,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:29:58,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:29:58,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:29:58,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:29:58,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:29:58,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:29:58,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:29:58,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:29:58,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:29:58,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:29:58,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:29:58,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:29:58,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:29:58,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:29:58,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:29:58,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:29:58,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:29:58,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:29:58,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:29:58,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:29:58,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:29:58,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:29:58,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:29:58,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:29:58,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:29:58,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:29:58,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:29:58,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:29:58,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:29:58,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:29:58,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:29:58,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:29:58,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:29:58,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:29:58,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:29:58,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:29:58,348 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:29:58,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:29:58,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:29:58,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:29:58,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:29:58,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:29:58,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:29:58,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:29:58,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:29:58,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:29:58,351 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:29:58,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:29:58,351 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:29:58,351 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/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_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8 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 -> 23bd321b64eb98f17ff91aefc669d9f5b78966b876ea50803bd27f8c9b624679 [2022-12-13 17:29:58,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:29:58,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:29:58,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:29:58,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:29:58,533 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:29:58,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2022-12-13 17:30:01,064 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:30:01,239 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:30:01,240 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2022-12-13 17:30:01,244 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/data/cb03ac0e7/ac2a2e50d4c54f8cb73130a9b0e93a6c/FLAG847239a6f [2022-12-13 17:30:01,255 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/data/cb03ac0e7/ac2a2e50d4c54f8cb73130a9b0e93a6c [2022-12-13 17:30:01,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:30:01,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:30:01,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:30:01,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:30:01,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:30:01,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aea223b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01, skipping insertion in model container [2022-12-13 17:30:01,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:30:01,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:30:01,423 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_cf9ee20a-cb05-44af-9989-301bba643e0e/sv-benchmarks/c/weaver/array-eq-trans.wvr.c[2737,2750] [2022-12-13 17:30:01,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:30:01,436 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:30:01,454 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_cf9ee20a-cb05-44af-9989-301bba643e0e/sv-benchmarks/c/weaver/array-eq-trans.wvr.c[2737,2750] [2022-12-13 17:30:01,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:30:01,467 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:30:01,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01 WrapperNode [2022-12-13 17:30:01,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:30:01,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:30:01,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:30:01,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:30:01,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,497 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 204 [2022-12-13 17:30:01,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:30:01,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:30:01,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:30:01,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:30:01,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,518 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:30:01,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:30:01,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:30:01,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:30:01,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (1/1) ... [2022-12-13 17:30:01,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:30:01,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:30:01,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:30:01,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:30:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 17:30:01,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 17:30:01,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 17:30:01,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:30:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:30:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:30:01,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:30:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:30:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:30:01,583 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 17:30:01,667 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:30:01,669 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:30:01,992 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:30:02,014 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:30:02,015 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 17:30:02,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:30:02 BoogieIcfgContainer [2022-12-13 17:30:02,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:30:02,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:30:02,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:30:02,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:30:02,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:30:01" (1/3) ... [2022-12-13 17:30:02,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c78c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:30:02, skipping insertion in model container [2022-12-13 17:30:02,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:30:01" (2/3) ... [2022-12-13 17:30:02,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c78c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:30:02, skipping insertion in model container [2022-12-13 17:30:02,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:30:02" (3/3) ... [2022-12-13 17:30:02,027 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2022-12-13 17:30:02,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 17:30:02,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:30:02,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:30:02,050 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:30:02,118 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 17:30:02,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 306 transitions, 636 flow [2022-12-13 17:30:02,254 INFO L130 PetriNetUnfolder]: 30/303 cut-off events. [2022-12-13 17:30:02,254 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 17:30:02,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 303 events. 30/303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 235 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 201. Up to 3 conditions per place. [2022-12-13 17:30:02,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 306 transitions, 636 flow [2022-12-13 17:30:02,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 292 transitions, 602 flow [2022-12-13 17:30:02,271 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:30:02,282 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 292 transitions, 602 flow [2022-12-13 17:30:02,285 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 292 transitions, 602 flow [2022-12-13 17:30:02,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 292 transitions, 602 flow [2022-12-13 17:30:02,349 INFO L130 PetriNetUnfolder]: 30/292 cut-off events. [2022-12-13 17:30:02,349 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 17:30:02,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 292 events. 30/292 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 234 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 201. Up to 3 conditions per place. [2022-12-13 17:30:02,353 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2022-12-13 17:30:10,932 INFO L134 LiptonReduction]: Checked pairs total: 3880 [2022-12-13 17:30:10,932 INFO L136 LiptonReduction]: Total number of compositions: 342 [2022-12-13 17:30:10,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:30:10,946 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;@21832b98, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:30:10,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 17:30:10,950 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-13 17:30:10,950 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 17:30:10,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:10,951 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:30:10,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash -221870955, now seen corresponding path program 1 times [2022-12-13 17:30:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:10,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594713009] [2022-12-13 17:30:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:30:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:11,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594713009] [2022-12-13 17:30:11,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594713009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:30:11,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:30:11,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:30:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387501174] [2022-12-13 17:30:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:30:11,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:30:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:30:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:30:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:30:11,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 648 [2022-12-13 17:30:11,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 266.1666666666667) internal successors, (1597), 6 states have internal predecessors, (1597), 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-12-13 17:30:11,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:30:11,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 648 [2022-12-13 17:30:11,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:30:12,100 INFO L130 PetriNetUnfolder]: 563/806 cut-off events. [2022-12-13 17:30:12,101 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 17:30:12,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 806 events. 563/806 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2400 event pairs, 279 based on Foata normal form. 2/522 useless extension candidates. Maximal degree in co-relation 490. Up to 289 conditions per place. [2022-12-13 17:30:12,104 INFO L137 encePairwiseOnDemand]: 639/648 looper letters, 28 selfloop transitions, 2 changer transitions 49/79 dead transitions. [2022-12-13 17:30:12,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 79 transitions, 370 flow [2022-12-13 17:30:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:30:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:30:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1924 transitions. [2022-12-13 17:30:12,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42416225749559083 [2022-12-13 17:30:12,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1924 transitions. [2022-12-13 17:30:12,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1924 transitions. [2022-12-13 17:30:12,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:30:12,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1924 transitions. [2022-12-13 17:30:12,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 274.85714285714283) internal successors, (1924), 7 states have internal predecessors, (1924), 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-12-13 17:30:12,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 648.0) internal successors, (5184), 8 states have internal predecessors, (5184), 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-12-13 17:30:12,148 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 648.0) internal successors, (5184), 8 states have internal predecessors, (5184), 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-12-13 17:30:12,150 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 76 flow. Second operand 7 states and 1924 transitions. [2022-12-13 17:30:12,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 79 transitions, 370 flow [2022-12-13 17:30:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 79 transitions, 334 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 17:30:12,157 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 94 flow [2022-12-13 17:30:12,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 17:30:12,162 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2022-12-13 17:30:12,162 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 94 flow [2022-12-13 17:30:12,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.1666666666667) internal successors, (1597), 6 states have internal predecessors, (1597), 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-12-13 17:30:12,164 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:12,164 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] [2022-12-13 17:30:12,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:30:12,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2123477814, now seen corresponding path program 1 times [2022-12-13 17:30:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:12,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931310280] [2022-12-13 17:30:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:30:12,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:12,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931310280] [2022-12-13 17:30:12,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931310280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:12,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450762034] [2022-12-13 17:30:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:12,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:30:12,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:30:12,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:30:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:12,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:30:12,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:30:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:30:12,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:30:12,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:12,644 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 19 treesize of output 15 [2022-12-13 17:30:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:30:12,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450762034] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:12,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:30:12,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 9 [2022-12-13 17:30:12,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000289547] [2022-12-13 17:30:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:30:12,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:30:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:30:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:30:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:30:12,824 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 648 [2022-12-13 17:30:12,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 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-12-13 17:30:12,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:30:12,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 648 [2022-12-13 17:30:12,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:30:12,973 INFO L130 PetriNetUnfolder]: 400/578 cut-off events. [2022-12-13 17:30:12,973 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-13 17:30:12,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 578 events. 400/578 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1701 event pairs, 93 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1308. Up to 268 conditions per place. [2022-12-13 17:30:12,976 INFO L137 encePairwiseOnDemand]: 642/648 looper letters, 44 selfloop transitions, 4 changer transitions 17/65 dead transitions. [2022-12-13 17:30:12,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 65 transitions, 316 flow [2022-12-13 17:30:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:30:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:30:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1356 transitions. [2022-12-13 17:30:12,981 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2022-12-13 17:30:12,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1356 transitions. [2022-12-13 17:30:12,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1356 transitions. [2022-12-13 17:30:12,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:30:12,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1356 transitions. [2022-12-13 17:30:12,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 271.2) internal successors, (1356), 5 states have internal predecessors, (1356), 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-12-13 17:30:12,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 648.0) internal successors, (3888), 6 states have internal predecessors, (3888), 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-12-13 17:30:12,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 648.0) internal successors, (3888), 6 states have internal predecessors, (3888), 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-12-13 17:30:12,994 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 94 flow. Second operand 5 states and 1356 transitions. [2022-12-13 17:30:12,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 65 transitions, 316 flow [2022-12-13 17:30:12,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 65 transitions, 282 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-13 17:30:12,998 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 94 flow [2022-12-13 17:30:12,998 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2022-12-13 17:30:12,999 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2022-12-13 17:30:12,999 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 94 flow [2022-12-13 17:30:13,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 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-12-13 17:30:13,000 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:13,000 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] [2022-12-13 17:30:13,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:30:13,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:13,201 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1453518099, now seen corresponding path program 1 times [2022-12-13 17:30:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:13,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935223043] [2022-12-13 17:30:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:30:13,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:13,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935223043] [2022-12-13 17:30:13,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935223043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:30:13,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:30:13,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:30:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983260011] [2022-12-13 17:30:13,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:30:13,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:30:13,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:30:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:30:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:30:13,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 648 [2022-12-13 17:30:13,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 271.2) internal successors, (1356), 5 states have internal predecessors, (1356), 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-12-13 17:30:13,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:30:13,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 648 [2022-12-13 17:30:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:30:13,606 INFO L130 PetriNetUnfolder]: 513/757 cut-off events. [2022-12-13 17:30:13,606 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-13 17:30:13,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 757 events. 513/757 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2361 event pairs, 119 based on Foata normal form. 40/581 useless extension candidates. Maximal degree in co-relation 1713. Up to 401 conditions per place. [2022-12-13 17:30:13,610 INFO L137 encePairwiseOnDemand]: 641/648 looper letters, 47 selfloop transitions, 4 changer transitions 29/80 dead transitions. [2022-12-13 17:30:13,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 80 transitions, 369 flow [2022-12-13 17:30:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:30:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:30:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1683 transitions. [2022-12-13 17:30:13,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43287037037037035 [2022-12-13 17:30:13,616 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1683 transitions. [2022-12-13 17:30:13,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1683 transitions. [2022-12-13 17:30:13,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:30:13,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1683 transitions. [2022-12-13 17:30:13,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-12-13 17:30:13,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 648.0) internal successors, (4536), 7 states have internal predecessors, (4536), 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-12-13 17:30:13,630 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 648.0) internal successors, (4536), 7 states have internal predecessors, (4536), 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-12-13 17:30:13,630 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 94 flow. Second operand 6 states and 1683 transitions. [2022-12-13 17:30:13,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 80 transitions, 369 flow [2022-12-13 17:30:13,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 80 transitions, 359 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 17:30:13,633 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 120 flow [2022-12-13 17:30:13,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-13 17:30:13,634 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2022-12-13 17:30:13,634 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 120 flow [2022-12-13 17:30:13,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 271.2) internal successors, (1356), 5 states have internal predecessors, (1356), 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-12-13 17:30:13,635 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:13,635 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] [2022-12-13 17:30:13,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:30:13,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1501323779, now seen corresponding path program 1 times [2022-12-13 17:30:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:13,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795794886] [2022-12-13 17:30:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:30:13,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:13,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795794886] [2022-12-13 17:30:13,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795794886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:13,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292608489] [2022-12-13 17:30:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:13,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:13,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:30:13,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:30:13,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:30:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:13,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:30:13,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:30:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:30:13,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:30:13,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:13,992 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 19 treesize of output 15 [2022-12-13 17:30:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:30:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292608489] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:14,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:30:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2022-12-13 17:30:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335811467] [2022-12-13 17:30:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:30:14,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:30:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:30:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:30:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:30:14,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 648 [2022-12-13 17:30:14,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 261.6666666666667) internal successors, (1570), 6 states have internal predecessors, (1570), 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-12-13 17:30:14,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:30:14,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 648 [2022-12-13 17:30:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:30:14,471 INFO L130 PetriNetUnfolder]: 1042/1563 cut-off events. [2022-12-13 17:30:14,472 INFO L131 PetriNetUnfolder]: For 794/794 co-relation queries the response was YES. [2022-12-13 17:30:14,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1563 events. 1042/1563 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6229 event pairs, 253 based on Foata normal form. 3/1165 useless extension candidates. Maximal degree in co-relation 3787. Up to 538 conditions per place. [2022-12-13 17:30:14,479 INFO L137 encePairwiseOnDemand]: 641/648 looper letters, 64 selfloop transitions, 6 changer transitions 17/87 dead transitions. [2022-12-13 17:30:14,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 87 transitions, 480 flow [2022-12-13 17:30:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:30:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:30:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1885 transitions. [2022-12-13 17:30:14,483 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41556437389770723 [2022-12-13 17:30:14,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1885 transitions. [2022-12-13 17:30:14,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1885 transitions. [2022-12-13 17:30:14,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:30:14,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1885 transitions. [2022-12-13 17:30:14,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 269.2857142857143) internal successors, (1885), 7 states have internal predecessors, (1885), 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-12-13 17:30:14,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 648.0) internal successors, (5184), 8 states have internal predecessors, (5184), 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-12-13 17:30:14,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 648.0) internal successors, (5184), 8 states have internal predecessors, (5184), 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-12-13 17:30:14,506 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 120 flow. Second operand 7 states and 1885 transitions. [2022-12-13 17:30:14,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 87 transitions, 480 flow [2022-12-13 17:30:14,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 87 transitions, 455 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 17:30:14,509 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 138 flow [2022-12-13 17:30:14,509 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 17:30:14,510 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2022-12-13 17:30:14,510 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 138 flow [2022-12-13 17:30:14,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 261.6666666666667) internal successors, (1570), 6 states have internal predecessors, (1570), 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-12-13 17:30:14,511 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:14,511 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] [2022-12-13 17:30:14,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:30:14,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:14,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash -714850102, now seen corresponding path program 1 times [2022-12-13 17:30:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:14,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182920411] [2022-12-13 17:30:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:30:14,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:14,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182920411] [2022-12-13 17:30:14,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182920411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:30:14,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:30:14,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:30:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147212720] [2022-12-13 17:30:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:30:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:30:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:30:14,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:30:14,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:30:14,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 648 [2022-12-13 17:30:14,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 271.6) internal successors, (1358), 5 states have internal predecessors, (1358), 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-12-13 17:30:14,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:30:14,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 648 [2022-12-13 17:30:14,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:30:15,150 INFO L130 PetriNetUnfolder]: 991/1513 cut-off events. [2022-12-13 17:30:15,150 INFO L131 PetriNetUnfolder]: For 780/780 co-relation queries the response was YES. [2022-12-13 17:30:15,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 1513 events. 991/1513 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5923 event pairs, 308 based on Foata normal form. 54/1386 useless extension candidates. Maximal degree in co-relation 3949. Up to 819 conditions per place. [2022-12-13 17:30:15,161 INFO L137 encePairwiseOnDemand]: 642/648 looper letters, 50 selfloop transitions, 4 changer transitions 17/71 dead transitions. [2022-12-13 17:30:15,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 396 flow [2022-12-13 17:30:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:30:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:30:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1399 transitions. [2022-12-13 17:30:15,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43179012345679013 [2022-12-13 17:30:15,168 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1399 transitions. [2022-12-13 17:30:15,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1399 transitions. [2022-12-13 17:30:15,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:30:15,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1399 transitions. [2022-12-13 17:30:15,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 279.8) internal successors, (1399), 5 states have internal predecessors, (1399), 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-12-13 17:30:15,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 648.0) internal successors, (3888), 6 states have internal predecessors, (3888), 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-12-13 17:30:15,182 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 648.0) internal successors, (3888), 6 states have internal predecessors, (3888), 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-12-13 17:30:15,182 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 138 flow. Second operand 5 states and 1399 transitions. [2022-12-13 17:30:15,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 396 flow [2022-12-13 17:30:15,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 388 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 17:30:15,186 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 150 flow [2022-12-13 17:30:15,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-13 17:30:15,187 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2022-12-13 17:30:15,187 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 150 flow [2022-12-13 17:30:15,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 271.6) internal successors, (1358), 5 states have internal predecessors, (1358), 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-12-13 17:30:15,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:15,188 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] [2022-12-13 17:30:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:30:15,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1025864614, now seen corresponding path program 1 times [2022-12-13 17:30:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:15,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899025586] [2022-12-13 17:30:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:30:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899025586] [2022-12-13 17:30:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899025586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096445299] [2022-12-13 17:30:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:30:15,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:30:15,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:30:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:15,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 17:30:15,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:30:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:30:16,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:30:16,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:16,377 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 92 treesize of output 284 [2022-12-13 17:30:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:30:34,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096445299] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:34,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:30:34,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2022-12-13 17:30:34,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745210143] [2022-12-13 17:30:34,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:30:34,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:30:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:30:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:30:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:30:34,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 648 [2022-12-13 17:30:34,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 254.42857142857142) internal successors, (1781), 7 states have internal predecessors, (1781), 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-12-13 17:30:34,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:30:34,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 648 [2022-12-13 17:30:34,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:30:34,994 INFO L130 PetriNetUnfolder]: 1026/1532 cut-off events. [2022-12-13 17:30:34,994 INFO L131 PetriNetUnfolder]: For 1075/1075 co-relation queries the response was YES. [2022-12-13 17:30:34,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4161 conditions, 1532 events. 1026/1532 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6097 event pairs, 197 based on Foata normal form. 1/1348 useless extension candidates. Maximal degree in co-relation 4132. Up to 1353 conditions per place. [2022-12-13 17:30:34,999 INFO L137 encePairwiseOnDemand]: 643/648 looper letters, 49 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2022-12-13 17:30:34,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 316 flow [2022-12-13 17:30:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:30:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:30:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2022-12-13 17:30:35,001 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2022-12-13 17:30:35,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 801 transitions. [2022-12-13 17:30:35,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 801 transitions. [2022-12-13 17:30:35,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:30:35,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 801 transitions. [2022-12-13 17:30:35,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-12-13 17:30:35,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 648.0) internal successors, (2592), 4 states have internal predecessors, (2592), 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-12-13 17:30:35,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 648.0) internal successors, (2592), 4 states have internal predecessors, (2592), 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-12-13 17:30:35,014 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 150 flow. Second operand 3 states and 801 transitions. [2022-12-13 17:30:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 316 flow [2022-12-13 17:30:35,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 307 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 17:30:35,018 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 180 flow [2022-12-13 17:30:35,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-13 17:30:35,019 INFO L288 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2022-12-13 17:30:35,019 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 180 flow [2022-12-13 17:30:35,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 254.42857142857142) internal successors, (1781), 7 states have internal predecessors, (1781), 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-12-13 17:30:35,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:30:35,020 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] [2022-12-13 17:30:35,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:30:35,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:35,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 17:30:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:30:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash -191880804, now seen corresponding path program 1 times [2022-12-13 17:30:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:30:35,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841685788] [2022-12-13 17:30:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:30:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:30:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:30:36,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841685788] [2022-12-13 17:30:36,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841685788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:30:36,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121554892] [2022-12-13 17:30:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:30:36,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:30:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:30:36,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:30:36,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf9ee20a-cb05-44af-9989-301bba643e0e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:30:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:30:36,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 17:30:36,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:30:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,176 INFO L321 Elim1Store]: treesize reduction 55, result has 25.7 percent of original size [2022-12-13 17:30:36,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 29 [2022-12-13 17:30:36,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,288 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-12-13 17:30:36,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 49 [2022-12-13 17:30:36,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 17:30:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,481 INFO L321 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2022-12-13 17:30:36,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 56 [2022-12-13 17:30:36,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-12-13 17:30:36,738 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 6 treesize of output 5 [2022-12-13 17:30:36,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:36,903 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 18 treesize of output 20 [2022-12-13 17:30:37,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:30:37,127 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:30:37,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2022-12-13 17:30:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:30:37,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:30:38,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~i_BC~0 4)) (.cse16 (* c_~i_AB~0 4))) (let ((.cse9 (+ c_~B~0.offset .cse16)) (.cse11 (+ c_~A~0.offset .cse16)) (.cse0 (not (= c_~i_AB~0 c_~An~0))) (.cse2 (+ c_~C~0.offset .cse15)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) (+ .cse15 c_~B~0.offset))) (.cse13 (= c_~An~0 c_~i_AC~0))) (and (or (let ((.cse12 (* c_~i_AC~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse12)) (.cse6 (+ c_~C~0.offset .cse12))) (and (or .cse0 (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse4 ~C~0.base))) (or (< (select .cse1 .cse2) .cse3) (<= (select (select .cse4 c_~A~0.base) .cse5) (select .cse1 .cse6))))))) (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse10 (select .cse8 c_~A~0.base)) (.cse7 (select .cse8 ~C~0.base))) (or (< (select .cse7 .cse2) .cse3) (< (select (select .cse8 c_~B~0.base) .cse9) (select .cse10 .cse11)) (<= (select .cse10 .cse5) (select .cse7 .cse6))))))))) .cse13) (or (and (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (or (< (select (select .cse14 ~C~0.base) .cse2) .cse3) (< (select (select .cse14 c_~B~0.base) .cse9) (select (select .cse14 c_~A~0.base) .cse11))))) (or .cse0 (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) ~C~0.base) .cse2) .cse3)))) (< c_~i_AC~0 c_~Cn~0) .cse13)))) is different from false [2022-12-13 17:30:38,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (* c_~i_AB~0 4))) (let ((.cse15 (select |c_#memory_int| c_~B~0.base)) (.cse9 (+ c_~B~0.offset .cse17))) (or (let ((.cse16 (* c_~i_BC~0 4))) (let ((.cse11 (+ c_~A~0.offset .cse17)) (.cse0 (not (= c_~i_AB~0 c_~An~0))) (.cse2 (+ c_~C~0.offset .cse16)) (.cse3 (select .cse15 (+ .cse16 c_~B~0.offset))) (.cse13 (= c_~An~0 c_~i_AC~0))) (and (or (let ((.cse12 (* c_~i_AC~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse12)) (.cse6 (+ c_~C~0.offset .cse12))) (and (or .cse0 (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse4 ~C~0.base))) (or (< (select .cse1 .cse2) .cse3) (<= (select (select .cse4 c_~A~0.base) .cse5) (select .cse1 .cse6))))))) (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse10 (select .cse8 c_~A~0.base)) (.cse7 (select .cse8 ~C~0.base))) (or (< (select .cse7 .cse2) .cse3) (< (select (select .cse8 c_~B~0.base) .cse9) (select .cse10 .cse11)) (<= (select .cse10 .cse5) (select .cse7 .cse6))))))))) .cse13) (or (and (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (or (< (select (select .cse14 ~C~0.base) .cse2) .cse3) (< (select (select .cse14 c_~B~0.base) .cse9) (select (select .cse14 c_~A~0.base) .cse11))))) (or .cse0 (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) ~C~0.base) .cse2) .cse3)))) (< c_~i_AC~0 c_~Cn~0) .cse13)))) (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse15 .cse9))))) is different from false [2022-12-13 17:30:38,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~i_BC~0 4)) (.cse24 (* c_~i_AB~0 4))) (let ((.cse7 (+ c_~A~0.offset .cse24)) (.cse0 (not (= c_~i_AB~0 c_~An~0))) (.cse2 (+ c_~B~0.offset .cse24)) (.cse4 (+ c_~C~0.offset .cse23)) (.cse5 (+ .cse23 c_~B~0.offset)) (.cse10 (= c_~An~0 c_~i_AC~0))) (and (or (and (or .cse0 (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse1 (select .cse3 c_~B~0.base))) (or (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse1 .cse2)) (< (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) ~C~0.base) .cse4) (select .cse1 .cse5))))))) (forall ((v_ArrVal_319 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse8 (select .cse9 c_~B~0.base))) (or (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse6 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (or (< (select (select .cse6 c_~B~0.base) .cse2) (select (select .cse6 c_~A~0.base) .cse7)) (< (select (select .cse6 ~C~0.base) .cse4) (select .cse8 .cse5))))) (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse8 .cse2))))))) (< c_~i_AC~0 c_~Cn~0) .cse10) (or (let ((.cse22 (* c_~i_AC~0 4))) (let ((.cse15 (+ c_~A~0.offset .cse22)) (.cse16 (+ c_~C~0.offset .cse22))) (and (forall ((v_ArrVal_319 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse14 (select .cse17 c_~B~0.base))) (or (forall ((v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse11 (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse12 (select .cse11 c_~A~0.base)) (.cse13 (select .cse11 ~C~0.base))) (or (< (select (select .cse11 c_~B~0.base) .cse2) (select .cse12 .cse7)) (< (select .cse13 .cse4) (select .cse14 .cse5)) (<= (select .cse12 .cse15) (select .cse13 .cse16)))))) (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse14 .cse2)))))) (or .cse0 (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse18 (select .cse21 c_~B~0.base)) (.cse19 (select .cse20 ~C~0.base))) (or (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse18 .cse2)) (< (select .cse19 .cse4) (select .cse18 .cse5)) (<= (select (select .cse20 c_~A~0.base) .cse15) (select .cse19 .cse16))))))))))) .cse10)))) is different from false [2022-12-13 17:30:38,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~i_AB~0 4))) (let ((.cse14 (* c_~i_BC~0 4)) (.cse2 (+ c_~A~0.offset .cse15))) (let ((.cse1 (+ c_~B~0.offset .cse15)) (.cse4 (select (select |c_#memory_int| c_~A~0.base) .cse2)) (.cse5 (+ c_~C~0.offset .cse14)) (.cse6 (+ .cse14 c_~B~0.offset))) (and (or (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse0 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320)) (.cse3 (select .cse7 c_~B~0.base))) (or (< (select (select .cse0 c_~B~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2)) (= (select .cse3 .cse1) .cse4) (< (select (select .cse0 ~C~0.base) .cse5) (select .cse3 .cse6)))))) (< c_~i_AC~0 c_~Cn~0)) (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse8 (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse10 (select .cse13 c_~B~0.base)) (.cse9 (select .cse8 c_~A~0.base)) (.cse11 (select .cse8 ~C~0.base))) (or (< (select (select .cse8 c_~B~0.base) .cse1) (select .cse9 .cse2)) (= (select .cse10 .cse1) .cse4) (< (select .cse11 .cse5) (select .cse10 .cse6)) (let ((.cse12 (* c_~i_AC~0 4))) (<= (select .cse9 (+ c_~A~0.offset .cse12)) (select .cse11 (+ c_~C~0.offset .cse12))))))))))))) is different from false [2022-12-13 17:30:38,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~i_AB~0 4)) (.cse16 (* c_~i_BC~0 4))) (let ((.cse7 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse16 c_~B~0.offset)) (.cse3 (+ c_~B~0.offset .cse15)) (.cse1 (+ c_~A~0.offset .cse15))) (and (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (let ((.cse10 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse6 (select .cse9 ~C~0.base)) (.cse2 (select .cse10 c_~B~0.base)) (.cse4 (select .cse9 c_~A~0.base))) (or (= (select (select .cse0 c_~A~0.base) .cse1) (select .cse2 .cse3)) (let ((.cse5 (* c_~i_AC~0 4))) (<= (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse6 .cse7) (select .cse2 .cse8)) (< (select (select .cse9 c_~B~0.base) .cse3) (select .cse4 .cse1)))))))) (or (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (let ((.cse14 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse12 (select .cse14 c_~B~0.base)) (.cse13 (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (or (= (select (select .cse11 c_~A~0.base) .cse1) (select .cse12 .cse3)) (< (select (select .cse13 ~C~0.base) .cse7) (select .cse12 .cse8)) (< (select (select .cse13 c_~B~0.base) .cse3) (select (select .cse13 c_~A~0.base) .cse1))))))) (< c_~i_AC~0 c_~Cn~0))))) is different from false [2022-12-13 17:30:38,631 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse15 (* c_~i_AB~0 4)) (.cse16 (* c_~i_BC~0 4))) (let ((.cse3 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse16 c_~B~0.offset)) (.cse1 (+ c_~B~0.offset .cse15)) (.cse2 (+ c_~A~0.offset .cse15))) (and (or (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse0 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320)) (.cse4 (select .cse7 c_~B~0.base))) (or (< (select (select .cse0 c_~B~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2)) (< (select (select .cse0 ~C~0.base) .cse3) (select .cse4 .cse5)) (= (select .cse4 .cse1) (select (select .cse6 c_~A~0.base) .cse2))))))) (< c_~i_AC~0 c_~Cn~0)) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (~C~0.base Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (let ((.cse14 (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319))) (let ((.cse8 (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320))) (let ((.cse9 (select .cse8 c_~A~0.base)) (.cse11 (select .cse8 ~C~0.base)) (.cse12 (select .cse14 c_~B~0.base))) (or (< (select (select .cse8 c_~B~0.base) .cse1) (select .cse9 .cse2)) (let ((.cse10 (* c_~i_AC~0 4))) (<= (select .cse9 (+ c_~A~0.offset .cse10)) (select .cse11 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (select .cse11 .cse3) (select .cse12 .cse5)) (= (select .cse12 .cse1) (select (select .cse13 c_~A~0.base) .cse2))))))))))) (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) is different from false [2022-12-13 17:30:38,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:38,849 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 188 treesize of output 128 [2022-12-13 17:30:38,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:38,970 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 854592 treesize of output 820119 [2022-12-13 17:30:41,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:41,212 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 817131 treesize of output 618511 [2022-12-13 17:30:43,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:43,456 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 621376 treesize of output 518664 [2022-12-13 17:30:45,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:45,637 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 518592 treesize of output 466888 [2022-12-13 17:30:47,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:30:47,865 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 466816 treesize of output 441000