./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro --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 0e7e1d85f63f5db62c0766d87dec12398108cf8053838b2df867ce8148d55e54 --- 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-8393723 [2022-11-18 21:11:32,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:11:32,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:11:32,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:11:32,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:11:32,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:11:32,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:11:32,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:11:32,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:11:32,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:11:32,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:11:32,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:11:32,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:11:32,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:11:32,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:11:32,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:11:32,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:11:32,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:11:32,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:11:32,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:11:32,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:11:32,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:11:32,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:11:32,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:11:32,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:11:32,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:11:32,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:11:32,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:11:32,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:11:32,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:11:32,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:11:32,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:11:32,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:11:32,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:11:32,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:11:32,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:11:32,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:11:32,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:11:32,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:11:32,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:11:32,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:11:32,258 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:11:32,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:11:32,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:11:32,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:11:32,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:11:32,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:11:32,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:11:32,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:11:32,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:11:32,309 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:11:32,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:11:32,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:11:32,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:11:32,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:11:32,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:11:32,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:11:32,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:11:32,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:11:32,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:11:32,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:11:32,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:11:32,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:11:32,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:11:32,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:11:32,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:11:32,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:11:32,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:11:32,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:11:32,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:11:32,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:11:32,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:11:32,317 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:11:32,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:11:32,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:11:32,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/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_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro 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 -> 0e7e1d85f63f5db62c0766d87dec12398108cf8053838b2df867ce8148d55e54 [2022-11-18 21:11:32,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:11:32,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:11:32,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:11:32,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:11:32,613 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:11:32,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2022-11-18 21:11:32,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/data/bb853ced9/90c6e355bed84db2ba39fa9397fedc93/FLAG46937c034 [2022-11-18 21:11:33,213 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:11:33,214 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2022-11-18 21:11:33,220 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/data/bb853ced9/90c6e355bed84db2ba39fa9397fedc93/FLAG46937c034 [2022-11-18 21:11:33,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/data/bb853ced9/90c6e355bed84db2ba39fa9397fedc93 [2022-11-18 21:11:33,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:11:33,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:11:33,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:11:33,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:11:33,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:11:33,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:33,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0cdf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33, skipping insertion in model container [2022-11-18 21:11:33,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:33,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:11:33,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:11:33,913 WARN L234 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_481af938-5056-4a3d-8a5e-38c56b4f8d13/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-11-18 21:11:33,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:11:33,931 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:11:33,954 WARN L234 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_481af938-5056-4a3d-8a5e-38c56b4f8d13/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-11-18 21:11:33,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:11:33,973 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:11:33,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33 WrapperNode [2022-11-18 21:11:33,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:11:33,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:11:33,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:11:33,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:11:33,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:33,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,021 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2022-11-18 21:11:34,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:11:34,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:11:34,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:11:34,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:11:34,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,047 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:11:34,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:11:34,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:11:34,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:11:34,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (1/1) ... [2022-11-18 21:11:34,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:11:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:34,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:11:34,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:11:34,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:11:34,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:11:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:11:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 21:11:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 21:11:34,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 21:11:34,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 21:11:34,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 21:11:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 21:11:34,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 21:11:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:11:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:11:34,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:11:34,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 21:11:34,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:11:34,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:11:34,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:11:34,148 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:11:34,260 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:11:34,262 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:11:34,694 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:11:34,781 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:11:34,782 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 21:11:34,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:11:34 BoogieIcfgContainer [2022-11-18 21:11:34,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:11:34,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:11:34,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:11:34,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:11:34,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:11:33" (1/3) ... [2022-11-18 21:11:34,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566a3ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:11:34, skipping insertion in model container [2022-11-18 21:11:34,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:11:33" (2/3) ... [2022-11-18 21:11:34,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566a3ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:11:34, skipping insertion in model container [2022-11-18 21:11:34,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:11:34" (3/3) ... [2022-11-18 21:11:34,796 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-11-18 21:11:34,805 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 21:11:34,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:11:34,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 21:11:34,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:11:34,996 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 21:11:35,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 176 transitions, 376 flow [2022-11-18 21:11:35,161 INFO L130 PetriNetUnfolder]: 12/173 cut-off events. [2022-11-18 21:11:35,161 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 21:11:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 173 events. 12/173 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2022-11-18 21:11:35,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 176 transitions, 376 flow [2022-11-18 21:11:35,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 162 transitions, 342 flow [2022-11-18 21:11:35,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:11:35,204 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;@3a52d427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:11:35,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 21:11:35,266 INFO L130 PetriNetUnfolder]: 12/161 cut-off events. [2022-11-18 21:11:35,268 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 21:11:35,269 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:35,270 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:35,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 967378678, now seen corresponding path program 1 times [2022-11-18 21:11:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:35,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986270319] [2022-11-18 21:11:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986270319] [2022-11-18 21:11:35,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986270319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:35,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:35,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:11:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827769969] [2022-11-18 21:11:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:35,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:11:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:11:35,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:11:35,696 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 176 [2022-11-18 21:11:35,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 162 transitions, 342 flow. Second operand has 2 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:35,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:35,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 176 [2022-11-18 21:11:35,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:35,869 INFO L130 PetriNetUnfolder]: 32/262 cut-off events. [2022-11-18 21:11:35,869 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-18 21:11:35,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 262 events. 32/262 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 660 event pairs, 20 based on Foata normal form. 18/254 useless extension candidates. Maximal degree in co-relation 197. Up to 47 conditions per place. [2022-11-18 21:11:35,876 INFO L137 encePairwiseOnDemand]: 168/176 looper letters, 10 selfloop transitions, 0 changer transitions 5/154 dead transitions. [2022-11-18 21:11:35,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 154 transitions, 346 flow [2022-11-18 21:11:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:11:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 21:11:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 332 transitions. [2022-11-18 21:11:35,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9431818181818182 [2022-11-18 21:11:35,905 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 332 transitions. [2022-11-18 21:11:35,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 332 transitions. [2022-11-18 21:11:35,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:35,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 332 transitions. [2022-11-18 21:11:35,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.0) internal successors, (332), 2 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:35,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:35,930 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:35,932 INFO L175 Difference]: Start difference. First operand has 160 places, 162 transitions, 342 flow. Second operand 2 states and 332 transitions. [2022-11-18 21:11:35,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 154 transitions, 346 flow [2022-11-18 21:11:35,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 334 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 21:11:35,945 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 304 flow [2022-11-18 21:11:35,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2022-11-18 21:11:35,953 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -5 predicate places. [2022-11-18 21:11:35,953 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 304 flow [2022-11-18 21:11:35,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:35,954 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:35,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:35,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:11:35,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1280854699, now seen corresponding path program 1 times [2022-11-18 21:11:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:35,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281732206] [2022-11-18 21:11:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:36,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:36,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281732206] [2022-11-18 21:11:36,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281732206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:36,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:36,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:11:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379413826] [2022-11-18 21:11:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:36,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:11:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:11:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:11:36,557 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 176 [2022-11-18 21:11:36,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:36,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:36,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 176 [2022-11-18 21:11:36,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:36,697 INFO L130 PetriNetUnfolder]: 31/261 cut-off events. [2022-11-18 21:11:36,697 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 21:11:36,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 261 events. 31/261 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 651 event pairs, 20 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 349. Up to 72 conditions per place. [2022-11-18 21:11:36,700 INFO L137 encePairwiseOnDemand]: 172/176 looper letters, 35 selfloop transitions, 0 changer transitions 4/152 dead transitions. [2022-11-18 21:11:36,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 152 transitions, 388 flow [2022-11-18 21:11:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:11:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 21:11:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2022-11-18 21:11:36,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7613636363636364 [2022-11-18 21:11:36,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2022-11-18 21:11:36,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2022-11-18 21:11:36,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:36,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2022-11-18 21:11:36,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:36,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:36,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:36,711 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 304 flow. Second operand 5 states and 670 transitions. [2022-11-18 21:11:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 152 transitions, 388 flow [2022-11-18 21:11:36,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 21:11:36,715 INFO L231 Difference]: Finished difference. Result has 157 places, 148 transitions, 308 flow [2022-11-18 21:11:36,716 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=157, PETRI_TRANSITIONS=148} [2022-11-18 21:11:36,717 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -3 predicate places. [2022-11-18 21:11:36,717 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 308 flow [2022-11-18 21:11:36,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:36,718 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:36,718 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:36,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:11:36,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 359047279, now seen corresponding path program 1 times [2022-11-18 21:11:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279972388] [2022-11-18 21:11:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:37,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:37,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279972388] [2022-11-18 21:11:37,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279972388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:37,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:37,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:11:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608527974] [2022-11-18 21:11:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:11:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:11:37,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:11:37,108 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 176 [2022-11-18 21:11:37,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 308 flow. Second operand has 8 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:37,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:37,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 176 [2022-11-18 21:11:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:37,288 INFO L130 PetriNetUnfolder]: 79/350 cut-off events. [2022-11-18 21:11:37,288 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-18 21:11:37,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 350 events. 79/350 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1266 event pairs, 64 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 546. Up to 150 conditions per place. [2022-11-18 21:11:37,292 INFO L137 encePairwiseOnDemand]: 168/176 looper letters, 43 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2022-11-18 21:11:37,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 152 transitions, 416 flow [2022-11-18 21:11:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:11:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 21:11:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 979 transitions. [2022-11-18 21:11:37,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2022-11-18 21:11:37,296 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 979 transitions. [2022-11-18 21:11:37,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 979 transitions. [2022-11-18 21:11:37,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:37,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 979 transitions. [2022-11-18 21:11:37,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:37,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:37,304 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:37,304 INFO L175 Difference]: Start difference. First operand has 157 places, 148 transitions, 308 flow. Second operand 8 states and 979 transitions. [2022-11-18 21:11:37,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 152 transitions, 416 flow [2022-11-18 21:11:37,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 152 transitions, 410 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-18 21:11:37,309 INFO L231 Difference]: Finished difference. Result has 159 places, 149 transitions, 324 flow [2022-11-18 21:11:37,309 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=324, PETRI_PLACES=159, PETRI_TRANSITIONS=149} [2022-11-18 21:11:37,310 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2022-11-18 21:11:37,311 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 324 flow [2022-11-18 21:11:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:37,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:37,312 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:37,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:11:37,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -375281331, now seen corresponding path program 1 times [2022-11-18 21:11:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:37,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080903674] [2022-11-18 21:11:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:37,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080903674] [2022-11-18 21:11:37,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080903674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:37,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261544703] [2022-11-18 21:11:37,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:37,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:37,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:37,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:37,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 21:11:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:37,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 21:11:37,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:37,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:38,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261544703] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:38,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:11:38,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-18 21:11:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686260673] [2022-11-18 21:11:38,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:38,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:11:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:38,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:11:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:11:38,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 176 [2022-11-18 21:11:38,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 138.71428571428572) internal successors, (971), 7 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:38,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 176 [2022-11-18 21:11:38,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:38,426 INFO L130 PetriNetUnfolder]: 133/507 cut-off events. [2022-11-18 21:11:38,426 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-18 21:11:38,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 507 events. 133/507 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2228 event pairs, 85 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 797. Up to 111 conditions per place. [2022-11-18 21:11:38,431 INFO L137 encePairwiseOnDemand]: 168/176 looper letters, 34 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2022-11-18 21:11:38,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 157 transitions, 424 flow [2022-11-18 21:11:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:11:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 21:11:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-11-18 21:11:38,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8003246753246753 [2022-11-18 21:11:38,434 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-11-18 21:11:38,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-11-18 21:11:38,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:38,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-11-18 21:11:38,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,442 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,442 INFO L175 Difference]: Start difference. First operand has 159 places, 149 transitions, 324 flow. Second operand 7 states and 986 transitions. [2022-11-18 21:11:38,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 157 transitions, 424 flow [2022-11-18 21:11:38,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 412 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 21:11:38,447 INFO L231 Difference]: Finished difference. Result has 162 places, 151 transitions, 345 flow [2022-11-18 21:11:38,447 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=162, PETRI_TRANSITIONS=151} [2022-11-18 21:11:38,448 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2022-11-18 21:11:38,448 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 151 transitions, 345 flow [2022-11-18 21:11:38,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.71428571428572) internal successors, (971), 7 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:38,449 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:38,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:38,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:38,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2067832931, now seen corresponding path program 1 times [2022-11-18 21:11:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464858200] [2022-11-18 21:11:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:11:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:38,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464858200] [2022-11-18 21:11:38,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464858200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408519720] [2022-11-18 21:11:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:38,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:38,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:38,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:39,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 21:11:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:39,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 21:11:39,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:11:39,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:11:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408519720] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:39,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:11:39,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-18 21:11:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239822365] [2022-11-18 21:11:39,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:39,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:11:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:11:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:11:39,572 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 176 [2022-11-18 21:11:39,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 151 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:39,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:39,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 176 [2022-11-18 21:11:39,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:39,788 INFO L130 PetriNetUnfolder]: 135/420 cut-off events. [2022-11-18 21:11:39,788 INFO L131 PetriNetUnfolder]: For 117/153 co-relation queries the response was YES. [2022-11-18 21:11:39,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 420 events. 135/420 cut-off events. For 117/153 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1520 event pairs, 50 based on Foata normal form. 36/426 useless extension candidates. Maximal degree in co-relation 804. Up to 119 conditions per place. [2022-11-18 21:11:39,814 INFO L137 encePairwiseOnDemand]: 168/176 looper letters, 36 selfloop transitions, 7 changer transitions 0/159 dead transitions. [2022-11-18 21:11:39,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 457 flow [2022-11-18 21:11:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:11:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 21:11:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-11-18 21:11:39,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8003246753246753 [2022-11-18 21:11:39,819 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-11-18 21:11:39,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-11-18 21:11:39,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:39,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-11-18 21:11:39,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:39,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:39,826 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:39,826 INFO L175 Difference]: Start difference. First operand has 162 places, 151 transitions, 345 flow. Second operand 7 states and 986 transitions. [2022-11-18 21:11:39,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 159 transitions, 457 flow [2022-11-18 21:11:39,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 159 transitions, 448 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 21:11:39,831 INFO L231 Difference]: Finished difference. Result has 166 places, 152 transitions, 364 flow [2022-11-18 21:11:39,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=166, PETRI_TRANSITIONS=152} [2022-11-18 21:11:39,835 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 6 predicate places. [2022-11-18 21:11:39,836 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 152 transitions, 364 flow [2022-11-18 21:11:39,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:39,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:39,837 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:39,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:40,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:40,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -864414773, now seen corresponding path program 1 times [2022-11-18 21:11:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724179376] [2022-11-18 21:11:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:11:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:40,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724179376] [2022-11-18 21:11:40,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724179376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:40,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555009159] [2022-11-18 21:11:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:40,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:40,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 21:11:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:41,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 21:11:41,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:41,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:11:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:11:41,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:11:41,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555009159] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:41,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:11:41,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 15] total 23 [2022-11-18 21:11:41,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692474240] [2022-11-18 21:11:41,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:41,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 21:11:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 21:11:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-11-18 21:11:41,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 176 [2022-11-18 21:11:41,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 152 transitions, 364 flow. Second operand has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:41,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:41,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 176 [2022-11-18 21:11:41,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:43,912 INFO L130 PetriNetUnfolder]: 3406/6701 cut-off events. [2022-11-18 21:11:43,912 INFO L131 PetriNetUnfolder]: For 4020/4020 co-relation queries the response was YES. [2022-11-18 21:11:43,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15366 conditions, 6701 events. 3406/6701 cut-off events. For 4020/4020 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 52223 event pairs, 417 based on Foata normal form. 2/6605 useless extension candidates. Maximal degree in co-relation 15355. Up to 1289 conditions per place. [2022-11-18 21:11:43,960 INFO L137 encePairwiseOnDemand]: 164/176 looper letters, 137 selfloop transitions, 10 changer transitions 92/328 dead transitions. [2022-11-18 21:11:43,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 328 transitions, 1431 flow [2022-11-18 21:11:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 21:11:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 21:11:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1740 transitions. [2022-11-18 21:11:43,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-11-18 21:11:43,965 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1740 transitions. [2022-11-18 21:11:43,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1740 transitions. [2022-11-18 21:11:43,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:43,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1740 transitions. [2022-11-18 21:11:43,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:43,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 176.0) internal successors, (2816), 16 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:43,976 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 176.0) internal successors, (2816), 16 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:43,976 INFO L175 Difference]: Start difference. First operand has 166 places, 152 transitions, 364 flow. Second operand 15 states and 1740 transitions. [2022-11-18 21:11:43,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 328 transitions, 1431 flow [2022-11-18 21:11:44,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 328 transitions, 1397 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 21:11:44,008 INFO L231 Difference]: Finished difference. Result has 189 places, 161 transitions, 458 flow [2022-11-18 21:11:44,008 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=458, PETRI_PLACES=189, PETRI_TRANSITIONS=161} [2022-11-18 21:11:44,009 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 29 predicate places. [2022-11-18 21:11:44,009 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 161 transitions, 458 flow [2022-11-18 21:11:44,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:44,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:44,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:11:44,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 21:11:44,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 21:11:44,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:11:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash -207263429, now seen corresponding path program 2 times [2022-11-18 21:11:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:44,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128958953] [2022-11-18 21:11:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:11:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:44,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128958953] [2022-11-18 21:11:44,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128958953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:11:44,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398903196] [2022-11-18 21:11:44,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 21:11:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:11:44,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:11:44,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:11:44,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 21:11:45,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 21:11:45,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:11:45,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-18 21:11:45,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:45,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 21:11:46,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:11:46,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:11:46,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:11:46,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:11:46,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:11:46,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:11:46,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:11:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:11:46,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:47,136 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_175 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) c_~A~0.offset))) (= (mod c_~b1~0 256) 0)) is different from false [2022-11-18 21:12:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:12:01,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398903196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:12:01,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:12:01,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 14] total 40 [2022-11-18 21:12:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626979492] [2022-11-18 21:12:01,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:12:01,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 21:12:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:12:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 21:12:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1248, Unknown=28, NotChecked=74, Total=1560 [2022-11-18 21:12:01,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176 [2022-11-18 21:12:01,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 161 transitions, 458 flow. Second operand has 40 states, 40 states have (on average 76.6) internal successors, (3064), 40 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:01,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:12:01,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176 [2022-11-18 21:12:01,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:12:15,098 INFO L130 PetriNetUnfolder]: 4919/12353 cut-off events. [2022-11-18 21:12:15,098 INFO L131 PetriNetUnfolder]: For 20342/20887 co-relation queries the response was YES. [2022-11-18 21:12:15,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33318 conditions, 12353 events. 4919/12353 cut-off events. For 20342/20887 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 127212 event pairs, 587 based on Foata normal form. 304/12270 useless extension candidates. Maximal degree in co-relation 33294. Up to 1934 conditions per place. [2022-11-18 21:12:15,250 INFO L137 encePairwiseOnDemand]: 132/176 looper letters, 209 selfloop transitions, 98 changer transitions 225/599 dead transitions. [2022-11-18 21:12:15,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 599 transitions, 3397 flow [2022-11-18 21:12:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-18 21:12:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-11-18 21:12:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 5436 transitions. [2022-11-18 21:12:15,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44762845849802374 [2022-11-18 21:12:15,269 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 5436 transitions. [2022-11-18 21:12:15,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 5436 transitions. [2022-11-18 21:12:15,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:12:15,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 5436 transitions. [2022-11-18 21:12:15,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 78.78260869565217) internal successors, (5436), 69 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:15,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 176.0) internal successors, (12320), 70 states have internal predecessors, (12320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:15,326 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 176.0) internal successors, (12320), 70 states have internal predecessors, (12320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:15,327 INFO L175 Difference]: Start difference. First operand has 189 places, 161 transitions, 458 flow. Second operand 69 states and 5436 transitions. [2022-11-18 21:12:15,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 599 transitions, 3397 flow [2022-11-18 21:12:15,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 599 transitions, 3239 flow, removed 79 selfloop flow, removed 7 redundant places. [2022-11-18 21:12:15,577 INFO L231 Difference]: Finished difference. Result has 285 places, 241 transitions, 1401 flow [2022-11-18 21:12:15,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=1401, PETRI_PLACES=285, PETRI_TRANSITIONS=241} [2022-11-18 21:12:15,579 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 125 predicate places. [2022-11-18 21:12:15,579 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 241 transitions, 1401 flow [2022-11-18 21:12:15,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 76.6) internal successors, (3064), 40 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:15,580 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:12:15,581 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:15,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 21:12:15,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:15,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:12:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 21358063, now seen corresponding path program 3 times [2022-11-18 21:12:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:15,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837820760] [2022-11-18 21:12:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:12:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:12:18,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837820760] [2022-11-18 21:12:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837820760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:12:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127664992] [2022-11-18 21:12:18,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 21:12:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:12:18,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:12:18,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 21:12:18,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 21:12:18,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:12:18,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 21:12:18,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 21:12:18,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:12:18,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127664992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:12:18,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:12:18,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [30] total 34 [2022-11-18 21:12:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945689062] [2022-11-18 21:12:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:12:18,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:12:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:12:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:12:18,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 21:12:18,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 176 [2022-11-18 21:12:18,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 241 transitions, 1401 flow. Second operand has 8 states, 8 states have (on average 130.5) internal successors, (1044), 8 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:18,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:12:18,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 176 [2022-11-18 21:12:18,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:12:21,231 INFO L130 PetriNetUnfolder]: 2752/7763 cut-off events. [2022-11-18 21:12:21,231 INFO L131 PetriNetUnfolder]: For 104412/108470 co-relation queries the response was YES. [2022-11-18 21:12:21,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41864 conditions, 7763 events. 2752/7763 cut-off events. For 104412/108470 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 78224 event pairs, 805 based on Foata normal form. 271/7662 useless extension candidates. Maximal degree in co-relation 41802. Up to 3502 conditions per place. [2022-11-18 21:12:21,377 INFO L137 encePairwiseOnDemand]: 164/176 looper letters, 108 selfloop transitions, 12 changer transitions 14/296 dead transitions. [2022-11-18 21:12:21,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 296 transitions, 2218 flow [2022-11-18 21:12:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:12:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:12:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1440 transitions. [2022-11-18 21:12:21,386 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.743801652892562 [2022-11-18 21:12:21,386 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1440 transitions. [2022-11-18 21:12:21,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1440 transitions. [2022-11-18 21:12:21,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:12:21,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1440 transitions. [2022-11-18 21:12:21,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 130.9090909090909) internal successors, (1440), 11 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:21,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 176.0) internal successors, (2112), 12 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:21,397 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 176.0) internal successors, (2112), 12 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:21,398 INFO L175 Difference]: Start difference. First operand has 285 places, 241 transitions, 1401 flow. Second operand 11 states and 1440 transitions. [2022-11-18 21:12:21,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 296 transitions, 2218 flow [2022-11-18 21:12:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 296 transitions, 1937 flow, removed 119 selfloop flow, removed 49 redundant places. [2022-11-18 21:12:22,401 INFO L231 Difference]: Finished difference. Result has 219 places, 244 transitions, 1304 flow [2022-11-18 21:12:22,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1304, PETRI_PLACES=219, PETRI_TRANSITIONS=244} [2022-11-18 21:12:22,403 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 59 predicate places. [2022-11-18 21:12:22,403 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 244 transitions, 1304 flow [2022-11-18 21:12:22,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.5) internal successors, (1044), 8 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:22,404 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:12:22,404 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:22,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:22,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:22,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:12:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1478477181, now seen corresponding path program 4 times [2022-11-18 21:12:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:22,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093625999] [2022-11-18 21:12:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:12:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:12:23,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093625999] [2022-11-18 21:12:23,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093625999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:12:23,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112755197] [2022-11-18 21:12:23,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 21:12:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:12:23,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:12:23,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 21:12:23,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 21:12:23,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:12:23,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-18 21:12:23,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:24,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:12:24,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:12:24,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:12:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:12:24,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:12:24,975 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_240 (Array Int Int))) (< c_~min~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_240) c_~A~0.base) c_~A~0.offset) 1))) (= (mod c_~b1~0 256) 0)) is different from false [2022-11-18 21:12:27,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-18 21:12:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:12:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112755197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:12:27,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:12:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 40 [2022-11-18 21:12:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037092712] [2022-11-18 21:12:27,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:12:27,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 21:12:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:12:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 21:12:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1323, Unknown=6, NotChecked=74, Total=1560 [2022-11-18 21:12:27,787 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 176 [2022-11-18 21:12:27,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 244 transitions, 1304 flow. Second operand has 40 states, 40 states have (on average 89.1) internal successors, (3564), 40 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:27,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:12:27,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 176 [2022-11-18 21:12:27,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:12:36,941 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:12:45,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([476] thread3ENTRY-->L86: Formula: (= v_~v_assert~0_1 (ite (= (ite (or (= (mod v_~b2~0_2 256) 0) (<= v_~min~0_6 v_~max~0_6) (= (mod v_~b1~0_2 256) 0)) 1 0) 0) 0 1)) InVars {~b2~0=v_~b2~0_2, ~max~0=v_~max~0_6, ~b1~0=v_~b1~0_2, ~min~0=v_~min~0_6} OutVars{~v_assert~0=v_~v_assert~0_1, ~b2~0=v_~b2~0_2, ~max~0=v_~max~0_6, ~b1~0=v_~b1~0_2, ~min~0=v_~min~0_6} AuxVars[] AssignedVars[~v_assert~0][382], [Black: 3846#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 ~max~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 4471#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~b2~0 256) 0)), Black: 4480#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3871#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (div ~v_assert~0 256) 0) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 4395#(= ~v_assert~0 1), Black: 3832#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 1063#(<= 1 ~N~0), Black: 4478#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3859#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 ~max~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 3850#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3839#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~min~0 ~max~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1928#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 3853#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 3882#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (div ~v_assert~0 256) 0) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 177#true, Black: 208#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3855#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), 3993#true, 180#true, 138#L74-5true, Black: 3848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~min~0 ~max~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1050#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 217#(<= 1 ~N~0), 132#L57true, 4486#true, Black: 2512#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3884#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (not (= (mod ~v_assert~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 2843#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 2840#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 3834#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2838#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 40#L86true, 27#L109-4true, Black: 3842#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 1936#(<= ~min~0 ~max~0), Black: 1932#true, Black: 3844#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 ~max~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 3880#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~min~0 ~max~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3896#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= (mod ~v_assert~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 1935#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))]) [2022-11-18 21:12:45,664 INFO L383 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-11-18 21:12:45,664 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-18 21:12:45,664 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-18 21:12:45,665 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-18 21:12:45,795 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([366] L110-->L110-1: Formula: (= (select (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem26#1_2|) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem26#1][312], [Black: 3846#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 ~max~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 4471#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= (mod ~b2~0 256) 0)), Black: 4480#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3871#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (div ~v_assert~0 256) 0) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 4395#(= ~v_assert~0 1), Black: 3832#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 1063#(<= 1 ~N~0), Black: 4478#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3859#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 ~max~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 3850#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3839#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~min~0 ~max~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1928#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 3853#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 3882#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (div ~v_assert~0 256) 0) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 177#true, Black: 3855#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 208#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 3993#true, 180#true, Black: 3848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~min~0 ~max~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 138#L74-5true, 22#L110-1true, Black: 1050#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 217#(<= 1 ~N~0), 132#L57true, 100#thread3ENTRYtrue, 4486#true, Black: 2512#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3884#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (not (= (mod ~v_assert~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0)))))), Black: 2843#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 2840#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 3834#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2838#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3842#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 1936#(<= ~min~0 ~max~0), Black: 3844#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 ~max~0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (<= ~min~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) ~A~0.base) ~A~0.offset))) (= (mod ~b1~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1932#true, Black: 3880#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (mod ~b1~0 256) 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~min~0 ~max~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3896#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (not |ULTIMATE.start_main_#t~short19#1|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (or (= (mod ~b1~0 256) 0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= (mod ~v_assert~0 256) 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 1935#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))]) [2022-11-18 21:12:45,796 INFO L383 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-11-18 21:12:45,797 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-18 21:12:45,797 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-18 21:12:45,797 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-18 21:12:50,732 INFO L130 PetriNetUnfolder]: 16411/39400 cut-off events. [2022-11-18 21:12:50,733 INFO L131 PetriNetUnfolder]: For 365912/374389 co-relation queries the response was YES. [2022-11-18 21:12:50,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180970 conditions, 39400 events. 16411/39400 cut-off events. For 365912/374389 co-relation queries the response was YES. Maximal size of possible extension queue 2280. Compared 478526 event pairs, 5692 based on Foata normal form. 787/37689 useless extension candidates. Maximal degree in co-relation 180933. Up to 19307 conditions per place. [2022-11-18 21:12:51,275 INFO L137 encePairwiseOnDemand]: 148/176 looper letters, 187 selfloop transitions, 66 changer transitions 356/704 dead transitions. [2022-11-18 21:12:51,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 704 transitions, 5942 flow [2022-11-18 21:12:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-18 21:12:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-11-18 21:12:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 4080 transitions. [2022-11-18 21:12:51,291 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5268595041322314 [2022-11-18 21:12:51,292 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 4080 transitions. [2022-11-18 21:12:51,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 4080 transitions. [2022-11-18 21:12:51,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:12:51,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 4080 transitions. [2022-11-18 21:12:51,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 92.72727272727273) internal successors, (4080), 44 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:51,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 176.0) internal successors, (7920), 45 states have internal predecessors, (7920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:51,329 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 176.0) internal successors, (7920), 45 states have internal predecessors, (7920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:51,329 INFO L175 Difference]: Start difference. First operand has 219 places, 244 transitions, 1304 flow. Second operand 44 states and 4080 transitions. [2022-11-18 21:12:51,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 704 transitions, 5942 flow [2022-11-18 21:12:53,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 704 transitions, 5857 flow, removed 34 selfloop flow, removed 7 redundant places. [2022-11-18 21:12:53,324 INFO L231 Difference]: Finished difference. Result has 282 places, 286 transitions, 1847 flow [2022-11-18 21:12:53,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1847, PETRI_PLACES=282, PETRI_TRANSITIONS=286} [2022-11-18 21:12:53,326 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 122 predicate places. [2022-11-18 21:12:53,326 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 286 transitions, 1847 flow [2022-11-18 21:12:53,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 89.1) internal successors, (3564), 40 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:12:53,328 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:12:53,328 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:12:53,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:53,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:12:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1019371609, now seen corresponding path program 5 times [2022-11-18 21:12:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:12:53,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946170427] [2022-11-18 21:12:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:12:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:12:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:12:54,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946170427] [2022-11-18 21:12:54,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946170427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:12:54,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559699979] [2022-11-18 21:12:54,833 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 21:12:54,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:12:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:12:54,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:12:54,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 21:12:55,024 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 21:12:55,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:12:55,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 21:12:55,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:55,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 21:12:56,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 21:12:56,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:12:56,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:12:56,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:12:56,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-18 21:12:57,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:12:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:12:57,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:13:02,046 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) c_~A~0.base) c_~A~0.offset))) is different from false [2022-11-18 21:13:08,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275))) (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-18 21:13:08,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275))) (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) is different from false [2022-11-18 21:13:08,654 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-11-18 21:13:08,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-11-18 21:13:08,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 21:13:08,695 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 44 treesize of output 33 [2022-11-18 21:13:08,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-11-18 21:13:08,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2022-11-18 21:13:08,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2022-11-18 21:13:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-18 21:13:08,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559699979] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:13:08,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:13:08,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 21] total 48 [2022-11-18 21:13:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557535886] [2022-11-18 21:13:08,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:13:08,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-18 21:13:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:13:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-18 21:13:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1606, Unknown=24, NotChecked=430, Total=2256 [2022-11-18 21:13:08,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 176 [2022-11-18 21:13:08,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 286 transitions, 1847 flow. Second operand has 48 states, 48 states have (on average 81.29166666666667) internal successors, (3902), 48 states have internal predecessors, (3902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:08,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:13:08,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 176 [2022-11-18 21:13:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:13:27,075 INFO L130 PetriNetUnfolder]: 23966/48836 cut-off events. [2022-11-18 21:13:27,075 INFO L131 PetriNetUnfolder]: For 623748/626921 co-relation queries the response was YES. [2022-11-18 21:13:27,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254300 conditions, 48836 events. 23966/48836 cut-off events. For 623748/626921 co-relation queries the response was YES. Maximal size of possible extension queue 2563. Compared 538355 event pairs, 3088 based on Foata normal form. 371/48739 useless extension candidates. Maximal degree in co-relation 254236. Up to 22085 conditions per place. [2022-11-18 21:13:27,603 INFO L137 encePairwiseOnDemand]: 152/176 looper letters, 304 selfloop transitions, 55 changer transitions 489/922 dead transitions. [2022-11-18 21:13:27,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 922 transitions, 9443 flow [2022-11-18 21:13:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 21:13:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-11-18 21:13:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3385 transitions. [2022-11-18 21:13:27,611 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49315268065268064 [2022-11-18 21:13:27,611 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3385 transitions. [2022-11-18 21:13:27,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3385 transitions. [2022-11-18 21:13:27,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:13:27,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3385 transitions. [2022-11-18 21:13:27,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 86.7948717948718) internal successors, (3385), 39 states have internal predecessors, (3385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:27,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 176.0) internal successors, (7040), 40 states have internal predecessors, (7040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:27,806 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 176.0) internal successors, (7040), 40 states have internal predecessors, (7040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:27,806 INFO L175 Difference]: Start difference. First operand has 282 places, 286 transitions, 1847 flow. Second operand 39 states and 3385 transitions. [2022-11-18 21:13:27,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 922 transitions, 9443 flow [2022-11-18 21:13:32,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 922 transitions, 8876 flow, removed 271 selfloop flow, removed 26 redundant places. [2022-11-18 21:13:32,206 INFO L231 Difference]: Finished difference. Result has 302 places, 249 transitions, 1756 flow [2022-11-18 21:13:32,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1756, PETRI_PLACES=302, PETRI_TRANSITIONS=249} [2022-11-18 21:13:32,207 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 142 predicate places. [2022-11-18 21:13:32,207 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 249 transitions, 1756 flow [2022-11-18 21:13:32,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 81.29166666666667) internal successors, (3902), 48 states have internal predecessors, (3902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:32,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:13:32,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:13:32,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 21:13:32,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 21:13:32,415 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:13:32,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:13:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1601503589, now seen corresponding path program 6 times [2022-11-18 21:13:32,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:13:32,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403389489] [2022-11-18 21:13:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:13:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:13:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:13:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 21:13:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:13:32,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403389489] [2022-11-18 21:13:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403389489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:13:32,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251542161] [2022-11-18 21:13:32,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 21:13:32,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:13:32,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:13:32,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:13:33,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 21:13:33,252 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-18 21:13:33,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:13:33,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 21:13:33,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:13:33,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:13:33,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2022-11-18 21:13:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 21:13:33,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:13:33,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251542161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:13:33,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:13:33,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2022-11-18 21:13:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100418197] [2022-11-18 21:13:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:13:33,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:13:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:13:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:13:33,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:13:33,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 176 [2022-11-18 21:13:33,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 249 transitions, 1756 flow. Second operand has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:33,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:13:33,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 176 [2022-11-18 21:13:33,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:13:39,225 INFO L130 PetriNetUnfolder]: 7015/19250 cut-off events. [2022-11-18 21:13:39,225 INFO L131 PetriNetUnfolder]: For 485434/493682 co-relation queries the response was YES. [2022-11-18 21:13:39,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120665 conditions, 19250 events. 7015/19250 cut-off events. For 485434/493682 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 226103 event pairs, 2304 based on Foata normal form. 662/18355 useless extension candidates. Maximal degree in co-relation 120591. Up to 9056 conditions per place. [2022-11-18 21:13:39,444 INFO L137 encePairwiseOnDemand]: 169/176 looper letters, 93 selfloop transitions, 2 changer transitions 230/450 dead transitions. [2022-11-18 21:13:39,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 450 transitions, 4754 flow [2022-11-18 21:13:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:13:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:13:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1320 transitions. [2022-11-18 21:13:39,448 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-11-18 21:13:39,448 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1320 transitions. [2022-11-18 21:13:39,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1320 transitions. [2022-11-18 21:13:39,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:13:39,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1320 transitions. [2022-11-18 21:13:39,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:39,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 176.0) internal successors, (2112), 12 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:39,456 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 176.0) internal successors, (2112), 12 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:39,457 INFO L175 Difference]: Start difference. First operand has 302 places, 249 transitions, 1756 flow. Second operand 11 states and 1320 transitions. [2022-11-18 21:13:39,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 450 transitions, 4754 flow [2022-11-18 21:13:41,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 450 transitions, 4234 flow, removed 242 selfloop flow, removed 41 redundant places. [2022-11-18 21:13:41,349 INFO L231 Difference]: Finished difference. Result has 244 places, 218 transitions, 1210 flow [2022-11-18 21:13:41,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1549, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=244, PETRI_TRANSITIONS=218} [2022-11-18 21:13:41,350 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 84 predicate places. [2022-11-18 21:13:41,350 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 218 transitions, 1210 flow [2022-11-18 21:13:41,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:13:41,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:13:41,351 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:13:41,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 21:13:41,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 21:13:41,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-18 21:13:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:13:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 327490475, now seen corresponding path program 7 times [2022-11-18 21:13:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:13:41,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696397713] [2022-11-18 21:13:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:13:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:13:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:13:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 21:13:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:13:42,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696397713] [2022-11-18 21:13:42,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696397713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:13:42,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708138916] [2022-11-18 21:13:42,496 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 21:13:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:13:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:13:42,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:13:42,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 21:13:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:13:42,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-18 21:13:42,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:13:42,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 21:13:42,746 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 21:13:42,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-18 21:13:43,198 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 21:13:43,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 21:13:43,359 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-11-18 21:13:43,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 21:13:43,788 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-11-18 21:13:43,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 21:13:44,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 21:13:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:13:44,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:13:44,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348) c_~A~0.base) c_~A~0.offset) c_~max~0)) is different from false [2022-11-18 21:13:54,942 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_347))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348) c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-18 21:13:57,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_346 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_346) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_347))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) is different from false [2022-11-18 21:14:01,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 21:14:01,387 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 50 treesize of output 39 [2022-11-18 21:14:01,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4082 treesize of output 3762 [2022-11-18 21:14:01,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3562 treesize of output 3402 [2022-11-18 21:14:01,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3402 treesize of output 3146 [2022-11-18 21:14:01,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3146 treesize of output 2890 [2022-11-18 21:15:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:15:17,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708138916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:15:17,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:15:17,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 21] total 45 [2022-11-18 21:15:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169565651] [2022-11-18 21:15:17,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:15:17,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-18 21:15:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:15:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-18 21:15:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1520, Unknown=43, NotChecked=246, Total=1980 [2022-11-18 21:15:17,169 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 176 [2022-11-18 21:15:17,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 218 transitions, 1210 flow. Second operand has 45 states, 45 states have (on average 72.86666666666666) internal successors, (3279), 45 states have internal predecessors, (3279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:15:17,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:15:17,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 176 [2022-11-18 21:15:17,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:15:55,603 INFO L130 PetriNetUnfolder]: 7390/14622 cut-off events. [2022-11-18 21:15:55,604 INFO L131 PetriNetUnfolder]: For 269987/270276 co-relation queries the response was YES. [2022-11-18 21:15:55,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85301 conditions, 14622 events. 7390/14622 cut-off events. For 269987/270276 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 129072 event pairs, 292 based on Foata normal form. 37/14631 useless extension candidates. Maximal degree in co-relation 85245. Up to 7402 conditions per place. [2022-11-18 21:15:55,754 INFO L137 encePairwiseOnDemand]: 138/176 looper letters, 0 selfloop transitions, 0 changer transitions 670/670 dead transitions. [2022-11-18 21:15:55,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 670 transitions, 7074 flow [2022-11-18 21:15:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-18 21:15:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-11-18 21:15:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3645 transitions. [2022-11-18 21:15:55,761 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4314630681818182 [2022-11-18 21:15:55,762 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3645 transitions. [2022-11-18 21:15:55,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3645 transitions. [2022-11-18 21:15:55,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:15:55,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3645 transitions. [2022-11-18 21:15:55,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 75.9375) internal successors, (3645), 48 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:15:55,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 176.0) internal successors, (8624), 49 states have internal predecessors, (8624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:15:55,783 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 176.0) internal successors, (8624), 49 states have internal predecessors, (8624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:15:55,783 INFO L175 Difference]: Start difference. First operand has 244 places, 218 transitions, 1210 flow. Second operand 48 states and 3645 transitions. [2022-11-18 21:15:55,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 670 transitions, 7074 flow [2022-11-18 21:15:56,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 670 transitions, 6449 flow, removed 270 selfloop flow, removed 17 redundant places. [2022-11-18 21:15:56,179 INFO L231 Difference]: Finished difference. Result has 261 places, 0 transitions, 0 flow [2022-11-18 21:15:56,179 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=0, PETRI_PLACES=261, PETRI_TRANSITIONS=0} [2022-11-18 21:15:56,180 INFO L288 CegarLoopForPetriNet]: 160 programPoint places, 101 predicate places. [2022-11-18 21:15:56,180 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 0 transitions, 0 flow [2022-11-18 21:15:56,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 72.86666666666666) internal successors, (3279), 45 states have internal predecessors, (3279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:15:56,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-18 21:15:56,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-18 21:15:56,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-18 21:15:56,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-18 21:15:56,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 21:15:56,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 21:15:56,390 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-18 21:15:56,394 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:15:56,394 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:15:56,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:15:56 BasicIcfg [2022-11-18 21:15:56,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:15:56,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:15:56,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:15:56,402 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:15:56,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:11:34" (3/4) ... [2022-11-18 21:15:56,405 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 21:15:56,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-18 21:15:56,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-18 21:15:56,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-18 21:15:56,421 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-18 21:15:56,421 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-18 21:15:56,422 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 21:15:56,422 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 21:15:56,477 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 21:15:56,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:15:56,478 INFO L158 Benchmark]: Toolchain (without parser) took 262800.42ms. Allocated memory was 102.8MB in the beginning and 9.7GB in the end (delta: 9.6GB). Free memory was 70.3MB in the beginning and 6.7GB in the end (delta: -6.7GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-18 21:15:56,478 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:15:56,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.74ms. Allocated memory is still 102.8MB. Free memory was 70.1MB in the beginning and 76.0MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 21:15:56,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.02ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 74.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:15:56,483 INFO L158 Benchmark]: Boogie Preprocessor took 29.68ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 72.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:15:56,484 INFO L158 Benchmark]: RCFGBuilder took 732.22ms. Allocated memory is still 102.8MB. Free memory was 72.5MB in the beginning and 51.1MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-18 21:15:56,484 INFO L158 Benchmark]: TraceAbstraction took 261613.07ms. Allocated memory was 102.8MB in the beginning and 9.7GB in the end (delta: 9.6GB). Free memory was 50.4MB in the beginning and 6.7GB in the end (delta: -6.7GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-18 21:15:56,484 INFO L158 Benchmark]: Witness Printer took 76.25ms. Allocated memory is still 9.7GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 21:15:56,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.74ms. Allocated memory is still 102.8MB. Free memory was 70.1MB in the beginning and 76.0MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.02ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 74.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.68ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 72.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 732.22ms. Allocated memory is still 102.8MB. Free memory was 72.5MB in the beginning and 51.1MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 261613.07ms. Allocated memory was 102.8MB in the beginning and 9.7GB in the end (delta: 9.6GB). Free memory was 50.4MB in the beginning and 6.7GB in the end (delta: -6.7GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 76.25ms. Allocated memory is still 9.7GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 194 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 261.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 116.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4999 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4999 mSDsluCounter, 5909 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2831 IncrementalHoareTripleChecker+Unchecked, 5390 mSDsCounter, 213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5792 IncrementalHoareTripleChecker+Invalid, 8836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 213 mSolverCounterUnsat, 519 mSDtfsCounter, 5792 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2759 GetRequests, 2228 SyntacticMatches, 62 SemanticMatches, 469 ConstructedPredicates, 10 IntricatePredicates, 8 DeprecatedPredicates, 9534 ImplicationChecksByTransitivity, 112.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=9, InterpolantAutomatonStates: 266, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 140.3s InterpolantComputationTime, 3023 NumberOfCodeBlocks, 3006 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4016 ConstructedInterpolants, 118 QuantifiedInterpolants, 21909 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2868 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 28 InterpolantComputations, 8 PerfectInterpolantSequences, 36/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-18 21:15:56,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481af938-5056-4a3d-8a5e-38c56b4f8d13/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE