./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:30:17,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:17,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:17,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:17,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:17,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:17,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:17,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:17,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:17,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:17,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:17,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:17,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:17,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:17,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:17,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:17,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:17,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:17,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:17,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:17,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:17,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:17,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:17,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:17,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:17,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:17,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:17,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:17,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:17,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:17,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:17,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:17,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:17,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:17,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:17,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:17,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:17,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:17,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:17,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:17,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:17,565 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:30:17,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:17,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:17,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:17,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:17,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:17,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:17,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:17,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:17,603 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:17,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:17,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:17,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:30:17,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:17,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:17,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:17,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:30:17,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:17,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:30:17,606 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:30:17,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:17,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:30:17,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:17,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:30:17,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:17,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:17,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:17,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:17,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:17,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:17,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:30:17,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:17,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:17,609 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:30:17,609 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:30:17,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:30:17,610 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_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2022-11-20 10:30:17,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:17,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:17,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:17,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:17,917 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:17,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-11-20 10:30:21,011 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:21,347 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:21,348 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-11-20 10:30:21,362 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/data/344306e91/4736e5a9b3c248ea84284593b2afdd76/FLAGce3953038 [2022-11-20 10:30:21,377 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/data/344306e91/4736e5a9b3c248ea84284593b2afdd76 [2022-11-20 10:30:21,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:21,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:21,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:21,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:21,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:21,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:21" (1/1) ... [2022-11-20 10:30:21,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a41b0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:21, skipping insertion in model container [2022-11-20 10:30:21,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:21" (1/1) ... [2022-11-20 10:30:21,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:21,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:21,998 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-11-20 10:30:22,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:22,069 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:22,127 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-11-20 10:30:22,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:22,227 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:22,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22 WrapperNode [2022-11-20 10:30:22,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:22,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:22,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:22,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:22,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,317 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 269 [2022-11-20 10:30:22,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:22,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:22,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:22,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:22,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:22,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:22,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:22,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:22,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (1/1) ... [2022-11-20 10:30:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:22,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:22,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:22,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-20 10:30:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-20 10:30:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:22,461 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:30:22,608 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:22,610 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:23,183 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:23,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:23,193 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-20 10:30:23,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:23 BoogieIcfgContainer [2022-11-20 10:30:23,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:23,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:23,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:23,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:23,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:21" (1/3) ... [2022-11-20 10:30:23,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11558811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:23, skipping insertion in model container [2022-11-20 10:30:23,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:22" (2/3) ... [2022-11-20 10:30:23,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11558811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:23, skipping insertion in model container [2022-11-20 10:30:23,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:23" (3/3) ... [2022-11-20 10:30:23,205 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2022-11-20 10:30:23,214 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:30:23,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:23,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-20 10:30:23,225 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:30:23,301 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 10:30:23,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 296 transitions, 600 flow [2022-11-20 10:30:23,482 INFO L130 PetriNetUnfolder]: 73/453 cut-off events. [2022-11-20 10:30:23,482 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 10:30:23,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 453 events. 73/453 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2189 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 248. Up to 8 conditions per place. [2022-11-20 10:30:23,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 296 transitions, 600 flow [2022-11-20 10:30:23,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 293 transitions, 594 flow [2022-11-20 10:30:23,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:23,541 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;@77a6e22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:23,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-20 10:30:23,556 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 10:30:23,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:30:23,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:23,557 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] [2022-11-20 10:30:23,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash 345272585, now seen corresponding path program 1 times [2022-11-20 10:30:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136585860] [2022-11-20 10:30:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136585860] [2022-11-20 10:30:23,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136585860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:23,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:23,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642495645] [2022-11-20 10:30:23,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:23,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:24,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:24,024 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:24,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 293 transitions, 594 flow. Second operand has 4 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:24,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:24,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:24,251 INFO L130 PetriNetUnfolder]: 9/389 cut-off events. [2022-11-20 10:30:24,251 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 10:30:24,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 389 events. 9/389 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1763 event pairs, 0 based on Foata normal form. 62/402 useless extension candidates. Maximal degree in co-relation 210. Up to 15 conditions per place. [2022-11-20 10:30:24,259 INFO L137 encePairwiseOnDemand]: 251/296 looper letters, 17 selfloop transitions, 4 changer transitions 0/259 dead transitions. [2022-11-20 10:30:24,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 568 flow [2022-11-20 10:30:24,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1268 transitions. [2022-11-20 10:30:24,292 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8567567567567568 [2022-11-20 10:30:24,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1268 transitions. [2022-11-20 10:30:24,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1268 transitions. [2022-11-20 10:30:24,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:24,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1268 transitions. [2022-11-20 10:30:24,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,316 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,317 INFO L175 Difference]: Start difference. First operand has 252 places, 293 transitions, 594 flow. Second operand 5 states and 1268 transitions. [2022-11-20 10:30:24,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 568 flow [2022-11-20 10:30:24,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:30:24,329 INFO L231 Difference]: Finished difference. Result has 256 places, 255 transitions, 544 flow [2022-11-20 10:30:24,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=256, PETRI_TRANSITIONS=255} [2022-11-20 10:30:24,335 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 4 predicate places. [2022-11-20 10:30:24,335 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 255 transitions, 544 flow [2022-11-20 10:30:24,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:24,337 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:24,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:24,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash -495076173, now seen corresponding path program 1 times [2022-11-20 10:30:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:24,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181379806] [2022-11-20 10:30:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:24,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:24,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181379806] [2022-11-20 10:30:24,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181379806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:24,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:24,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840119] [2022-11-20 10:30:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:24,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:24,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:24,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:24,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:24,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:24,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:24,528 INFO L130 PetriNetUnfolder]: 9/388 cut-off events. [2022-11-20 10:30:24,528 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-20 10:30:24,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 388 events. 9/388 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1757 event pairs, 0 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 378. Up to 7 conditions per place. [2022-11-20 10:30:24,532 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 9 selfloop transitions, 8 changer transitions 0/255 dead transitions. [2022-11-20 10:30:24,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 255 transitions, 576 flow [2022-11-20 10:30:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1220 transitions. [2022-11-20 10:30:24,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8243243243243243 [2022-11-20 10:30:24,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1220 transitions. [2022-11-20 10:30:24,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1220 transitions. [2022-11-20 10:30:24,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:24,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1220 transitions. [2022-11-20 10:30:24,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,545 INFO L175 Difference]: Start difference. First operand has 256 places, 255 transitions, 544 flow. Second operand 5 states and 1220 transitions. [2022-11-20 10:30:24,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 255 transitions, 576 flow [2022-11-20 10:30:24,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 255 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:30:24,552 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 562 flow [2022-11-20 10:30:24,553 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-11-20 10:30:24,554 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 7 predicate places. [2022-11-20 10:30:24,554 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 562 flow [2022-11-20 10:30:24,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,555 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:24,555 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:24,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:24,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1832508587, now seen corresponding path program 1 times [2022-11-20 10:30:24,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:24,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294847607] [2022-11-20 10:30:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:24,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294847607] [2022-11-20 10:30:24,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294847607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:24,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493117111] [2022-11-20 10:30:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:24,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:24,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:24,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:24,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:30:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:24,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:30:24,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:24,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:24,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493117111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:24,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:24,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:30:24,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422692904] [2022-11-20 10:30:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:24,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:24,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:24,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 243.8) internal successors, (1219), 5 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:24,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:24,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:24,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:25,065 INFO L130 PetriNetUnfolder]: 9/387 cut-off events. [2022-11-20 10:30:25,065 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-20 10:30:25,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 387 events. 9/387 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1750 event pairs, 0 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 376. Up to 10 conditions per place. [2022-11-20 10:30:25,069 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 11 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2022-11-20 10:30:25,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 254 transitions, 590 flow [2022-11-20 10:30:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:30:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:30:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2022-11-20 10:30:25,073 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825168918918919 [2022-11-20 10:30:25,073 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2022-11-20 10:30:25,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2022-11-20 10:30:25,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:25,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2022-11-20 10:30:25,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,081 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,081 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 562 flow. Second operand 4 states and 977 transitions. [2022-11-20 10:30:25,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 254 transitions, 590 flow [2022-11-20 10:30:25,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:30:25,089 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 556 flow [2022-11-20 10:30:25,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=556, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2022-11-20 10:30:25,093 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 6 predicate places. [2022-11-20 10:30:25,093 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 556 flow [2022-11-20 10:30:25,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 243.8) internal successors, (1219), 5 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,094 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:25,094 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] [2022-11-20 10:30:25,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 10:30:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:25,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash -169423497, now seen corresponding path program 1 times [2022-11-20 10:30:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:25,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773446632] [2022-11-20 10:30:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:25,456 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-20 10:30:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773446632] [2022-11-20 10:30:25,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773446632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:25,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684916044] [2022-11-20 10:30:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:25,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:25,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:30:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:25,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:30:25,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:25,641 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-20 10:30:25,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:25,691 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-20 10:30:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684916044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:25,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:25,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:30:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835127939] [2022-11-20 10:30:25,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:25,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:30:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:25,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:30:25,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:30:25,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:25,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 556 flow. Second operand has 10 states, 10 states have (on average 243.7) internal successors, (2437), 10 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:25,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:25,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:25,923 INFO L130 PetriNetUnfolder]: 9/395 cut-off events. [2022-11-20 10:30:25,924 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 10:30:25,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 395 events. 9/395 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1737 event pairs, 0 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 366. Up to 7 conditions per place. [2022-11-20 10:30:25,928 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 18 selfloop transitions, 9 changer transitions 0/265 dead transitions. [2022-11-20 10:30:25,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 648 flow [2022-11-20 10:30:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:30:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2198 transitions. [2022-11-20 10:30:25,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825075075075075 [2022-11-20 10:30:25,935 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2198 transitions. [2022-11-20 10:30:25,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2198 transitions. [2022-11-20 10:30:25,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:25,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2198 transitions. [2022-11-20 10:30:25,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.22222222222223) internal successors, (2198), 9 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 296.0) internal successors, (2960), 10 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,951 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 296.0) internal successors, (2960), 10 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,951 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 556 flow. Second operand 9 states and 2198 transitions. [2022-11-20 10:30:25,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 648 flow [2022-11-20 10:30:25,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 634 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:30:25,959 INFO L231 Difference]: Finished difference. Result has 267 places, 258 transitions, 602 flow [2022-11-20 10:30:25,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=267, PETRI_TRANSITIONS=258} [2022-11-20 10:30:25,961 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 15 predicate places. [2022-11-20 10:30:25,962 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 258 transitions, 602 flow [2022-11-20 10:30:25,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.7) internal successors, (2437), 10 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:25,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:25,964 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:25,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:26,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:26,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1870480841, now seen corresponding path program 2 times [2022-11-20 10:30:26,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:26,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062528561] [2022-11-20 10:30:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:30:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062528561] [2022-11-20 10:30:26,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062528561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:26,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:26,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239717164] [2022-11-20 10:30:26,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:26,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:26,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:26,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:26,257 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:26,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 258 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 242.75) internal successors, (971), 4 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-20 10:30:26,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:26,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:26,347 INFO L130 PetriNetUnfolder]: 6/267 cut-off events. [2022-11-20 10:30:26,347 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-20 10:30:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 267 events. 6/267 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 812 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 250. Up to 7 conditions per place. [2022-11-20 10:30:26,351 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 10 selfloop transitions, 4 changer transitions 0/258 dead transitions. [2022-11-20 10:30:26,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 258 transitions, 630 flow [2022-11-20 10:30:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1222 transitions. [2022-11-20 10:30:26,355 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256756756756757 [2022-11-20 10:30:26,356 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1222 transitions. [2022-11-20 10:30:26,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1222 transitions. [2022-11-20 10:30:26,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:26,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1222 transitions. [2022-11-20 10:30:26,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.4) internal successors, (1222), 5 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:26,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:26,364 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:26,364 INFO L175 Difference]: Start difference. First operand has 267 places, 258 transitions, 602 flow. Second operand 5 states and 1222 transitions. [2022-11-20 10:30:26,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 258 transitions, 630 flow [2022-11-20 10:30:26,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 258 transitions, 614 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:30:26,371 INFO L231 Difference]: Finished difference. Result has 266 places, 256 transitions, 594 flow [2022-11-20 10:30:26,372 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=266, PETRI_TRANSITIONS=256} [2022-11-20 10:30:26,373 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 14 predicate places. [2022-11-20 10:30:26,373 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 256 transitions, 594 flow [2022-11-20 10:30:26,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 242.75) internal successors, (971), 4 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-20 10:30:26,374 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:26,374 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:26,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:30:26,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 7125757, now seen corresponding path program 1 times [2022-11-20 10:30:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:26,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86394784] [2022-11-20 10:30:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:26,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86394784] [2022-11-20 10:30:26,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86394784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684862751] [2022-11-20 10:30:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:26,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:26,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:30:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:26,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:30:26,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:26,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:26,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684862751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:26,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:26,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 10:30:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864617485] [2022-11-20 10:30:26,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:26,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:30:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:30:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:30:26,929 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:26,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 256 transitions, 594 flow. Second operand has 18 states, 18 states have (on average 244.05555555555554) internal successors, (4393), 18 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:26,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:26,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:26,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:27,282 INFO L130 PetriNetUnfolder]: 6/295 cut-off events. [2022-11-20 10:30:27,282 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-20 10:30:27,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 295 events. 6/295 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 813 event pairs, 0 based on Foata normal form. 4/273 useless extension candidates. Maximal degree in co-relation 243. Up to 9 conditions per place. [2022-11-20 10:30:27,286 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 34 selfloop transitions, 21 changer transitions 0/291 dead transitions. [2022-11-20 10:30:27,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 291 transitions, 858 flow [2022-11-20 10:30:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:30:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:30:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5120 transitions. [2022-11-20 10:30:27,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8236808236808236 [2022-11-20 10:30:27,298 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5120 transitions. [2022-11-20 10:30:27,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5120 transitions. [2022-11-20 10:30:27,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:27,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5120 transitions. [2022-11-20 10:30:27,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 243.8095238095238) internal successors, (5120), 21 states have internal predecessors, (5120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:27,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 296.0) internal successors, (6512), 22 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:27,331 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 296.0) internal successors, (6512), 22 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:27,332 INFO L175 Difference]: Start difference. First operand has 266 places, 256 transitions, 594 flow. Second operand 21 states and 5120 transitions. [2022-11-20 10:30:27,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 291 transitions, 858 flow [2022-11-20 10:30:27,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 291 transitions, 850 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:30:27,341 INFO L231 Difference]: Finished difference. Result has 287 places, 269 transitions, 742 flow [2022-11-20 10:30:27,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=742, PETRI_PLACES=287, PETRI_TRANSITIONS=269} [2022-11-20 10:30:27,344 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 35 predicate places. [2022-11-20 10:30:27,344 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 269 transitions, 742 flow [2022-11-20 10:30:27,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 244.05555555555554) internal successors, (4393), 18 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:27,363 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:27,363 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:27,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:27,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:30:27,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1631003773, now seen corresponding path program 2 times [2022-11-20 10:30:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:27,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330749131] [2022-11-20 10:30:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:28,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:28,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330749131] [2022-11-20 10:30:28,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330749131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:28,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429859009] [2022-11-20 10:30:28,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:30:28,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:28,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:28,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:28,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:30:28,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:30:28,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:28,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:30:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:28,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:30:28,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429859009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:28,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:28,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 10:30:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116614390] [2022-11-20 10:30:28,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:30:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:30:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:30:28,582 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 296 [2022-11-20 10:30:28,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 269 transitions, 742 flow. Second operand has 23 states, 23 states have (on average 244.30434782608697) internal successors, (5619), 23 states have internal predecessors, (5619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:28,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:28,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 296 [2022-11-20 10:30:28,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:29,045 INFO L130 PetriNetUnfolder]: 6/316 cut-off events. [2022-11-20 10:30:29,045 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-20 10:30:29,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 316 events. 6/316 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 3/293 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-20 10:30:29,050 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 46 selfloop transitions, 30 changer transitions 0/312 dead transitions. [2022-11-20 10:30:29,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 312 transitions, 1104 flow [2022-11-20 10:30:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:30:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 10:30:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7309 transitions. [2022-11-20 10:30:29,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8230855855855855 [2022-11-20 10:30:29,067 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7309 transitions. [2022-11-20 10:30:29,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7309 transitions. [2022-11-20 10:30:29,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:29,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7309 transitions. [2022-11-20 10:30:29,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 243.63333333333333) internal successors, (7309), 30 states have internal predecessors, (7309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 296.0) internal successors, (9176), 31 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,107 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 296.0) internal successors, (9176), 31 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,108 INFO L175 Difference]: Start difference. First operand has 287 places, 269 transitions, 742 flow. Second operand 30 states and 7309 transitions. [2022-11-20 10:30:29,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 312 transitions, 1104 flow [2022-11-20 10:30:29,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 312 transitions, 1024 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 10:30:29,116 INFO L231 Difference]: Finished difference. Result has 312 places, 279 transitions, 840 flow [2022-11-20 10:30:29,116 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=840, PETRI_PLACES=312, PETRI_TRANSITIONS=279} [2022-11-20 10:30:29,117 INFO L288 CegarLoopForPetriNet]: 252 programPoint places, 60 predicate places. [2022-11-20 10:30:29,117 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 279 transitions, 840 flow [2022-11-20 10:30:29,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.30434782608697) internal successors, (5619), 23 states have internal predecessors, (5619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:29,120 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:29,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:29,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:29,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-20 10:30:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 394578151, now seen corresponding path program 3 times [2022-11-20 10:30:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:29,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906703546] [2022-11-20 10:30:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:29,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:30:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:30:29,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:30:29,406 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:30:29,408 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2022-11-20 10:30:29,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2022-11-20 10:30:29,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2022-11-20 10:30:29,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2022-11-20 10:30:29,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2022-11-20 10:30:29,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2022-11-20 10:30:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2022-11-20 10:30:29,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2022-11-20 10:30:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2022-11-20 10:30:29,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2022-11-20 10:30:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2022-11-20 10:30:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2022-11-20 10:30:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2022-11-20 10:30:29,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2022-11-20 10:30:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2022-11-20 10:30:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2022-11-20 10:30:29,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2022-11-20 10:30:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2022-11-20 10:30:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2022-11-20 10:30:29,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2022-11-20 10:30:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2022-11-20 10:30:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2022-11-20 10:30:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2022-11-20 10:30:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2022-11-20 10:30:29,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2022-11-20 10:30:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2022-11-20 10:30:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2022-11-20 10:30:29,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2022-11-20 10:30:29,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2022-11-20 10:30:29,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:30:29,422 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-20 10:30:29,424 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 10:30:29,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-20 10:30:29,489 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 10:30:29,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 380 transitions, 778 flow [2022-11-20 10:30:29,638 INFO L130 PetriNetUnfolder]: 118/731 cut-off events. [2022-11-20 10:30:29,638 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 10:30:29,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 731 events. 118/731 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3930 event pairs, 0 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 455. Up to 12 conditions per place. [2022-11-20 10:30:29,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 380 transitions, 778 flow [2022-11-20 10:30:29,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 380 transitions, 778 flow [2022-11-20 10:30:29,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:29,670 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;@77a6e22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:29,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-20 10:30:29,674 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 10:30:29,675 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:30:29,675 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:29,675 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] [2022-11-20 10:30:29,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1413576965, now seen corresponding path program 1 times [2022-11-20 10:30:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:29,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181490443] [2022-11-20 10:30:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:29,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:29,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181490443] [2022-11-20 10:30:29,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181490443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:29,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:29,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752992360] [2022-11-20 10:30:29,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:29,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:29,723 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:29,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 380 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:29,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:29,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:29,874 INFO L130 PetriNetUnfolder]: 17/629 cut-off events. [2022-11-20 10:30:29,875 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-20 10:30:29,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 629 events. 17/629 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3350 event pairs, 0 based on Foata normal form. 126/672 useless extension candidates. Maximal degree in co-relation 415. Up to 19 conditions per place. [2022-11-20 10:30:29,886 INFO L137 encePairwiseOnDemand]: 323/380 looper letters, 19 selfloop transitions, 4 changer transitions 0/333 dead transitions. [2022-11-20 10:30:29,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 333 transitions, 730 flow [2022-11-20 10:30:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-11-20 10:30:29,891 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8563157894736843 [2022-11-20 10:30:29,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1627 transitions. [2022-11-20 10:30:29,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1627 transitions. [2022-11-20 10:30:29,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:29,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1627 transitions. [2022-11-20 10:30:29,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 325.4) internal successors, (1627), 5 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,901 INFO L175 Difference]: Start difference. First operand has 325 places, 380 transitions, 778 flow. Second operand 5 states and 1627 transitions. [2022-11-20 10:30:29,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 333 transitions, 730 flow [2022-11-20 10:30:29,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 333 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:30:29,907 INFO L231 Difference]: Finished difference. Result has 328 places, 329 transitions, 702 flow [2022-11-20 10:30:29,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=328, PETRI_TRANSITIONS=329} [2022-11-20 10:30:29,909 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 3 predicate places. [2022-11-20 10:30:29,909 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 329 transitions, 702 flow [2022-11-20 10:30:29,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.5) internal successors, (1246), 4 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:29,910 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:29,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:30:29,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1545477069, now seen corresponding path program 1 times [2022-11-20 10:30:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583636452] [2022-11-20 10:30:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:30:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:29,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583636452] [2022-11-20 10:30:29,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583636452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:29,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:29,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112025301] [2022-11-20 10:30:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:29,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:29,959 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:29,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 329 transitions, 702 flow. Second operand has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:29,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:29,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:29,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:30,124 INFO L130 PetriNetUnfolder]: 17/628 cut-off events. [2022-11-20 10:30:30,125 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 10:30:30,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 628 events. 17/628 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3351 event pairs, 0 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2022-11-20 10:30:30,137 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 11 selfloop transitions, 8 changer transitions 0/329 dead transitions. [2022-11-20 10:30:30,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 738 flow [2022-11-20 10:30:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-11-20 10:30:30,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247368421052632 [2022-11-20 10:30:30,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-11-20 10:30:30,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-11-20 10:30:30,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:30,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-11-20 10:30:30,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,151 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,151 INFO L175 Difference]: Start difference. First operand has 328 places, 329 transitions, 702 flow. Second operand 5 states and 1567 transitions. [2022-11-20 10:30:30,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 738 flow [2022-11-20 10:30:30,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:30:30,158 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 720 flow [2022-11-20 10:30:30,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2022-11-20 10:30:30,159 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 6 predicate places. [2022-11-20 10:30:30,159 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 720 flow [2022-11-20 10:30:30,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.25) internal successors, (1253), 4 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,160 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:30,160 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:30,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:30:30,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash -665147737, now seen corresponding path program 1 times [2022-11-20 10:30:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:30,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662343745] [2022-11-20 10:30:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662343745] [2022-11-20 10:30:30,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662343745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454968006] [2022-11-20 10:30:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:30,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:30,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:30,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:30,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:30:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:30,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:30:30,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:30:30,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:30,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454968006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:30,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:30,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:30:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992724444] [2022-11-20 10:30:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:30,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:30,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:30,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:30,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:30,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:30,521 INFO L130 PetriNetUnfolder]: 17/627 cut-off events. [2022-11-20 10:30:30,522 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-20 10:30:30,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 627 events. 17/627 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3337 event pairs, 0 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 627. Up to 14 conditions per place. [2022-11-20 10:30:30,533 INFO L137 encePairwiseOnDemand]: 376/380 looper letters, 13 selfloop transitions, 5 changer transitions 0/328 dead transitions. [2022-11-20 10:30:30,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 752 flow [2022-11-20 10:30:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:30:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:30:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-11-20 10:30:30,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256578947368421 [2022-11-20 10:30:30,537 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-11-20 10:30:30,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-11-20 10:30:30,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:30,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-11-20 10:30:30,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,544 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,545 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 720 flow. Second operand 4 states and 1255 transitions. [2022-11-20 10:30:30,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 752 flow [2022-11-20 10:30:30,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 740 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:30:30,551 INFO L231 Difference]: Finished difference. Result has 330 places, 328 transitions, 714 flow [2022-11-20 10:30:30,552 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=714, PETRI_PLACES=330, PETRI_TRANSITIONS=328} [2022-11-20 10:30:30,553 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 5 predicate places. [2022-11-20 10:30:30,553 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 328 transitions, 714 flow [2022-11-20 10:30:30,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:30,554 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:30,554 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] [2022-11-20 10:30:30,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:30,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:30:30,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1243406533, now seen corresponding path program 1 times [2022-11-20 10:30:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:30,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630694994] [2022-11-20 10:30:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:30,830 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-20 10:30:30,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:30,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630694994] [2022-11-20 10:30:30,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630694994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:30,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338032311] [2022-11-20 10:30:30,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:30,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:30,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:30,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:30,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:30:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:30,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:30:30,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:30,972 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-20 10:30:30,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:31,007 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-20 10:30:31,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338032311] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:31,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:31,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:30:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456534399] [2022-11-20 10:30:31,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:31,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:30:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:31,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:30:31,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:30:31,013 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:31,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 328 transitions, 714 flow. Second operand has 10 states, 10 states have (on average 312.7) internal successors, (3127), 10 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:31,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:31,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:31,220 INFO L130 PetriNetUnfolder]: 17/635 cut-off events. [2022-11-20 10:30:31,220 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-20 10:30:31,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 635 events. 17/635 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3323 event pairs, 0 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 617. Up to 11 conditions per place. [2022-11-20 10:30:31,238 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 20 selfloop transitions, 9 changer transitions 0/339 dead transitions. [2022-11-20 10:30:31,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 339 transitions, 810 flow [2022-11-20 10:30:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:30:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:30:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2821 transitions. [2022-11-20 10:30:31,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8248538011695906 [2022-11-20 10:30:31,246 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2821 transitions. [2022-11-20 10:30:31,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2821 transitions. [2022-11-20 10:30:31,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:31,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2821 transitions. [2022-11-20 10:30:31,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 313.44444444444446) internal successors, (2821), 9 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 380.0) internal successors, (3800), 10 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,263 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 380.0) internal successors, (3800), 10 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,263 INFO L175 Difference]: Start difference. First operand has 330 places, 328 transitions, 714 flow. Second operand 9 states and 2821 transitions. [2022-11-20 10:30:31,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 339 transitions, 810 flow [2022-11-20 10:30:31,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 339 transitions, 796 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:30:31,271 INFO L231 Difference]: Finished difference. Result has 339 places, 332 transitions, 760 flow [2022-11-20 10:30:31,271 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=760, PETRI_PLACES=339, PETRI_TRANSITIONS=332} [2022-11-20 10:30:31,272 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 14 predicate places. [2022-11-20 10:30:31,273 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 332 transitions, 760 flow [2022-11-20 10:30:31,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 312.7) internal successors, (3127), 10 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,274 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:31,274 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:31,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:31,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:30:31,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash -479457019, now seen corresponding path program 2 times [2022-11-20 10:30:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:31,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89812908] [2022-11-20 10:30:31,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:31,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:30:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:31,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89812908] [2022-11-20 10:30:31,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89812908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:31,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:31,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952472975] [2022-11-20 10:30:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:31,544 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:31,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 332 transitions, 760 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:31,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:31,721 INFO L130 PetriNetUnfolder]: 13/516 cut-off events. [2022-11-20 10:30:31,722 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-20 10:30:31,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 516 events. 13/516 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2446 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 520. Up to 21 conditions per place. [2022-11-20 10:30:31,732 INFO L137 encePairwiseOnDemand]: 373/380 looper letters, 19 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2022-11-20 10:30:31,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 339 transitions, 820 flow [2022-11-20 10:30:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1576 transitions. [2022-11-20 10:30:31,739 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294736842105264 [2022-11-20 10:30:31,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1576 transitions. [2022-11-20 10:30:31,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1576 transitions. [2022-11-20 10:30:31,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:31,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1576 transitions. [2022-11-20 10:30:31,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.2) internal successors, (1576), 5 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,747 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,747 INFO L175 Difference]: Start difference. First operand has 339 places, 332 transitions, 760 flow. Second operand 5 states and 1576 transitions. [2022-11-20 10:30:31,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 339 transitions, 820 flow [2022-11-20 10:30:31,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 339 transitions, 804 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:30:31,754 INFO L231 Difference]: Finished difference. Result has 342 places, 335 transitions, 776 flow [2022-11-20 10:30:31,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=776, PETRI_PLACES=342, PETRI_TRANSITIONS=335} [2022-11-20 10:30:31,756 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 17 predicate places. [2022-11-20 10:30:31,756 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 335 transitions, 776 flow [2022-11-20 10:30:31,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,758 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:31,758 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:31,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:30:31,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash -504147163, now seen corresponding path program 1 times [2022-11-20 10:30:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:31,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063553011] [2022-11-20 10:30:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 10:30:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:31,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063553011] [2022-11-20 10:30:31,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063553011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:31,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:31,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307444867] [2022-11-20 10:30:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:31,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:30:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:30:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:30:31,824 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:31,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 335 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:31,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:31,965 INFO L130 PetriNetUnfolder]: 13/515 cut-off events. [2022-11-20 10:30:31,965 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-20 10:30:31,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 515 events. 13/515 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2447 event pairs, 0 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 527. Up to 10 conditions per place. [2022-11-20 10:30:31,976 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 11 selfloop transitions, 8 changer transitions 0/335 dead transitions. [2022-11-20 10:30:31,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 335 transitions, 812 flow [2022-11-20 10:30:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:30:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:30:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-11-20 10:30:31,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247368421052632 [2022-11-20 10:30:31,980 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-11-20 10:30:31,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-11-20 10:30:31,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:31,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-11-20 10:30:31,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,987 INFO L175 Difference]: Start difference. First operand has 342 places, 335 transitions, 776 flow. Second operand 5 states and 1567 transitions. [2022-11-20 10:30:31,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 335 transitions, 812 flow [2022-11-20 10:30:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 335 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:30:31,994 INFO L231 Difference]: Finished difference. Result has 345 places, 335 transitions, 794 flow [2022-11-20 10:30:31,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=794, PETRI_PLACES=345, PETRI_TRANSITIONS=335} [2022-11-20 10:30:31,996 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 20 predicate places. [2022-11-20 10:30:31,996 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 335 transitions, 794 flow [2022-11-20 10:30:31,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:31,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:31,997 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:31,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:30:31,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1551308074, now seen corresponding path program 1 times [2022-11-20 10:30:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:31,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740847739] [2022-11-20 10:30:31,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:30:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740847739] [2022-11-20 10:30:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740847739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622693786] [2022-11-20 10:30:32,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:32,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:32,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:32,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:30:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:32,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:30:32,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:30:32,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:30:32,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622693786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:32,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:32,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 10:30:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917200936] [2022-11-20 10:30:32,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:30:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:30:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:30:32,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:32,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 335 transitions, 794 flow. Second operand has 18 states, 18 states have (on average 313.1111111111111) internal successors, (5636), 18 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:32,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:32,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:32,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:32,866 INFO L130 PetriNetUnfolder]: 13/543 cut-off events. [2022-11-20 10:30:32,866 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-20 10:30:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 543 events. 13/543 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2440 event pairs, 0 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 521. Up to 11 conditions per place. [2022-11-20 10:30:32,878 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 36 selfloop transitions, 21 changer transitions 0/370 dead transitions. [2022-11-20 10:30:32,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 1062 flow [2022-11-20 10:30:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:30:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:30:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6571 transitions. [2022-11-20 10:30:32,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234335839598997 [2022-11-20 10:30:32,890 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6571 transitions. [2022-11-20 10:30:32,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6571 transitions. [2022-11-20 10:30:32,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:32,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6571 transitions. [2022-11-20 10:30:32,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 312.9047619047619) internal successors, (6571), 21 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:32,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 380.0) internal successors, (8360), 22 states have internal predecessors, (8360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:32,922 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 380.0) internal successors, (8360), 22 states have internal predecessors, (8360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:32,922 INFO L175 Difference]: Start difference. First operand has 345 places, 335 transitions, 794 flow. Second operand 21 states and 6571 transitions. [2022-11-20 10:30:32,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 1062 flow [2022-11-20 10:30:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 370 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:30:32,929 INFO L231 Difference]: Finished difference. Result has 367 places, 348 transitions, 938 flow [2022-11-20 10:30:32,930 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=938, PETRI_PLACES=367, PETRI_TRANSITIONS=348} [2022-11-20 10:30:32,931 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 42 predicate places. [2022-11-20 10:30:32,931 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 348 transitions, 938 flow [2022-11-20 10:30:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 313.1111111111111) internal successors, (5636), 18 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:32,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:32,933 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:32,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:33,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:30:33,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1908419414, now seen corresponding path program 2 times [2022-11-20 10:30:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:33,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043946331] [2022-11-20 10:30:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:33,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:30:33,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:33,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043946331] [2022-11-20 10:30:33,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043946331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:33,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762938226] [2022-11-20 10:30:33,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:30:33,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:33,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:33,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:33,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:30:33,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:30:33,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:33,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:30:33,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:30:33,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:30:34,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762938226] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:34,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:34,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 10:30:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686399123] [2022-11-20 10:30:34,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:34,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:30:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:34,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:30:34,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:30:34,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:34,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 348 transitions, 938 flow. Second operand has 23 states, 23 states have (on average 313.3478260869565) internal successors, (7207), 23 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:34,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:34,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:34,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:34,587 INFO L130 PetriNetUnfolder]: 13/564 cut-off events. [2022-11-20 10:30:34,587 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-20 10:30:34,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 564 events. 13/564 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2440 event pairs, 0 based on Foata normal form. 3/509 useless extension candidates. Maximal degree in co-relation 575. Up to 12 conditions per place. [2022-11-20 10:30:34,598 INFO L137 encePairwiseOnDemand]: 374/380 looper letters, 48 selfloop transitions, 30 changer transitions 0/391 dead transitions. [2022-11-20 10:30:34,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 391 transitions, 1304 flow [2022-11-20 10:30:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:30:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 10:30:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9381 transitions. [2022-11-20 10:30:34,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8228947368421052 [2022-11-20 10:30:34,610 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9381 transitions. [2022-11-20 10:30:34,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9381 transitions. [2022-11-20 10:30:34,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:34,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9381 transitions. [2022-11-20 10:30:34,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 312.7) internal successors, (9381), 30 states have internal predecessors, (9381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:34,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 380.0) internal successors, (11780), 31 states have internal predecessors, (11780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:34,650 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 380.0) internal successors, (11780), 31 states have internal predecessors, (11780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:34,650 INFO L175 Difference]: Start difference. First operand has 367 places, 348 transitions, 938 flow. Second operand 30 states and 9381 transitions. [2022-11-20 10:30:34,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 391 transitions, 1304 flow [2022-11-20 10:30:34,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 391 transitions, 1224 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 10:30:34,659 INFO L231 Difference]: Finished difference. Result has 392 places, 358 transitions, 1036 flow [2022-11-20 10:30:34,660 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1036, PETRI_PLACES=392, PETRI_TRANSITIONS=358} [2022-11-20 10:30:34,661 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 67 predicate places. [2022-11-20 10:30:34,661 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 358 transitions, 1036 flow [2022-11-20 10:30:34,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 313.3478260869565) internal successors, (7207), 23 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:34,663 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:34,664 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:34,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:34,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:30:34,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:34,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2090743300, now seen corresponding path program 3 times [2022-11-20 10:30:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:34,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209419890] [2022-11-20 10:30:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:30:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:35,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209419890] [2022-11-20 10:30:35,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209419890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:35,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369685735] [2022-11-20 10:30:35,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:30:35,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:35,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:35,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:30:35,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:30:35,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:35,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:30:35,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:30:35,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:35,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369685735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:35,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:35,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:30:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864972239] [2022-11-20 10:30:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:35,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:35,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:35,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 380 [2022-11-20 10:30:35,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 358 transitions, 1036 flow. Second operand has 5 states, 5 states have (on average 313.2) internal successors, (1566), 5 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:35,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:35,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 380 [2022-11-20 10:30:35,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:35,371 INFO L130 PetriNetUnfolder]: 13/563 cut-off events. [2022-11-20 10:30:35,371 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-20 10:30:35,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 13/563 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2437 event pairs, 0 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 536. Up to 17 conditions per place. [2022-11-20 10:30:35,383 INFO L137 encePairwiseOnDemand]: 376/380 looper letters, 13 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2022-11-20 10:30:35,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 357 transitions, 1068 flow [2022-11-20 10:30:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:30:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:30:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-11-20 10:30:35,386 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8256578947368421 [2022-11-20 10:30:35,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-11-20 10:30:35,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-11-20 10:30:35,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:30:35,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-11-20 10:30:35,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:35,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:35,392 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 380.0) internal successors, (1900), 5 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:35,392 INFO L175 Difference]: Start difference. First operand has 392 places, 358 transitions, 1036 flow. Second operand 4 states and 1255 transitions. [2022-11-20 10:30:35,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 357 transitions, 1068 flow [2022-11-20 10:30:35,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 357 transitions, 1022 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-20 10:30:35,424 INFO L231 Difference]: Finished difference. Result has 376 places, 357 transitions, 996 flow [2022-11-20 10:30:35,424 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=996, PETRI_PLACES=376, PETRI_TRANSITIONS=357} [2022-11-20 10:30:35,425 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 51 predicate places. [2022-11-20 10:30:35,425 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 357 transitions, 996 flow [2022-11-20 10:30:35,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.2) internal successors, (1566), 5 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:35,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:30:35,427 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:35,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:35,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:30:35,633 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:30:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2023100470, now seen corresponding path program 1 times [2022-11-20 10:30:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:35,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733298370] [2022-11-20 10:30:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:35,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:30:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733298370] [2022-11-20 10:30:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733298370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:36,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:36,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:30:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503519925] [2022-11-20 10:30:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:36,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:30:36,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:36,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:30:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:30:36,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 380 [2022-11-20 10:30:36,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 357 transitions, 996 flow. Second operand has 13 states, 13 states have (on average 242.15384615384616) internal successors, (3148), 13 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:30:36,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:30:36,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 380 [2022-11-20 10:30:36,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:30:59,846 INFO L130 PetriNetUnfolder]: 39167/112347 cut-off events. [2022-11-20 10:30:59,846 INFO L131 PetriNetUnfolder]: For 983/984 co-relation queries the response was YES. [2022-11-20 10:31:00,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170324 conditions, 112347 events. 39167/112347 cut-off events. For 983/984 co-relation queries the response was YES. Maximal size of possible extension queue 3170. Compared 1622938 event pairs, 7977 based on Foata normal form. 0/100150 useless extension candidates. Maximal degree in co-relation 170056. Up to 33109 conditions per place. [2022-11-20 10:31:01,241 INFO L137 encePairwiseOnDemand]: 359/380 looper letters, 546 selfloop transitions, 72 changer transitions 0/889 dead transitions. [2022-11-20 10:31:01,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 889 transitions, 3377 flow [2022-11-20 10:31:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:31:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-20 10:31:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6630 transitions. [2022-11-20 10:31:01,251 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6978947368421052 [2022-11-20 10:31:01,251 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 6630 transitions. [2022-11-20 10:31:01,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 6630 transitions. [2022-11-20 10:31:01,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:01,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 6630 transitions. [2022-11-20 10:31:01,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 265.2) internal successors, (6630), 25 states have internal predecessors, (6630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:01,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 380.0) internal successors, (9880), 26 states have internal predecessors, (9880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:01,279 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 380.0) internal successors, (9880), 26 states have internal predecessors, (9880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:01,279 INFO L175 Difference]: Start difference. First operand has 376 places, 357 transitions, 996 flow. Second operand 25 states and 6630 transitions. [2022-11-20 10:31:01,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 889 transitions, 3377 flow [2022-11-20 10:31:01,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 889 transitions, 3367 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:01,301 INFO L231 Difference]: Finished difference. Result has 415 places, 443 transitions, 1556 flow [2022-11-20 10:31:01,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1556, PETRI_PLACES=415, PETRI_TRANSITIONS=443} [2022-11-20 10:31:01,302 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 90 predicate places. [2022-11-20 10:31:01,303 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 443 transitions, 1556 flow [2022-11-20 10:31:01,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 242.15384615384616) internal successors, (3148), 13 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:01,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:01,304 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:31:01,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:31:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1238947357, now seen corresponding path program 1 times [2022-11-20 10:31:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:01,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333517171] [2022-11-20 10:31:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:31:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:01,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333517171] [2022-11-20 10:31:01,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333517171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:01,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591428217] [2022-11-20 10:31:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:01,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:01,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:01,446 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:01,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:31:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:01,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:31:01,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-20 10:31:01,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:01,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591428217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:01,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:01,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:31:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170368815] [2022-11-20 10:31:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:31:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:01,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:31:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:31:01,601 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 380 [2022-11-20 10:31:01,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 443 transitions, 1556 flow. Second operand has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:01,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:01,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 380 [2022-11-20 10:31:01,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:03,138 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,138 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-20 10:31:03,139 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-11-20 10:31:03,139 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 10:31:03,139 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 10:31:03,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 21#t_funENTRYtrue, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,334 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-20 10:31:03,335 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 10:31:03,335 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-20 10:31:03,335 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 10:31:03,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 249#t_funENTRYtrue, Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,346 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-20 10:31:03,346 INFO L386 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-11-20 10:31:03,346 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 10:31:03,346 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-20 10:31:03,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] t_funEXIT-->L958-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_7|} AuxVars[] AssignedVars[][383], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,440 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-20 10:31:03,440 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 10:31:03,440 INFO L386 tUnfolder$Statistics]: existing Event has 258 ancestors and is cut-off event [2022-11-20 10:31:03,441 INFO L386 tUnfolder$Statistics]: existing Event has 246 ancestors and is cut-off event [2022-11-20 10:31:03,441 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 17#L940true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,441 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-20 10:31:03,441 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-20 10:31:03,442 INFO L386 tUnfolder$Statistics]: existing Event has 245 ancestors and is cut-off event [2022-11-20 10:31:03,442 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-20 10:31:03,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,661 INFO L383 tUnfolder$Statistics]: this new event has 270 ancestors and is cut-off event [2022-11-20 10:31:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:31:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 252 ancestors and is cut-off event [2022-11-20 10:31:03,662 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-20 10:31:03,705 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,706 INFO L383 tUnfolder$Statistics]: this new event has 252 ancestors and is cut-off event [2022-11-20 10:31:03,706 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 10:31:03,706 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-20 10:31:03,706 INFO L386 tUnfolder$Statistics]: existing Event has 252 ancestors and is cut-off event [2022-11-20 10:31:03,706 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-20 10:31:03,707 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L953-17-->L953-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][387], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, t_funThread1of2ForFork0NotInUse, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 2234#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 136#L953-18true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,707 INFO L383 tUnfolder$Statistics]: this new event has 225 ancestors and is cut-off event [2022-11-20 10:31:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-20 10:31:03,708 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 10:31:03,708 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 10:31:03,738 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1319] t_funEXIT-->L958-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem58#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem58#1=|v_ULTIMATE.start_main_#t~mem58#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][416], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 132#L958-5true, 756#true, 462#true, 2301#true, 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, 97#L941-6true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,738 INFO L383 tUnfolder$Statistics]: this new event has 254 ancestors and is cut-off event [2022-11-20 10:31:03,739 INFO L386 tUnfolder$Statistics]: existing Event has 254 ancestors and is cut-off event [2022-11-20 10:31:03,739 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-20 10:31:03,739 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-20 10:31:03,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] L946-4-->L946-5: Formula: (and (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1| (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_11|)) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_12|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_11|, ~#cache~0.base=|v_~#cache~0.base_12|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_11|, ~#cache~0.base=|v_~#cache~0.base_12|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][201], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 181#L946-5true, 280#L959true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 232#L941-10true, 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,866 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-20 10:31:03,867 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-20 10:31:03,867 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-20 10:31:03,867 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-20 10:31:03,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L953-17-->L953-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][387], [Black: 764#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1069#(< |ULTIMATE.start_main_~i~1#1| 9), 338#true, 1218#true, Black: 1234#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0NotInUse, Black: 1623#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1606#(< |ULTIMATE.start_main_~i~1#1| 10), 153#L941-10true, Black: 330#(= |ULTIMATE.start_main_~i~1#1| 0), 2234#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 756#true, 462#true, 2301#true, Black: 739#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 740#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 742#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 2247#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2257#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 747#true, Black: 2273#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2251#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2236#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2265#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 136#L953-18true, Black: 2249#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2235#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2245#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2259#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2271#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2263#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2281#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2267#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2275#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2253#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2255#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2261#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1092#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1052#(< |ULTIMATE.start_main_~i~1#1| 10)]) [2022-11-20 10:31:03,935 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-20 10:31:03,935 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 10:31:03,935 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-20 10:31:03,935 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-20 10:31:03,936 INFO L130 PetriNetUnfolder]: 659/7493 cut-off events. [2022-11-20 10:31:03,936 INFO L131 PetriNetUnfolder]: For 3509/3738 co-relation queries the response was YES. [2022-11-20 10:31:04,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 7493 events. 659/7493 cut-off events. For 3509/3738 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 81498 event pairs, 80 based on Foata normal form. 29/6508 useless extension candidates. Maximal degree in co-relation 10101. Up to 251 conditions per place. [2022-11-20 10:31:04,078 INFO L137 encePairwiseOnDemand]: 377/380 looper letters, 14 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2022-11-20 10:31:04,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 447 transitions, 1596 flow [2022-11-20 10:31:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:31:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:31:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2022-11-20 10:31:04,080 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8412280701754385 [2022-11-20 10:31:04,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 959 transitions. [2022-11-20 10:31:04,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 959 transitions. [2022-11-20 10:31:04,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:04,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 959 transitions. [2022-11-20 10:31:04,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:04,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:04,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 380.0) internal successors, (1520), 4 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:04,085 INFO L175 Difference]: Start difference. First operand has 415 places, 443 transitions, 1556 flow. Second operand 3 states and 959 transitions. [2022-11-20 10:31:04,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 447 transitions, 1596 flow [2022-11-20 10:31:04,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 447 transitions, 1593 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:31:04,113 INFO L231 Difference]: Finished difference. Result has 416 places, 444 transitions, 1565 flow [2022-11-20 10:31:04,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1565, PETRI_PLACES=416, PETRI_TRANSITIONS=444} [2022-11-20 10:31:04,115 INFO L288 CegarLoopForPetriNet]: 325 programPoint places, 91 predicate places. [2022-11-20 10:31:04,115 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 444 transitions, 1565 flow [2022-11-20 10:31:04,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:04,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:04,116 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:04,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:04,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:04,322 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 32 more)] === [2022-11-20 10:31:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:04,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1502322475, now seen corresponding path program 1 times [2022-11-20 10:31:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:04,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802739326] [2022-11-20 10:31:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:04,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:31:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:31:04,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:31:04,397 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:31:04,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2022-11-20 10:31:04,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 35 remaining) [2022-11-20 10:31:04,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 35 remaining) [2022-11-20 10:31:04,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 35 remaining) [2022-11-20 10:31:04,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 35 remaining) [2022-11-20 10:31:04,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 35 remaining) [2022-11-20 10:31:04,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 35 remaining) [2022-11-20 10:31:04,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 35 remaining) [2022-11-20 10:31:04,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 35 remaining) [2022-11-20 10:31:04,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 35 remaining) [2022-11-20 10:31:04,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 35 remaining) [2022-11-20 10:31:04,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 35 remaining) [2022-11-20 10:31:04,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 35 remaining) [2022-11-20 10:31:04,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 35 remaining) [2022-11-20 10:31:04,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 35 remaining) [2022-11-20 10:31:04,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 35 remaining) [2022-11-20 10:31:04,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 35 remaining) [2022-11-20 10:31:04,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 35 remaining) [2022-11-20 10:31:04,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 35 remaining) [2022-11-20 10:31:04,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 35 remaining) [2022-11-20 10:31:04,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 35 remaining) [2022-11-20 10:31:04,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 35 remaining) [2022-11-20 10:31:04,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 35 remaining) [2022-11-20 10:31:04,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 35 remaining) [2022-11-20 10:31:04,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 35 remaining) [2022-11-20 10:31:04,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 35 remaining) [2022-11-20 10:31:04,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 35 remaining) [2022-11-20 10:31:04,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 35 remaining) [2022-11-20 10:31:04,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 35 remaining) [2022-11-20 10:31:04,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 35 remaining) [2022-11-20 10:31:04,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 35 remaining) [2022-11-20 10:31:04,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 35 remaining) [2022-11-20 10:31:04,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 35 remaining) [2022-11-20 10:31:04,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 35 remaining) [2022-11-20 10:31:04,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 35 remaining) [2022-11-20 10:31:04,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:31:04,406 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:04,408 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 10:31:04,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-20 10:31:04,460 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 10:31:04,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 396 places, 464 transitions, 958 flow [2022-11-20 10:31:04,649 INFO L130 PetriNetUnfolder]: 168/1050 cut-off events. [2022-11-20 10:31:04,649 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-20 10:31:04,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 1050 events. 168/1050 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5982 event pairs, 1 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 739. Up to 16 conditions per place. [2022-11-20 10:31:04,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 396 places, 464 transitions, 958 flow [2022-11-20 10:31:04,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 464 transitions, 958 flow [2022-11-20 10:31:04,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:31:04,692 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;@77a6e22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:31:04,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-20 10:31:04,695 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 10:31:04,695 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:31:04,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:04,696 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] [2022-11-20 10:31:04,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash 909625557, now seen corresponding path program 1 times [2022-11-20 10:31:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:04,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850105753] [2022-11-20 10:31:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850105753] [2022-11-20 10:31:04,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850105753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:04,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:04,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:04,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549507636] [2022-11-20 10:31:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:04,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:04,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:04,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 464 transitions, 958 flow. Second operand has 4 states, 4 states have (on average 380.5) internal successors, (1522), 4 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:04,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:04,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:04,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:04,995 INFO L130 PetriNetUnfolder]: 27/905 cut-off events. [2022-11-20 10:31:04,996 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-20 10:31:05,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 905 events. 27/905 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5231 event pairs, 1 based on Foata normal form. 258/1041 useless extension candidates. Maximal degree in co-relation 662. Up to 28 conditions per place. [2022-11-20 10:31:05,020 INFO L137 encePairwiseOnDemand]: 395/464 looper letters, 21 selfloop transitions, 4 changer transitions 0/404 dead transitions. [2022-11-20 10:31:05,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 404 transitions, 888 flow [2022-11-20 10:31:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1986 transitions. [2022-11-20 10:31:05,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8560344827586207 [2022-11-20 10:31:05,024 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1986 transitions. [2022-11-20 10:31:05,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1986 transitions. [2022-11-20 10:31:05,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:05,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1986 transitions. [2022-11-20 10:31:05,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 397.2) internal successors, (1986), 5 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,034 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,034 INFO L175 Difference]: Start difference. First operand has 396 places, 464 transitions, 958 flow. Second operand 5 states and 1986 transitions. [2022-11-20 10:31:05,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 404 transitions, 888 flow [2022-11-20 10:31:05,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 404 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:31:05,042 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 856 flow [2022-11-20 10:31:05,043 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=856, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2022-11-20 10:31:05,044 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 2 predicate places. [2022-11-20 10:31:05,044 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 856 flow [2022-11-20 10:31:05,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 380.5) internal successors, (1522), 4 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,045 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:05,045 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:05,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:31:05,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1200505293, now seen corresponding path program 1 times [2022-11-20 10:31:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636094815] [2022-11-20 10:31:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:31:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:05,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636094815] [2022-11-20 10:31:05,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636094815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:05,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:05,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360892865] [2022-11-20 10:31:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:05,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:05,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:05,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:05,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 856 flow. Second operand has 4 states, 4 states have (on average 382.25) internal successors, (1529), 4 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:05,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:05,584 INFO L130 PetriNetUnfolder]: 27/904 cut-off events. [2022-11-20 10:31:05,584 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-20 10:31:05,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 904 events. 27/904 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5224 event pairs, 1 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 927. Up to 20 conditions per place. [2022-11-20 10:31:05,603 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 13 selfloop transitions, 8 changer transitions 0/400 dead transitions. [2022-11-20 10:31:05,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 400 transitions, 896 flow [2022-11-20 10:31:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1914 transitions. [2022-11-20 10:31:05,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-20 10:31:05,608 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1914 transitions. [2022-11-20 10:31:05,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1914 transitions. [2022-11-20 10:31:05,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:05,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1914 transitions. [2022-11-20 10:31:05,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,619 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 856 flow. Second operand 5 states and 1914 transitions. [2022-11-20 10:31:05,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 400 transitions, 896 flow [2022-11-20 10:31:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:31:05,630 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 874 flow [2022-11-20 10:31:05,631 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=874, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2022-11-20 10:31:05,631 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 5 predicate places. [2022-11-20 10:31:05,631 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 874 flow [2022-11-20 10:31:05,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 382.25) internal successors, (1529), 4 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:05,633 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:05,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:31:05,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1439043191, now seen corresponding path program 1 times [2022-11-20 10:31:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:05,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989497282] [2022-11-20 10:31:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989497282] [2022-11-20 10:31:05,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989497282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034256847] [2022-11-20 10:31:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:05,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:05,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:05,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:05,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:31:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:31:05,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:31:05,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:05,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034256847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:05,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:05,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:31:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232650957] [2022-11-20 10:31:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:05,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:05,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:05,885 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:05,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 874 flow. Second operand has 5 states, 5 states have (on average 381.8) internal successors, (1909), 5 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:05,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:05,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:05,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:06,209 INFO L130 PetriNetUnfolder]: 27/903 cut-off events. [2022-11-20 10:31:06,210 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-20 10:31:06,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 903 events. 27/903 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5219 event pairs, 1 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 925. Up to 23 conditions per place. [2022-11-20 10:31:06,237 INFO L137 encePairwiseOnDemand]: 460/464 looper letters, 15 selfloop transitions, 5 changer transitions 0/399 dead transitions. [2022-11-20 10:31:06,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 399 transitions, 910 flow [2022-11-20 10:31:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:31:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:31:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1533 transitions. [2022-11-20 10:31:06,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259698275862069 [2022-11-20 10:31:06,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1533 transitions. [2022-11-20 10:31:06,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1533 transitions. [2022-11-20 10:31:06,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:06,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1533 transitions. [2022-11-20 10:31:06,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 383.25) internal successors, (1533), 4 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:06,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:06,250 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:06,250 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 874 flow. Second operand 4 states and 1533 transitions. [2022-11-20 10:31:06,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 399 transitions, 910 flow [2022-11-20 10:31:06,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 399 transitions, 898 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:06,260 INFO L231 Difference]: Finished difference. Result has 400 places, 399 transitions, 868 flow [2022-11-20 10:31:06,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=868, PETRI_PLACES=400, PETRI_TRANSITIONS=399} [2022-11-20 10:31:06,261 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 4 predicate places. [2022-11-20 10:31:06,261 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 399 transitions, 868 flow [2022-11-20 10:31:06,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 381.8) internal successors, (1909), 5 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:06,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:06,263 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] [2022-11-20 10:31:06,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-20 10:31:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:06,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1930893337, now seen corresponding path program 1 times [2022-11-20 10:31:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:06,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563163363] [2022-11-20 10:31:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,549 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-20 10:31:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563163363] [2022-11-20 10:31:06,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563163363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:06,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030347470] [2022-11-20 10:31:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:06,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:06,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:06,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:31:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:31:06,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:06,714 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-20 10:31:06,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:06,751 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-20 10:31:06,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030347470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:06,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:06,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:31:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910863063] [2022-11-20 10:31:06,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:31:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:31:06,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:31:06,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:06,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 399 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 381.7) internal successors, (3817), 10 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:06,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:06,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:06,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:07,095 INFO L130 PetriNetUnfolder]: 27/911 cut-off events. [2022-11-20 10:31:07,095 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-20 10:31:07,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 911 events. 27/911 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5208 event pairs, 1 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2022-11-20 10:31:07,110 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 22 selfloop transitions, 9 changer transitions 0/410 dead transitions. [2022-11-20 10:31:07,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 410 transitions, 968 flow [2022-11-20 10:31:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:31:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:31:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3444 transitions. [2022-11-20 10:31:07,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8247126436781609 [2022-11-20 10:31:07,117 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3444 transitions. [2022-11-20 10:31:07,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3444 transitions. [2022-11-20 10:31:07,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:07,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3444 transitions. [2022-11-20 10:31:07,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 382.6666666666667) internal successors, (3444), 9 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 464.0) internal successors, (4640), 10 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,135 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 464.0) internal successors, (4640), 10 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,135 INFO L175 Difference]: Start difference. First operand has 400 places, 399 transitions, 868 flow. Second operand 9 states and 3444 transitions. [2022-11-20 10:31:07,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 410 transitions, 968 flow [2022-11-20 10:31:07,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 954 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:07,145 INFO L231 Difference]: Finished difference. Result has 409 places, 403 transitions, 914 flow [2022-11-20 10:31:07,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=409, PETRI_TRANSITIONS=403} [2022-11-20 10:31:07,146 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 13 predicate places. [2022-11-20 10:31:07,146 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 403 transitions, 914 flow [2022-11-20 10:31:07,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 381.7) internal successors, (3817), 10 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:07,148 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:07,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 10:31:07,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1058192857, now seen corresponding path program 2 times [2022-11-20 10:31:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:07,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161889063] [2022-11-20 10:31:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:31:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:07,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161889063] [2022-11-20 10:31:07,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161889063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:07,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:07,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772261144] [2022-11-20 10:31:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:07,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:07,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:07,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:07,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:07,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 403 transitions, 914 flow. Second operand has 4 states, 4 states have (on average 380.75) internal successors, (1523), 4 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:07,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:07,771 INFO L130 PetriNetUnfolder]: 23/792 cut-off events. [2022-11-20 10:31:07,771 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-20 10:31:07,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 792 events. 23/792 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4329 event pairs, 1 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 828. Up to 40 conditions per place. [2022-11-20 10:31:07,793 INFO L137 encePairwiseOnDemand]: 457/464 looper letters, 21 selfloop transitions, 4 changer transitions 0/410 dead transitions. [2022-11-20 10:31:07,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 410 transitions, 978 flow [2022-11-20 10:31:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1923 transitions. [2022-11-20 10:31:07,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8288793103448275 [2022-11-20 10:31:07,798 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1923 transitions. [2022-11-20 10:31:07,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1923 transitions. [2022-11-20 10:31:07,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:07,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1923 transitions. [2022-11-20 10:31:07,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 384.6) internal successors, (1923), 5 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,808 INFO L175 Difference]: Start difference. First operand has 409 places, 403 transitions, 914 flow. Second operand 5 states and 1923 transitions. [2022-11-20 10:31:07,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 410 transitions, 978 flow [2022-11-20 10:31:07,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 410 transitions, 962 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:31:07,818 INFO L231 Difference]: Finished difference. Result has 412 places, 406 transitions, 930 flow [2022-11-20 10:31:07,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=412, PETRI_TRANSITIONS=406} [2022-11-20 10:31:07,819 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 16 predicate places. [2022-11-20 10:31:07,819 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 406 transitions, 930 flow [2022-11-20 10:31:07,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 380.75) internal successors, (1523), 4 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,820 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:07,820 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:07,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:31:07,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash -111328103, now seen corresponding path program 1 times [2022-11-20 10:31:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:07,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980964357] [2022-11-20 10:31:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 10:31:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:07,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980964357] [2022-11-20 10:31:07,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980964357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:07,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:07,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:31:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287687361] [2022-11-20 10:31:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:07,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:31:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:31:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:31:07,882 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:07,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 406 transitions, 930 flow. Second operand has 4 states, 4 states have (on average 382.75) internal successors, (1531), 4 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:07,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:07,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:07,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:08,184 INFO L130 PetriNetUnfolder]: 23/790 cut-off events. [2022-11-20 10:31:08,184 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-20 10:31:08,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 790 events. 23/790 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4318 event pairs, 1 based on Foata normal form. 2/698 useless extension candidates. Maximal degree in co-relation 838. Up to 20 conditions per place. [2022-11-20 10:31:08,207 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 13 selfloop transitions, 8 changer transitions 0/406 dead transitions. [2022-11-20 10:31:08,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 406 transitions, 970 flow [2022-11-20 10:31:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:31:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:31:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1914 transitions. [2022-11-20 10:31:08,211 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-20 10:31:08,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1914 transitions. [2022-11-20 10:31:08,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1914 transitions. [2022-11-20 10:31:08,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:08,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1914 transitions. [2022-11-20 10:31:08,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 382.8) internal successors, (1914), 5 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:08,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:08,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 464.0) internal successors, (2784), 6 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:08,220 INFO L175 Difference]: Start difference. First operand has 412 places, 406 transitions, 930 flow. Second operand 5 states and 1914 transitions. [2022-11-20 10:31:08,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 406 transitions, 970 flow [2022-11-20 10:31:08,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 406 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:31:08,231 INFO L231 Difference]: Finished difference. Result has 415 places, 406 transitions, 948 flow [2022-11-20 10:31:08,232 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=415, PETRI_TRANSITIONS=406} [2022-11-20 10:31:08,233 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 19 predicate places. [2022-11-20 10:31:08,233 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 406 transitions, 948 flow [2022-11-20 10:31:08,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 382.75) internal successors, (1531), 4 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:08,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:08,234 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:31:08,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash 843797510, now seen corresponding path program 1 times [2022-11-20 10:31:08,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:08,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568231467] [2022-11-20 10:31:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:31:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:08,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568231467] [2022-11-20 10:31:08,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568231467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:08,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981782217] [2022-11-20 10:31:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:08,438 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:08,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:31:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:31:08,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:31:08,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:31:08,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981782217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:08,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:08,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 10:31:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007213058] [2022-11-20 10:31:08,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:08,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:31:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:31:08,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:31:08,752 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:08,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 406 transitions, 948 flow. Second operand has 18 states, 18 states have (on average 382.1111111111111) internal successors, (6878), 18 states have internal predecessors, (6878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:08,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:08,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:08,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:09,263 INFO L130 PetriNetUnfolder]: 23/818 cut-off events. [2022-11-20 10:31:09,263 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-20 10:31:09,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 818 events. 23/818 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4308 event pairs, 1 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 828. Up to 20 conditions per place. [2022-11-20 10:31:09,278 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 38 selfloop transitions, 21 changer transitions 0/441 dead transitions. [2022-11-20 10:31:09,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 441 transitions, 1220 flow [2022-11-20 10:31:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:31:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:31:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8022 transitions. [2022-11-20 10:31:09,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8232758620689655 [2022-11-20 10:31:09,289 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 8022 transitions. [2022-11-20 10:31:09,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 8022 transitions. [2022-11-20 10:31:09,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:09,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 8022 transitions. [2022-11-20 10:31:09,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 382.0) internal successors, (8022), 21 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 464.0) internal successors, (10208), 22 states have internal predecessors, (10208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,318 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 464.0) internal successors, (10208), 22 states have internal predecessors, (10208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,318 INFO L175 Difference]: Start difference. First operand has 415 places, 406 transitions, 948 flow. Second operand 21 states and 8022 transitions. [2022-11-20 10:31:09,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 441 transitions, 1220 flow [2022-11-20 10:31:09,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 441 transitions, 1208 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:31:09,329 INFO L231 Difference]: Finished difference. Result has 437 places, 419 transitions, 1092 flow [2022-11-20 10:31:09,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1092, PETRI_PLACES=437, PETRI_TRANSITIONS=419} [2022-11-20 10:31:09,331 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 41 predicate places. [2022-11-20 10:31:09,331 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 419 transitions, 1092 flow [2022-11-20 10:31:09,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 382.1111111111111) internal successors, (6878), 18 states have internal predecessors, (6878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:09,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:09,333 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:09,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:09,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 10:31:09,540 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash -619266170, now seen corresponding path program 2 times [2022-11-20 10:31:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:09,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452332353] [2022-11-20 10:31:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:31:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452332353] [2022-11-20 10:31:09,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452332353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865320319] [2022-11-20 10:31:09,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:09,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:09,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:09,837 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:09,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:31:09,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:09,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:09,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:31:09,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:31:10,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:31:10,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865320319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:10,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:10,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 10:31:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198735704] [2022-11-20 10:31:10,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:10,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:31:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:10,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:31:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:31:10,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:10,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 419 transitions, 1092 flow. Second operand has 23 states, 23 states have (on average 382.3478260869565) internal successors, (8794), 23 states have internal predecessors, (8794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:10,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:10,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:10,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:10,987 INFO L130 PetriNetUnfolder]: 23/839 cut-off events. [2022-11-20 10:31:10,988 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-20 10:31:11,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 839 events. 23/839 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4319 event pairs, 1 based on Foata normal form. 3/748 useless extension candidates. Maximal degree in co-relation 828. Up to 20 conditions per place. [2022-11-20 10:31:11,014 INFO L137 encePairwiseOnDemand]: 458/464 looper letters, 50 selfloop transitions, 30 changer transitions 0/462 dead transitions. [2022-11-20 10:31:11,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 462 transitions, 1462 flow [2022-11-20 10:31:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:31:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 10:31:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11453 transitions. [2022-11-20 10:31:11,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227729885057471 [2022-11-20 10:31:11,027 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 11453 transitions. [2022-11-20 10:31:11,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 11453 transitions. [2022-11-20 10:31:11,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:11,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 11453 transitions. [2022-11-20 10:31:11,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 381.76666666666665) internal successors, (11453), 30 states have internal predecessors, (11453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 464.0) internal successors, (14384), 31 states have internal predecessors, (14384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,064 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 464.0) internal successors, (14384), 31 states have internal predecessors, (14384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,065 INFO L175 Difference]: Start difference. First operand has 437 places, 419 transitions, 1092 flow. Second operand 30 states and 11453 transitions. [2022-11-20 10:31:11,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 462 transitions, 1462 flow [2022-11-20 10:31:11,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 462 transitions, 1382 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 10:31:11,077 INFO L231 Difference]: Finished difference. Result has 462 places, 429 transitions, 1190 flow [2022-11-20 10:31:11,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=462, PETRI_TRANSITIONS=429} [2022-11-20 10:31:11,079 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 66 predicate places. [2022-11-20 10:31:11,079 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 429 transitions, 1190 flow [2022-11-20 10:31:11,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 382.3478260869565) internal successors, (8794), 23 states have internal predecessors, (8794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,082 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:11,082 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:11,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:11,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 10:31:11,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1386839720, now seen corresponding path program 3 times [2022-11-20 10:31:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:11,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614001072] [2022-11-20 10:31:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:31:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614001072] [2022-11-20 10:31:11,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614001072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:11,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150273850] [2022-11-20 10:31:11,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:31:11,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:11,423 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:11,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:31:11,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:31:11,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:11,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:31:11,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:31:11,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:31:11,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150273850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:11,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:31:11,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:31:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411501605] [2022-11-20 10:31:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:11,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:31:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:31:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:11,616 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 464 [2022-11-20 10:31:11,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 429 transitions, 1190 flow. Second operand has 5 states, 5 states have (on average 382.2) internal successors, (1911), 5 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:11,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 464 [2022-11-20 10:31:11,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:31:11,949 INFO L130 PetriNetUnfolder]: 23/837 cut-off events. [2022-11-20 10:31:11,949 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-20 10:31:11,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 837 events. 23/837 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4297 event pairs, 1 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 846. Up to 30 conditions per place. [2022-11-20 10:31:11,970 INFO L137 encePairwiseOnDemand]: 460/464 looper letters, 15 selfloop transitions, 5 changer transitions 0/428 dead transitions. [2022-11-20 10:31:11,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 428 transitions, 1226 flow [2022-11-20 10:31:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:31:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:31:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1533 transitions. [2022-11-20 10:31:11,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8259698275862069 [2022-11-20 10:31:11,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1533 transitions. [2022-11-20 10:31:11,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1533 transitions. [2022-11-20 10:31:11,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:31:11,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1533 transitions. [2022-11-20 10:31:11,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 383.25) internal successors, (1533), 4 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,979 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,979 INFO L175 Difference]: Start difference. First operand has 462 places, 429 transitions, 1190 flow. Second operand 4 states and 1533 transitions. [2022-11-20 10:31:11,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 428 transitions, 1226 flow [2022-11-20 10:31:11,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 428 transitions, 1180 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-20 10:31:11,989 INFO L231 Difference]: Finished difference. Result has 446 places, 428 transitions, 1150 flow [2022-11-20 10:31:11,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=464, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1150, PETRI_PLACES=446, PETRI_TRANSITIONS=428} [2022-11-20 10:31:11,990 INFO L288 CegarLoopForPetriNet]: 396 programPoint places, 50 predicate places. [2022-11-20 10:31:11,990 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 428 transitions, 1150 flow [2022-11-20 10:31:11,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 382.2) internal successors, (1911), 5 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:11,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:31:11,991 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:31:12,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:12,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03a961ec-9376-418d-9c9e-cbffd5171875/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 10:31:12,197 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2022-11-20 10:31:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1525818324, now seen corresponding path program 1 times [2022-11-20 10:31:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:12,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078888116] [2022-11-20 10:31:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:31:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078888116] [2022-11-20 10:31:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078888116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:13,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:31:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075598467] [2022-11-20 10:31:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:13,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:31:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:31:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:31:13,025 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 464 [2022-11-20 10:31:13,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 428 transitions, 1150 flow. Second operand has 13 states, 13 states have (on average 299.15384615384613) internal successors, (3889), 13 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:31:13,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:31:13,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 464 [2022-11-20 10:31:13,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand