./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e04fb08f 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_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8 --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 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --- 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-e04fb08 [2022-11-16 11:02:49,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:02:49,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:02:49,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:02:49,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:02:49,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:02:49,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:02:49,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:02:49,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:02:49,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:02:49,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:02:49,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:02:49,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:02:49,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:02:49,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:02:49,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:02:49,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:02:49,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:02:49,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:02:49,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:02:49,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:02:49,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:02:49,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:02:49,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:02:49,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:02:49,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:02:49,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:02:49,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:02:49,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:02:49,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:02:49,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:02:49,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:02:49,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:02:49,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:02:49,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:02:49,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:02:49,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:02:49,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:02:49,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:02:49,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:02:49,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:02:49,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-16 11:02:49,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:02:49,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:02:49,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:02:49,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:02:49,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:02:49,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:02:49,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:02:49,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:02:49,290 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:02:49,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:02:49,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:02:49,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:02:49,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:02:49,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:02:49,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:02:49,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:02:49,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:02:49,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:02:49,293 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-16 11:02:49,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:02:49,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:02:49,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:02:49,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:02:49,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:02:49,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:02:49,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:02:49,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:02:49,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:02:49,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:02:49,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:02:49,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:02:49,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:02:49,298 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:02:49,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:02:49,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:02:49,298 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_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/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_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8 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 -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc [2022-11-16 11:02:49,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:02:49,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:02:49,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:02:49,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:02:49,686 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:02:49,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-16 11:02:49,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/data/b54700fcd/5072fe54c7bb417085d00cb093002422/FLAGc63d2e178 [2022-11-16 11:02:50,496 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:02:50,497 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-16 11:02:50,519 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/data/b54700fcd/5072fe54c7bb417085d00cb093002422/FLAGc63d2e178 [2022-11-16 11:02:50,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/data/b54700fcd/5072fe54c7bb417085d00cb093002422 [2022-11-16 11:02:50,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:02:50,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:02:50,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:02:50,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:02:50,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:02:50,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:02:50" (1/1) ... [2022-11-16 11:02:50,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232696e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:50, skipping insertion in model container [2022-11-16 11:02:50,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:02:50" (1/1) ... [2022-11-16 11:02:50,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:02:50,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:02:51,385 WARN L229 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_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-16 11:02:51,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:02:51,421 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:02:51,459 WARN L229 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_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-16 11:02:51,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:02:51,530 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:02:51,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51 WrapperNode [2022-11-16 11:02:51,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:02:51,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:02:51,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:02:51,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:02:51,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,603 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 217 [2022-11-16 11:02:51,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:02:51,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:02:51,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:02:51,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:02:51,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,650 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:02:51,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:02:51,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:02:51,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:02:51,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (1/1) ... [2022-11-16 11:02:51,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:02:51,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:02:51,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:02:51,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:02:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:02:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:02:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:02:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:02:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 11:02:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:02:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-16 11:02:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-16 11:02:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:02:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:02:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:02:51,760 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:02:52,004 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:02:52,007 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:02:52,548 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:02:52,557 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:02:52,558 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-16 11:02:52,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:02:52 BoogieIcfgContainer [2022-11-16 11:02:52,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:02:52,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:02:52,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:02:52,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:02:52,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:02:50" (1/3) ... [2022-11-16 11:02:52,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@894620b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:02:52, skipping insertion in model container [2022-11-16 11:02:52,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:51" (2/3) ... [2022-11-16 11:02:52,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@894620b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:02:52, skipping insertion in model container [2022-11-16 11:02:52,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:02:52" (3/3) ... [2022-11-16 11:02:52,577 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2022-11-16 11:02:52,587 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:02:52,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:02:52,599 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-16 11:02:52,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:02:52,692 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 11:02:52,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 236 transitions, 480 flow [2022-11-16 11:02:52,917 INFO L130 PetriNetUnfolder]: 43/315 cut-off events. [2022-11-16 11:02:52,919 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:02:52,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 315 events. 43/315 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1027 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2022-11-16 11:02:52,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 236 transitions, 480 flow [2022-11-16 11:02:52,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 470 flow [2022-11-16 11:02:52,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:02:52,979 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;@4023adad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:02:52,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-16 11:02:52,996 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-16 11:02:52,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:02:52,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:52,997 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:52,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:02:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1528895984, now seen corresponding path program 1 times [2022-11-16 11:02:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:53,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739445351] [2022-11-16 11:02:53,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:53,703 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-16 11:02:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:53,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739445351] [2022-11-16 11:02:53,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739445351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:53,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:53,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:02:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545764607] [2022-11-16 11:02:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:53,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:02:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:02:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:02:53,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-16 11:02:53,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 231 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:53,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:53,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-16 11:02:53,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:54,052 INFO L130 PetriNetUnfolder]: 6/473 cut-off events. [2022-11-16 11:02:54,052 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-16 11:02:54,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 473 events. 6/473 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2316 event pairs, 0 based on Foata normal form. 74/493 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2022-11-16 11:02:54,064 INFO L137 encePairwiseOnDemand]: 203/236 looper letters, 11 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2022-11-16 11:02:54,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 464 flow [2022-11-16 11:02:54,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:02:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:02:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1596 transitions. [2022-11-16 11:02:54,099 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8453389830508474 [2022-11-16 11:02:54,100 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1596 transitions. [2022-11-16 11:02:54,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1596 transitions. [2022-11-16 11:02:54,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:54,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1596 transitions. [2022-11-16 11:02:54,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.5) internal successors, (1596), 8 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,182 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,185 INFO L175 Difference]: Start difference. First operand has 207 places, 231 transitions, 470 flow. Second operand 8 states and 1596 transitions. [2022-11-16 11:02:54,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 464 flow [2022-11-16 11:02:54,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:02:54,204 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 432 flow [2022-11-16 11:02:54,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=204} [2022-11-16 11:02:54,212 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 4 predicate places. [2022-11-16 11:02:54,213 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 432 flow [2022-11-16 11:02:54,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,214 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:54,215 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:54,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:02:54,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:02:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1528885954, now seen corresponding path program 1 times [2022-11-16 11:02:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:54,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971895030] [2022-11-16 11:02:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:54,368 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-16 11:02:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971895030] [2022-11-16 11:02:54,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971895030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:54,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:54,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:02:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640463974] [2022-11-16 11:02:54,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:54,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:02:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:02:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:02:54,374 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-16 11:02:54,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:54,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-16 11:02:54,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:54,488 INFO L130 PetriNetUnfolder]: 6/472 cut-off events. [2022-11-16 11:02:54,488 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-16 11:02:54,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 472 events. 6/472 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2312 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 223. Up to 12 conditions per place. [2022-11-16 11:02:54,492 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 11 selfloop transitions, 4 changer transitions 0/203 dead transitions. [2022-11-16 11:02:54,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 460 flow [2022-11-16 11:02:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:02:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:02:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 981 transitions. [2022-11-16 11:02:54,496 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313559322033899 [2022-11-16 11:02:54,496 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 981 transitions. [2022-11-16 11:02:54,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 981 transitions. [2022-11-16 11:02:54,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:54,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 981 transitions. [2022-11-16 11:02:54,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.2) internal successors, (981), 5 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,504 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,504 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 432 flow. Second operand 5 states and 981 transitions. [2022-11-16 11:02:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 460 flow [2022-11-16 11:02:54,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 444 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:02:54,509 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 422 flow [2022-11-16 11:02:54,510 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-16 11:02:54,511 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-16 11:02:54,511 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 422 flow [2022-11-16 11:02:54,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,512 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:54,512 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:54,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:02:54,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:02:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 151135674, now seen corresponding path program 1 times [2022-11-16 11:02:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:54,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721079657] [2022-11-16 11:02:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:54,615 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-16 11:02:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:54,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721079657] [2022-11-16 11:02:54,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721079657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:54,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:54,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:02:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927327866] [2022-11-16 11:02:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:54,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:02:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:02:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:02:54,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-16 11:02:54,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:54,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-16 11:02:54,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:54,808 INFO L130 PetriNetUnfolder]: 6/471 cut-off events. [2022-11-16 11:02:54,809 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-16 11:02:54,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 471 events. 6/471 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2308 event pairs, 0 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 276. Up to 8 conditions per place. [2022-11-16 11:02:54,814 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 12 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2022-11-16 11:02:54,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 466 flow [2022-11-16 11:02:54,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:02:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:02:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2022-11-16 11:02:54,820 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227401129943502 [2022-11-16 11:02:54,820 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2022-11-16 11:02:54,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2022-11-16 11:02:54,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:54,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2022-11-16 11:02:54,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,833 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,833 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 422 flow. Second operand 6 states and 1165 transitions. [2022-11-16 11:02:54,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 466 flow [2022-11-16 11:02:54,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 458 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:02:54,839 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 424 flow [2022-11-16 11:02:54,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2022-11-16 11:02:54,843 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-16 11:02:54,843 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 424 flow [2022-11-16 11:02:54,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:54,845 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:54,845 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:54,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:02:54,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:02:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash 150824823, now seen corresponding path program 1 times [2022-11-16 11:02:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:54,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791008945] [2022-11-16 11:02:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:54,992 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-16 11:02:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:54,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791008945] [2022-11-16 11:02:54,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791008945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:54,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:54,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:02:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909245946] [2022-11-16 11:02:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:55,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:02:55,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:02:55,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:02:55,004 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-16 11:02:55,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:55,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-16 11:02:55,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:55,136 INFO L130 PetriNetUnfolder]: 6/470 cut-off events. [2022-11-16 11:02:55,136 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:02:55,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 470 events. 6/470 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2313 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 218. Up to 9 conditions per place. [2022-11-16 11:02:55,141 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 13 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2022-11-16 11:02:55,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 464 flow [2022-11-16 11:02:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:02:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:02:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2022-11-16 11:02:55,145 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358050847457628 [2022-11-16 11:02:55,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2022-11-16 11:02:55,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2022-11-16 11:02:55,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:55,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2022-11-16 11:02:55,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,159 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,159 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 424 flow. Second operand 4 states and 789 transitions. [2022-11-16 11:02:55,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 464 flow [2022-11-16 11:02:55,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 203 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:02:55,166 INFO L231 Difference]: Finished difference. Result has 204 places, 201 transitions, 416 flow [2022-11-16 11:02:55,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=204, PETRI_TRANSITIONS=201} [2022-11-16 11:02:55,168 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-16 11:02:55,168 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 201 transitions, 416 flow [2022-11-16 11:02:55,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,175 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:55,175 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:55,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:02:55,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:02:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 165110258, now seen corresponding path program 1 times [2022-11-16 11:02:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206593637] [2022-11-16 11:02:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:55,364 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-16 11:02:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:55,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206593637] [2022-11-16 11:02:55,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206593637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:55,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:55,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:02:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126216331] [2022-11-16 11:02:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:55,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:02:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:02:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:02:55,370 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2022-11-16 11:02:55,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:55,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2022-11-16 11:02:55,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:55,479 INFO L130 PetriNetUnfolder]: 4/344 cut-off events. [2022-11-16 11:02:55,480 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:02:55,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 344 events. 4/344 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1271 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 214. Up to 12 conditions per place. [2022-11-16 11:02:55,484 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 10 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-16 11:02:55,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 444 flow [2022-11-16 11:02:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:02:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:02:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-11-16 11:02:55,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449152542372881 [2022-11-16 11:02:55,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2022-11-16 11:02:55,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2022-11-16 11:02:55,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:55,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2022-11-16 11:02:55,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.4) internal successors, (997), 5 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,496 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,496 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 416 flow. Second operand 5 states and 997 transitions. [2022-11-16 11:02:55,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 444 flow [2022-11-16 11:02:55,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:02:55,502 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 418 flow [2022-11-16 11:02:55,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2022-11-16 11:02:55,507 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-16 11:02:55,508 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 418 flow [2022-11-16 11:02:55,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:55,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:02:55,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:02:55,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2022-11-16 11:02:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -454347722, now seen corresponding path program 1 times [2022-11-16 11:02:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231622237] [2022-11-16 11:02:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:02:55,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:02:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:02:55,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:02:55,628 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:02:55,629 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-16 11:02:55,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-16 11:02:55,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-16 11:02:55,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-16 11:02:55,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-16 11:02:55,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-16 11:02:55,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-16 11:02:55,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-16 11:02:55,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-16 11:02:55,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-16 11:02:55,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-16 11:02:55,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-16 11:02:55,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-16 11:02:55,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-16 11:02:55,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-16 11:02:55,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-16 11:02:55,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-16 11:02:55,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-16 11:02:55,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-16 11:02:55,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-16 11:02:55,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-16 11:02:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:02:55,643 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 11:02:55,646 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:02:55,646 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:02:55,704 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:02:55,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 624 flow [2022-11-16 11:02:55,789 INFO L130 PetriNetUnfolder]: 72/498 cut-off events. [2022-11-16 11:02:55,789 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:02:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 498 events. 72/498 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1960 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 317. Up to 12 conditions per place. [2022-11-16 11:02:55,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 303 transitions, 624 flow [2022-11-16 11:02:55,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 301 transitions, 620 flow [2022-11-16 11:02:55,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:02:55,804 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;@4023adad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:02:55,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-16 11:02:55,810 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-16 11:02:55,810 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:02:55,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:55,810 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:55,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:02:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 119872176, now seen corresponding path program 1 times [2022-11-16 11:02:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476493412] [2022-11-16 11:02:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:55,914 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-16 11:02:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:55,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476493412] [2022-11-16 11:02:55,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476493412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:55,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:55,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:02:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767486606] [2022-11-16 11:02:55,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:55,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:02:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:02:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:02:55,919 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-16 11:02:55,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 301 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:55,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:55,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-16 11:02:55,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:56,171 INFO L130 PetriNetUnfolder]: 16/791 cut-off events. [2022-11-16 11:02:56,171 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-16 11:02:56,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 791 events. 16/791 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4618 event pairs, 0 based on Foata normal form. 176/869 useless extension candidates. Maximal degree in co-relation 502. Up to 12 conditions per place. [2022-11-16 11:02:56,184 INFO L137 encePairwiseOnDemand]: 259/303 looper letters, 15 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2022-11-16 11:02:56,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 610 flow [2022-11-16 11:02:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:02:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:02:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2046 transitions. [2022-11-16 11:02:56,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2022-11-16 11:02:56,190 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2046 transitions. [2022-11-16 11:02:56,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2046 transitions. [2022-11-16 11:02:56,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:56,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2046 transitions. [2022-11-16 11:02:56,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 255.75) internal successors, (2046), 8 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,236 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,236 INFO L175 Difference]: Start difference. First operand has 265 places, 301 transitions, 620 flow. Second operand 8 states and 2046 transitions. [2022-11-16 11:02:56,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 610 flow [2022-11-16 11:02:56,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:02:56,241 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 558 flow [2022-11-16 11:02:56,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2022-11-16 11:02:56,243 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 3 predicate places. [2022-11-16 11:02:56,243 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 558 flow [2022-11-16 11:02:56,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.33333333333334) internal successors, (1472), 6 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:56,244 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:56,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:02:56,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:02:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash 119862146, now seen corresponding path program 1 times [2022-11-16 11:02:56,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:56,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668379279] [2022-11-16 11:02:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:56,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:56,299 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-16 11:02:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668379279] [2022-11-16 11:02:56,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668379279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:56,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:56,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:02:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183709423] [2022-11-16 11:02:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:56,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:02:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:02:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:02:56,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-16 11:02:56,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:56,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-16 11:02:56,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:56,508 INFO L130 PetriNetUnfolder]: 16/790 cut-off events. [2022-11-16 11:02:56,509 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-16 11:02:56,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 790 events. 16/790 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4612 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 507. Up to 20 conditions per place. [2022-11-16 11:02:56,523 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 4 changer transitions 0/261 dead transitions. [2022-11-16 11:02:56,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 590 flow [2022-11-16 11:02:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:02:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:02:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2022-11-16 11:02:56,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237623762376237 [2022-11-16 11:02:56,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2022-11-16 11:02:56,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2022-11-16 11:02:56,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:56,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2022-11-16 11:02:56,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,536 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,537 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 558 flow. Second operand 5 states and 1248 transitions. [2022-11-16 11:02:56,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 590 flow [2022-11-16 11:02:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 261 transitions, 574 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:02:56,543 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 548 flow [2022-11-16 11:02:56,544 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2022-11-16 11:02:56,545 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-16 11:02:56,545 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 548 flow [2022-11-16 11:02:56,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,546 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:56,546 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:56,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:02:56,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:02:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash -578929111, now seen corresponding path program 1 times [2022-11-16 11:02:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:56,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866709880] [2022-11-16 11:02:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:56,623 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-16 11:02:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:56,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866709880] [2022-11-16 11:02:56,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866709880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:56,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:56,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:02:56,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564739092] [2022-11-16 11:02:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:56,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:02:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:56,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:02:56,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:02:56,628 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-16 11:02:56,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:56,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-16 11:02:56,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:56,846 INFO L130 PetriNetUnfolder]: 16/789 cut-off events. [2022-11-16 11:02:56,847 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-16 11:02:56,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 789 events. 16/789 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4617 event pairs, 0 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 503. Up to 12 conditions per place. [2022-11-16 11:02:56,859 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 16 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2022-11-16 11:02:56,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 612 flow [2022-11-16 11:02:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:02:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:02:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2022-11-16 11:02:56,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817931793179318 [2022-11-16 11:02:56,865 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2022-11-16 11:02:56,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2022-11-16 11:02:56,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:56,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2022-11-16 11:02:56,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,876 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,877 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 548 flow. Second operand 6 states and 1487 transitions. [2022-11-16 11:02:56,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 612 flow [2022-11-16 11:02:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:02:56,889 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 550 flow [2022-11-16 11:02:56,890 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2022-11-16 11:02:56,892 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-16 11:02:56,892 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 550 flow [2022-11-16 11:02:56,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:56,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:56,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:02:56,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:02:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -579239962, now seen corresponding path program 1 times [2022-11-16 11:02:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:56,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891487691] [2022-11-16 11:02:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:56,968 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-16 11:02:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:56,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891487691] [2022-11-16 11:02:56,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891487691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:56,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:56,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:02:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259913198] [2022-11-16 11:02:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:56,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:02:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:02:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:02:56,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-16 11:02:56,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:56,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:56,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-16 11:02:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:57,168 INFO L130 PetriNetUnfolder]: 16/788 cut-off events. [2022-11-16 11:02:57,169 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-16 11:02:57,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 788 events. 16/788 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4619 event pairs, 0 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 502. Up to 13 conditions per place. [2022-11-16 11:02:57,182 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 17 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2022-11-16 11:02:57,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 610 flow [2022-11-16 11:02:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:02:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:02:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1005 transitions. [2022-11-16 11:02:57,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8292079207920792 [2022-11-16 11:02:57,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1005 transitions. [2022-11-16 11:02:57,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1005 transitions. [2022-11-16 11:02:57,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:57,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1005 transitions. [2022-11-16 11:02:57,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.25) internal successors, (1005), 4 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,195 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,196 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 550 flow. Second operand 4 states and 1005 transitions. [2022-11-16 11:02:57,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 610 flow [2022-11-16 11:02:57,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:02:57,202 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 542 flow [2022-11-16 11:02:57,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=261, PETRI_TRANSITIONS=259} [2022-11-16 11:02:57,204 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -4 predicate places. [2022-11-16 11:02:57,204 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 542 flow [2022-11-16 11:02:57,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,205 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:57,205 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:57,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:02:57,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:02:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1173350771, now seen corresponding path program 1 times [2022-11-16 11:02:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:57,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091653918] [2022-11-16 11:02:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:57,298 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-16 11:02:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:57,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091653918] [2022-11-16 11:02:57,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091653918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:57,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:57,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:02:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653134599] [2022-11-16 11:02:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:57,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:02:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:02:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:02:57,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:02:57,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 259 transitions, 542 flow. Second operand has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:57,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:02:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:02:57,516 INFO L130 PetriNetUnfolder]: 12/680 cut-off events. [2022-11-16 11:02:57,516 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-16 11:02:57,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 680 events. 12/680 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3613 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 403. Up to 40 conditions per place. [2022-11-16 11:02:57,528 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 19 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-16 11:02:57,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2022-11-16 11:02:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:02:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:02:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1271 transitions. [2022-11-16 11:02:57,532 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.838943894389439 [2022-11-16 11:02:57,532 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1271 transitions. [2022-11-16 11:02:57,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1271 transitions. [2022-11-16 11:02:57,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:02:57,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1271 transitions. [2022-11-16 11:02:57,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.2) internal successors, (1271), 5 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,541 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 542 flow. Second operand 5 states and 1271 transitions. [2022-11-16 11:02:57,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2022-11-16 11:02:57,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 266 transitions, 596 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:02:57,546 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 568 flow [2022-11-16 11:02:57,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=265, PETRI_TRANSITIONS=262} [2022-11-16 11:02:57,549 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 0 predicate places. [2022-11-16 11:02:57,550 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 568 flow [2022-11-16 11:02:57,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 250.75) internal successors, (1003), 4 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,559 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:02:57,559 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:57,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:02:57,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:02:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1578948222, now seen corresponding path program 1 times [2022-11-16 11:02:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:57,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769941564] [2022-11-16 11:02:57,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:57,896 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-16 11:02:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:57,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769941564] [2022-11-16 11:02:57,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769941564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:02:57,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:02:57,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:02:57,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096215048] [2022-11-16 11:02:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:02:57,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:02:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:57,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:02:57,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:02:57,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 303 [2022-11-16 11:02:57,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 568 flow. Second operand has 9 states, 9 states have (on average 201.44444444444446) internal successors, (1813), 9 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:02:57,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:02:57,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 303 [2022-11-16 11:02:57,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:00,987 INFO L130 PetriNetUnfolder]: 4046/13313 cut-off events. [2022-11-16 11:03:00,987 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-11-16 11:03:01,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19774 conditions, 13313 events. 4046/13313 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 156544 event pairs, 830 based on Foata normal form. 0/12104 useless extension candidates. Maximal degree in co-relation 19643. Up to 2984 conditions per place. [2022-11-16 11:03:01,140 INFO L137 encePairwiseOnDemand]: 288/303 looper letters, 221 selfloop transitions, 32 changer transitions 0/447 dead transitions. [2022-11-16 11:03:01,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 447 transitions, 1490 flow [2022-11-16 11:03:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:03:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:03:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3413 transitions. [2022-11-16 11:03:01,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7040016501650165 [2022-11-16 11:03:01,152 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3413 transitions. [2022-11-16 11:03:01,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3413 transitions. [2022-11-16 11:03:01,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:01,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3413 transitions. [2022-11-16 11:03:01,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 213.3125) internal successors, (3413), 16 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 303.0) internal successors, (5151), 17 states have internal predecessors, (5151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,176 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 303.0) internal successors, (5151), 17 states have internal predecessors, (5151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,177 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 568 flow. Second operand 16 states and 3413 transitions. [2022-11-16 11:03:01,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 447 transitions, 1490 flow [2022-11-16 11:03:01,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 447 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:03:01,190 INFO L231 Difference]: Finished difference. Result has 289 places, 293 transitions, 803 flow [2022-11-16 11:03:01,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=803, PETRI_PLACES=289, PETRI_TRANSITIONS=293} [2022-11-16 11:03:01,192 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 24 predicate places. [2022-11-16 11:03:01,192 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 293 transitions, 803 flow [2022-11-16 11:03:01,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 201.44444444444446) internal successors, (1813), 9 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:01,194 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:03:01,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:03:01,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:03:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 412042784, now seen corresponding path program 1 times [2022-11-16 11:03:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:01,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46019788] [2022-11-16 11:03:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:03:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46019788] [2022-11-16 11:03:01,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46019788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:01,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:01,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:03:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403937050] [2022-11-16 11:03:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:01,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:01,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:03:01,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 293 transitions, 803 flow. Second operand has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:01,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:03:01,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:01,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 358#true, Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-16 11:03:01,600 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:03:01,600 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:03:01,601 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:01,601 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:01,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 358#true, Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-16 11:03:01,665 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:03:01,665 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:01,665 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:01,665 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:01,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][272], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 358#true, Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-16 11:03:01,705 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 11:03:01,706 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:01,706 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:01,706 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:01,718 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][230], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 358#true, Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-16 11:03:01,718 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:01,718 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:01,718 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:01,719 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:01,719 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:01,720 INFO L130 PetriNetUnfolder]: 132/1589 cut-off events. [2022-11-16 11:03:01,720 INFO L131 PetriNetUnfolder]: For 756/978 co-relation queries the response was YES. [2022-11-16 11:03:01,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1589 events. 132/1589 cut-off events. For 756/978 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12095 event pairs, 31 based on Foata normal form. 21/1443 useless extension candidates. Maximal degree in co-relation 2175. Up to 139 conditions per place. [2022-11-16 11:03:01,743 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 11 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2022-11-16 11:03:01,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 293 transitions, 839 flow [2022-11-16 11:03:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:03:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:03:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1262 transitions. [2022-11-16 11:03:01,747 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.833003300330033 [2022-11-16 11:03:01,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1262 transitions. [2022-11-16 11:03:01,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1262 transitions. [2022-11-16 11:03:01,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:01,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1262 transitions. [2022-11-16 11:03:01,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,755 INFO L175 Difference]: Start difference. First operand has 289 places, 293 transitions, 803 flow. Second operand 5 states and 1262 transitions. [2022-11-16 11:03:01,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 293 transitions, 839 flow [2022-11-16 11:03:01,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:03:01,768 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 822 flow [2022-11-16 11:03:01,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=292, PETRI_TRANSITIONS=293} [2022-11-16 11:03:01,769 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 27 predicate places. [2022-11-16 11:03:01,769 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 822 flow [2022-11-16 11:03:01,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:01,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:01,770 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:03:01,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:03:01,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:03:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -111574750, now seen corresponding path program 1 times [2022-11-16 11:03:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:01,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574981576] [2022-11-16 11:03:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:01,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574981576] [2022-11-16 11:03:01,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574981576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:03:01,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742634771] [2022-11-16 11:03:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:01,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:03:01,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:03:01,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:03:01,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:03:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:02,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:02,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:02,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:02,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742634771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:02,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:03:02,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:03:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503400689] [2022-11-16 11:03:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:02,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:03:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:03:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:03:02,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:03:02,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 293 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:02,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:02,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:03:02,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:02,499 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 358#true]) [2022-11-16 11:03:02,499 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:03:02,499 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:03:02,499 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:02,499 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:02,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 16#t_funENTRYtrue, t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0InUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 358#true]) [2022-11-16 11:03:02,562 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:03:02,562 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:02,562 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:02,562 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:02,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1022] t_funEXIT-->L1040-5: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][271], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), 358#true]) [2022-11-16 11:03:02,604 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 11:03:02,604 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:02,604 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:02,604 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:02,615 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1021] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#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~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_7|} AuxVars[] AssignedVars[][229], [Black: 320#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 328#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 344#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 340#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|)), 319#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 330#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 342#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), t_funThread1of2ForFork0NotInUse, 584#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), t_funThread2of2ForFork0NotInUse, 171#L1040-5true, Black: 308#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 309#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 311#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 326#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 338#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0)), Black: 334#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), 358#true, Black: 332#(and (= |t_funThread1of2ForFork0_#t~post7#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of2ForFork0_#t~mem6#1| 0))]) [2022-11-16 11:03:02,616 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:02,616 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:02,616 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:02,616 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:02,616 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:02,617 INFO L130 PetriNetUnfolder]: 132/1588 cut-off events. [2022-11-16 11:03:02,617 INFO L131 PetriNetUnfolder]: For 763/975 co-relation queries the response was YES. [2022-11-16 11:03:02,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 1588 events. 132/1588 cut-off events. For 763/975 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12198 event pairs, 31 based on Foata normal form. 9/1430 useless extension candidates. Maximal degree in co-relation 2185. Up to 139 conditions per place. [2022-11-16 11:03:02,640 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 13 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2022-11-16 11:03:02,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 854 flow [2022-11-16 11:03:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:03:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:03:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1011 transitions. [2022-11-16 11:03:02,644 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2022-11-16 11:03:02,644 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1011 transitions. [2022-11-16 11:03:02,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1011 transitions. [2022-11-16 11:03:02,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:02,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1011 transitions. [2022-11-16 11:03:02,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:02,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:02,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:02,651 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 822 flow. Second operand 4 states and 1011 transitions. [2022-11-16 11:03:02,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 854 flow [2022-11-16 11:03:02,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 842 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:03:02,662 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 816 flow [2022-11-16 11:03:02,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=816, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-11-16 11:03:02,664 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 26 predicate places. [2022-11-16 11:03:02,665 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 816 flow [2022-11-16 11:03:02,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 252.2) internal successors, (1261), 5 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:02,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:02,666 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:02,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:02,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:03:02,871 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:03:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1577907406, now seen corresponding path program 1 times [2022-11-16 11:03:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:02,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512822263] [2022-11-16 11:03:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:02,999 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-16 11:03:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:03,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512822263] [2022-11-16 11:03:03,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512822263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:03:03,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612681624] [2022-11-16 11:03:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:03,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:03:03,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:03:03,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:03:03,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:03:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:03,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:03,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:03,250 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-16 11:03:03,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:03:03,314 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-16 11:03:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612681624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:03:03,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:03:03,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:03:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71169674] [2022-11-16 11:03:03,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:03:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:03:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:03:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:03:03,320 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-16 11:03:03,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 816 flow. Second operand has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:03,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:03,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-16 11:03:03,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:03,453 INFO L130 PetriNetUnfolder]: 3/307 cut-off events. [2022-11-16 11:03:03,453 INFO L131 PetriNetUnfolder]: For 66/70 co-relation queries the response was YES. [2022-11-16 11:03:03,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 307 events. 3/307 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 806 event pairs, 0 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 378. Up to 8 conditions per place. [2022-11-16 11:03:03,456 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2022-11-16 11:03:03,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 204 transitions, 588 flow [2022-11-16 11:03:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:03:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:03:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2263 transitions. [2022-11-16 11:03:03,462 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8298496516318299 [2022-11-16 11:03:03,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2263 transitions. [2022-11-16 11:03:03,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2263 transitions. [2022-11-16 11:03:03,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:03,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2263 transitions. [2022-11-16 11:03:03,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 251.44444444444446) internal successors, (2263), 9 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:03,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:03,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 303.0) internal successors, (3030), 10 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:03,476 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 816 flow. Second operand 9 states and 2263 transitions. [2022-11-16 11:03:03,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 204 transitions, 588 flow [2022-11-16 11:03:03,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 548 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-16 11:03:03,482 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 510 flow [2022-11-16 11:03:03,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2022-11-16 11:03:03,483 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -49 predicate places. [2022-11-16 11:03:03,483 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 510 flow [2022-11-16 11:03:03,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 251.9) internal successors, (2519), 10 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:03,484 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:03,485 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:03,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:03,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:03:03,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:03:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash 986756205, now seen corresponding path program 1 times [2022-11-16 11:03:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:03,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386253577] [2022-11-16 11:03:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:03,929 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-16 11:03:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:03,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386253577] [2022-11-16 11:03:03,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386253577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:03,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:03,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:03:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335940569] [2022-11-16 11:03:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:03,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:03:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:03:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:03:03,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 303 [2022-11-16 11:03:03,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:03,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:03,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 303 [2022-11-16 11:03:03,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:04,966 INFO L130 PetriNetUnfolder]: 1007/3723 cut-off events. [2022-11-16 11:03:04,966 INFO L131 PetriNetUnfolder]: For 705/730 co-relation queries the response was YES. [2022-11-16 11:03:04,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6298 conditions, 3723 events. 1007/3723 cut-off events. For 705/730 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 35230 event pairs, 355 based on Foata normal form. 23/3379 useless extension candidates. Maximal degree in co-relation 3011. Up to 776 conditions per place. [2022-11-16 11:03:05,004 INFO L137 encePairwiseOnDemand]: 289/303 looper letters, 132 selfloop transitions, 32 changer transitions 0/299 dead transitions. [2022-11-16 11:03:05,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 299 transitions, 1146 flow [2022-11-16 11:03:05,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:03:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:03:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2367 transitions. [2022-11-16 11:03:05,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7101710171017102 [2022-11-16 11:03:05,016 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2367 transitions. [2022-11-16 11:03:05,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2367 transitions. [2022-11-16 11:03:05,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:05,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2367 transitions. [2022-11-16 11:03:05,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 215.1818181818182) internal successors, (2367), 11 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,038 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 303.0) internal successors, (3636), 12 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,038 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 510 flow. Second operand 11 states and 2367 transitions. [2022-11-16 11:03:05,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 299 transitions, 1146 flow [2022-11-16 11:03:05,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 299 transitions, 1123 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-11-16 11:03:05,051 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 730 flow [2022-11-16 11:03:05,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=730, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2022-11-16 11:03:05,053 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -40 predicate places. [2022-11-16 11:03:05,053 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 730 flow [2022-11-16 11:03:05,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:05,055 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 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-16 11:03:05,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:03:05,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-16 11:03:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1978150363, now seen corresponding path program 1 times [2022-11-16 11:03:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:05,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235198109] [2022-11-16 11:03:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:03:05,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:03:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:03:05,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:03:05,149 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:03:05,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-16 11:03:05,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-16 11:03:05,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-16 11:03:05,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-16 11:03:05,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-16 11:03:05,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-16 11:03:05,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-16 11:03:05,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-16 11:03:05,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-16 11:03:05,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-16 11:03:05,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-16 11:03:05,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-16 11:03:05,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-16 11:03:05,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-16 11:03:05,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-16 11:03:05,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-16 11:03:05,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-16 11:03:05,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-16 11:03:05,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-16 11:03:05,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-16 11:03:05,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-16 11:03:05,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-16 11:03:05,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-16 11:03:05,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-16 11:03:05,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-16 11:03:05,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:03:05,160 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:05,161 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:03:05,161 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:03:05,222 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:03:05,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 370 transitions, 770 flow [2022-11-16 11:03:05,414 INFO L130 PetriNetUnfolder]: 106/722 cut-off events. [2022-11-16 11:03:05,415 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 11:03:05,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 722 events. 106/722 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3161 event pairs, 1 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 506. Up to 16 conditions per place. [2022-11-16 11:03:05,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 370 transitions, 770 flow [2022-11-16 11:03:05,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 368 transitions, 766 flow [2022-11-16 11:03:05,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:03:05,442 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;@4023adad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:03:05,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-16 11:03:05,447 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-16 11:03:05,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:03:05,448 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:05,448 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:05,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -721879760, now seen corresponding path program 1 times [2022-11-16 11:03:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:05,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518178143] [2022-11-16 11:03:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:05,540 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-16 11:03:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:05,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518178143] [2022-11-16 11:03:05,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518178143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:05,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:05,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:03:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289686008] [2022-11-16 11:03:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:05,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:03:05,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:03:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:03:05,546 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-16 11:03:05,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:05,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-16 11:03:05,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:05,946 INFO L130 PetriNetUnfolder]: 30/1181 cut-off events. [2022-11-16 11:03:05,946 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-16 11:03:05,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1181 events. 30/1181 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7516 event pairs, 2 based on Foata normal form. 410/1439 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-16 11:03:05,973 INFO L137 encePairwiseOnDemand]: 315/370 looper letters, 19 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-11-16 11:03:05,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 754 flow [2022-11-16 11:03:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:03:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:03:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2496 transitions. [2022-11-16 11:03:05,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2022-11-16 11:03:05,980 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2496 transitions. [2022-11-16 11:03:05,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2496 transitions. [2022-11-16 11:03:05,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:05,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2496 transitions. [2022-11-16 11:03:05,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:05,999 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 370.0) internal successors, (3330), 9 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,000 INFO L175 Difference]: Start difference. First operand has 321 places, 368 transitions, 766 flow. Second operand 8 states and 2496 transitions. [2022-11-16 11:03:06,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 754 flow [2022-11-16 11:03:06,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:03:06,007 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 680 flow [2022-11-16 11:03:06,008 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2022-11-16 11:03:06,008 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 2 predicate places. [2022-11-16 11:03:06,009 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 680 flow [2022-11-16 11:03:06,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.3333333333333) internal successors, (1790), 6 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:06,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:06,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:03:06,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -721889790, now seen corresponding path program 1 times [2022-11-16 11:03:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:06,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36371629] [2022-11-16 11:03:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:06,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:06,061 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-16 11:03:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36371629] [2022-11-16 11:03:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36371629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:06,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:06,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:03:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964189347] [2022-11-16 11:03:06,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:06,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:06,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:06,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:06,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-16 11:03:06,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 680 flow. Second operand has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:06,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-16 11:03:06,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:06,386 INFO L130 PetriNetUnfolder]: 30/1180 cut-off events. [2022-11-16 11:03:06,387 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-16 11:03:06,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 1180 events. 30/1180 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7551 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 839. Up to 38 conditions per place. [2022-11-16 11:03:06,408 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-16 11:03:06,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 716 flow [2022-11-16 11:03:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:03:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:03:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1515 transitions. [2022-11-16 11:03:06,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189189189189189 [2022-11-16 11:03:06,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1515 transitions. [2022-11-16 11:03:06,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1515 transitions. [2022-11-16 11:03:06,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:06,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1515 transitions. [2022-11-16 11:03:06,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,422 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,423 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 680 flow. Second operand 5 states and 1515 transitions. [2022-11-16 11:03:06,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 716 flow [2022-11-16 11:03:06,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 700 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-16 11:03:06,429 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 670 flow [2022-11-16 11:03:06,431 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=670, PETRI_PLACES=319, PETRI_TRANSITIONS=316} [2022-11-16 11:03:06,431 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-16 11:03:06,432 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 670 flow [2022-11-16 11:03:06,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.5) internal successors, (1202), 4 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:06,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:06,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:03:06,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash -903434981, now seen corresponding path program 1 times [2022-11-16 11:03:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:06,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330721030] [2022-11-16 11:03:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:06,497 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-16 11:03:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330721030] [2022-11-16 11:03:06,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330721030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:06,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:03:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004110210] [2022-11-16 11:03:06,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:06,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:03:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:03:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:03:06,501 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-16 11:03:06,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 670 flow. Second operand has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:06,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-16 11:03:06,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:06,827 INFO L130 PetriNetUnfolder]: 30/1179 cut-off events. [2022-11-16 11:03:06,827 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-11-16 11:03:06,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 1179 events. 30/1179 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7543 event pairs, 2 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 835. Up to 24 conditions per place. [2022-11-16 11:03:06,853 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 20 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-16 11:03:06,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 756 flow [2022-11-16 11:03:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:03:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:03:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2022-11-16 11:03:06,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2022-11-16 11:03:06,858 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1809 transitions. [2022-11-16 11:03:06,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1809 transitions. [2022-11-16 11:03:06,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:06,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1809 transitions. [2022-11-16 11:03:06,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 301.5) internal successors, (1809), 6 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,867 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 370.0) internal successors, (2590), 7 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,868 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 670 flow. Second operand 6 states and 1809 transitions. [2022-11-16 11:03:06,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 756 flow [2022-11-16 11:03:06,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 748 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:03:06,874 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 672 flow [2022-11-16 11:03:06,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=319, PETRI_TRANSITIONS=315} [2022-11-16 11:03:06,875 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-16 11:03:06,876 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 672 flow [2022-11-16 11:03:06,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 298.8) internal successors, (1494), 5 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:06,877 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:03:06,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:06,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash -903745832, now seen corresponding path program 1 times [2022-11-16 11:03:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:06,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021613950] [2022-11-16 11:03:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:06,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:06,929 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-16 11:03:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021613950] [2022-11-16 11:03:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021613950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:06,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:03:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819272724] [2022-11-16 11:03:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:06,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-16 11:03:06,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 315 transitions, 672 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:06,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:06,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-16 11:03:06,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:07,239 INFO L130 PetriNetUnfolder]: 30/1178 cut-off events. [2022-11-16 11:03:07,239 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-16 11:03:07,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 1178 events. 30/1178 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7514 event pairs, 2 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 834. Up to 24 conditions per place. [2022-11-16 11:03:07,266 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2022-11-16 11:03:07,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 754 flow [2022-11-16 11:03:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:03:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:03:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1221 transitions. [2022-11-16 11:03:07,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-16 11:03:07,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1221 transitions. [2022-11-16 11:03:07,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1221 transitions. [2022-11-16 11:03:07,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:07,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1221 transitions. [2022-11-16 11:03:07,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 305.25) internal successors, (1221), 4 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,279 INFO L175 Difference]: Start difference. First operand has 319 places, 315 transitions, 672 flow. Second operand 4 states and 1221 transitions. [2022-11-16 11:03:07,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 754 flow [2022-11-16 11:03:07,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:03:07,287 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 664 flow [2022-11-16 11:03:07,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=664, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2022-11-16 11:03:07,288 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2022-11-16 11:03:07,289 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 664 flow [2022-11-16 11:03:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:07,290 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:07,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:03:07,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1242822097, now seen corresponding path program 1 times [2022-11-16 11:03:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:07,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536271804] [2022-11-16 11:03:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:07,416 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-16 11:03:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536271804] [2022-11-16 11:03:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536271804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:07,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:07,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:03:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141006728] [2022-11-16 11:03:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:07,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:07,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:07,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:07,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:07,420 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:03:07,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 664 flow. Second operand has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:07,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:03:07,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:07,767 INFO L130 PetriNetUnfolder]: 26/1070 cut-off events. [2022-11-16 11:03:07,768 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-16 11:03:07,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1070 events. 26/1070 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6566 event pairs, 2 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 754. Up to 78 conditions per place. [2022-11-16 11:03:07,786 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-16 11:03:07,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 728 flow [2022-11-16 11:03:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:03:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:03:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-11-16 11:03:07,790 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313513513513513 [2022-11-16 11:03:07,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1538 transitions. [2022-11-16 11:03:07,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1538 transitions. [2022-11-16 11:03:07,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:07,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1538 transitions. [2022-11-16 11:03:07,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.6) internal successors, (1538), 5 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,798 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,798 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 664 flow. Second operand 5 states and 1538 transitions. [2022-11-16 11:03:07,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 728 flow [2022-11-16 11:03:07,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:03:07,805 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 690 flow [2022-11-16 11:03:07,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2022-11-16 11:03:07,806 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2022-11-16 11:03:07,806 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 690 flow [2022-11-16 11:03:07,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:07,807 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:07,807 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:07,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:03:07,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 96355770, now seen corresponding path program 1 times [2022-11-16 11:03:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:07,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554023755] [2022-11-16 11:03:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:08,121 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-16 11:03:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:08,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554023755] [2022-11-16 11:03:08,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554023755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:08,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:08,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:03:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170712393] [2022-11-16 11:03:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:03:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:03:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:03:08,126 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 370 [2022-11-16 11:03:08,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 690 flow. Second operand has 9 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:08,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:08,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 370 [2022-11-16 11:03:08,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:33,031 INFO L130 PetriNetUnfolder]: 55076/140729 cut-off events. [2022-11-16 11:03:33,031 INFO L131 PetriNetUnfolder]: For 2572/2572 co-relation queries the response was YES. [2022-11-16 11:03:33,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217377 conditions, 140729 events. 55076/140729 cut-off events. For 2572/2572 co-relation queries the response was YES. Maximal size of possible extension queue 5461. Compared 2021117 event pairs, 10309 based on Foata normal form. 0/129402 useless extension candidates. Maximal degree in co-relation 217245. Up to 38989 conditions per place. [2022-11-16 11:03:34,878 INFO L137 encePairwiseOnDemand]: 354/370 looper letters, 315 selfloop transitions, 38 changer transitions 0/593 dead transitions. [2022-11-16 11:03:34,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 593 transitions, 2054 flow [2022-11-16 11:03:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:03:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 11:03:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4249 transitions. [2022-11-16 11:03:34,891 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7177364864864865 [2022-11-16 11:03:34,891 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4249 transitions. [2022-11-16 11:03:34,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4249 transitions. [2022-11-16 11:03:34,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:34,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4249 transitions. [2022-11-16 11:03:34,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 265.5625) internal successors, (4249), 16 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:34,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 370.0) internal successors, (6290), 17 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:34,914 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 370.0) internal successors, (6290), 17 states have internal predecessors, (6290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:34,914 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 690 flow. Second operand 16 states and 4249 transitions. [2022-11-16 11:03:34,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 593 transitions, 2054 flow [2022-11-16 11:03:34,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 593 transitions, 2052 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:03:34,928 INFO L231 Difference]: Finished difference. Result has 344 places, 354 transitions, 969 flow [2022-11-16 11:03:34,929 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=969, PETRI_PLACES=344, PETRI_TRANSITIONS=354} [2022-11-16 11:03:34,930 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 23 predicate places. [2022-11-16 11:03:34,930 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 354 transitions, 969 flow [2022-11-16 11:03:34,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:34,931 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:34,931 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:03:34,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:03:34,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash -836580835, now seen corresponding path program 1 times [2022-11-16 11:03:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:34,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909839731] [2022-11-16 11:03:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:03:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:35,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909839731] [2022-11-16 11:03:35,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909839731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:35,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:35,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:03:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18490298] [2022-11-16 11:03:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:35,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:35,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:03:35,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 354 transitions, 969 flow. Second operand has 4 states, 4 states have (on average 305.75) internal successors, (1223), 4 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:35,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:35,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:03:35,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:35,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:35,576 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:03:35,577 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:35,577 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:03:35,577 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:35,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:35,762 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:03:35,763 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:35,763 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:35,763 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:35,970 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:35,970 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-16 11:03:35,970 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:03:35,970 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:35,971 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:03:36,117 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,118 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,118 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:36,118 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,118 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:36,221 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,222 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,222 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,222 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,222 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,227 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][341], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,227 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,227 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,227 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,227 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,233 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 49#t_funENTRYtrue, Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,233 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,233 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:36,233 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:03:36,233 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:36,235 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,235 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,235 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:36,235 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:36,235 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:36,235 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:36,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,297 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:03:36,297 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:03:36,297 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:36,297 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:36,305 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 298#L1013-6true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 392#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), t_funThread1of3ForFork0InUse]) [2022-11-16 11:03:36,305 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-16 11:03:36,306 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:03:36,306 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-16 11:03:36,306 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:03:36,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 162#L1013-7true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-16 11:03:36,314 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-16 11:03:36,314 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-16 11:03:36,315 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 11:03:36,315 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-16 11:03:36,323 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,323 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-16 11:03:36,323 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,323 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:36,323 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,324 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:36,326 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,326 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-16 11:03:36,326 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:36,327 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:36,327 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:03:36,327 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:03:36,338 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][341], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-16 11:03:36,338 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:03:36,339 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:36,339 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:36,339 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:36,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][341], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 165#L1013-10true, Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,342 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:03:36,342 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:36,343 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:36,343 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:36,395 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-16 11:03:36,395 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:36,396 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:36,396 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:03:36,396 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:36,396 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,396 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:36,397 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:36,397 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:36,397 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:36,398 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][240], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,399 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:36,399 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:36,399 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:36,399 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:36,399 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 11:03:36,406 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][341], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:36,407 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-16 11:03:36,407 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:36,407 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:03:36,407 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:36,411 INFO L130 PetriNetUnfolder]: 573/5045 cut-off events. [2022-11-16 11:03:36,411 INFO L131 PetriNetUnfolder]: For 3183/4289 co-relation queries the response was YES. [2022-11-16 11:03:36,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8196 conditions, 5045 events. 573/5045 cut-off events. For 3183/4289 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51452 event pairs, 154 based on Foata normal form. 52/4498 useless extension candidates. Maximal degree in co-relation 7460. Up to 573 conditions per place. [2022-11-16 11:03:36,533 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 13 selfloop transitions, 8 changer transitions 0/354 dead transitions. [2022-11-16 11:03:36,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 354 transitions, 1009 flow [2022-11-16 11:03:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:03:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:03:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1529 transitions. [2022-11-16 11:03:36,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8264864864864865 [2022-11-16 11:03:36,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1529 transitions. [2022-11-16 11:03:36,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1529 transitions. [2022-11-16 11:03:36,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:36,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1529 transitions. [2022-11-16 11:03:36,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.8) internal successors, (1529), 5 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-16 11:03:36,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:36,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:36,546 INFO L175 Difference]: Start difference. First operand has 344 places, 354 transitions, 969 flow. Second operand 5 states and 1529 transitions. [2022-11-16 11:03:36,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 354 transitions, 1009 flow [2022-11-16 11:03:36,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 1008 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:03:36,565 INFO L231 Difference]: Finished difference. Result has 347 places, 354 transitions, 988 flow [2022-11-16 11:03:36,566 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=988, PETRI_PLACES=347, PETRI_TRANSITIONS=354} [2022-11-16 11:03:36,567 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 26 predicate places. [2022-11-16 11:03:36,567 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 354 transitions, 988 flow [2022-11-16 11:03:36,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 305.75) internal successors, (1223), 4 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:36,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:36,568 INFO L209 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:03:36,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:03:36,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:36,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash -164200905, now seen corresponding path program 1 times [2022-11-16 11:03:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:36,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722865220] [2022-11-16 11:03:36,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:36,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:36,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722865220] [2022-11-16 11:03:36,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722865220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:03:36,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575988080] [2022-11-16 11:03:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:36,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:03:36,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:03:36,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:03:36,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:03:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:36,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:36,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:36,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575988080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:36,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:03:36,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-16 11:03:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943942595] [2022-11-16 11:03:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:36,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:03:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:03:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:03:36,896 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:03:36,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 354 transitions, 988 flow. Second operand has 5 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:36,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:36,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:03:36,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:37,252 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,252 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-16 11:03:37,252 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:37,252 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:37,252 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-16 11:03:37,523 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,523 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-16 11:03:37,523 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:37,524 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:37,524 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-16 11:03:37,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,722 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-16 11:03:37,723 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:37,723 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:03:37,723 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:03:37,855 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,855 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 11:03:37,855 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:37,855 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:37,855 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:03:37,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,984 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:37,985 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:37,985 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:37,985 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:37,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][340], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,991 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:37,992 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:37,992 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:37,992 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:37,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 49#t_funENTRYtrue, Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:37,998 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:37,998 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:37,998 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:03:37,998 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:38,001 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,001 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:38,001 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:38,001 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:38,002 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:38,002 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:03:38,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,100 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:03:38,101 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:38,101 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:03:38,101 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:38,117 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 298#L1013-6true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 392#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), t_funThread1of3ForFork0InUse]) [2022-11-16 11:03:38,117 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-16 11:03:38,117 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:03:38,117 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-16 11:03:38,118 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 11:03:38,126 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 162#L1013-7true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-16 11:03:38,126 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-16 11:03:38,126 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-16 11:03:38,126 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 11:03:38,127 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-16 11:03:38,134 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,135 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-16 11:03:38,135 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:38,135 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:38,135 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:38,135 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:38,137 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,137 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-16 11:03:38,137 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:38,137 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:03:38,137 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:03:38,137 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:03:38,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][340], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-16 11:03:38,145 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:03:38,146 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:38,146 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:38,146 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:38,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][340], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,148 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:03:38,148 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:38,148 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:38,149 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:38,192 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][313], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 149#L1013-10true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse, 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0))]) [2022-11-16 11:03:38,192 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:38,192 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:38,192 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:03:38,192 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:38,193 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,193 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:38,193 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:38,194 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:38,194 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:38,196 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,196 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:38,196 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 11:03:38,196 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:38,197 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:38,197 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:03:38,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][340], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:38,206 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-16 11:03:38,207 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:03:38,207 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:38,207 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:38,211 INFO L130 PetriNetUnfolder]: 573/5043 cut-off events. [2022-11-16 11:03:38,212 INFO L131 PetriNetUnfolder]: For 3192/4258 co-relation queries the response was YES. [2022-11-16 11:03:38,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 5043 events. 573/5043 cut-off events. For 3192/4258 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51568 event pairs, 154 based on Foata normal form. 20/4464 useless extension candidates. Maximal degree in co-relation 7472. Up to 573 conditions per place. [2022-11-16 11:03:38,341 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 15 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2022-11-16 11:03:38,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 1024 flow [2022-11-16 11:03:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:03:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-16 11:03:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1225 transitions. [2022-11-16 11:03:38,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277027027027027 [2022-11-16 11:03:38,345 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1225 transitions. [2022-11-16 11:03:38,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1225 transitions. [2022-11-16 11:03:38,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:38,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1225 transitions. [2022-11-16 11:03:38,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 306.25) internal successors, (1225), 4 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:38,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:38,354 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 370.0) internal successors, (1850), 5 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:38,354 INFO L175 Difference]: Start difference. First operand has 347 places, 354 transitions, 988 flow. Second operand 4 states and 1225 transitions. [2022-11-16 11:03:38,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 1024 flow [2022-11-16 11:03:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 353 transitions, 1012 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:03:38,378 INFO L231 Difference]: Finished difference. Result has 346 places, 353 transitions, 982 flow [2022-11-16 11:03:38,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=982, PETRI_PLACES=346, PETRI_TRANSITIONS=353} [2022-11-16 11:03:38,379 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 25 predicate places. [2022-11-16 11:03:38,380 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 353 transitions, 982 flow [2022-11-16 11:03:38,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.2) internal successors, (1526), 5 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:38,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:38,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:38,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 11:03:38,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:03:38,586 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2069422248, now seen corresponding path program 1 times [2022-11-16 11:03:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:38,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713783035] [2022-11-16 11:03:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:38,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:38,687 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-16 11:03:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:38,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713783035] [2022-11-16 11:03:38,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713783035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:03:38,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448314670] [2022-11-16 11:03:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:03:38,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:03:38,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:03:38,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:03:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:38,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:38,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:38,873 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-16 11:03:38,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:03:38,921 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-16 11:03:38,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448314670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:03:38,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:03:38,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:03:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529704102] [2022-11-16 11:03:38,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:03:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:03:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:03:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:03:38,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-16 11:03:38,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 353 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 304.9) internal successors, (3049), 10 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:38,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:38,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-16 11:03:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:03:39,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:39,670 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-16 11:03:39,670 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:03:39,671 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-16 11:03:39,671 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-16 11:03:40,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,157 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:40,157 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:40,157 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:40,157 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:40,159 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,159 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-16 11:03:40,160 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:40,160 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-16 11:03:40,160 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-16 11:03:40,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 89#L1013-10true, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,171 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,171 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,171 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,171 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,261 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 102#t_funENTRYtrue, 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,261 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:03:40,262 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:40,262 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:03:40,262 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:40,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 83#t_funENTRYtrue, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,265 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:03:40,266 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:40,266 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:40,266 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:03:40,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, 49#t_funENTRYtrue, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), t_funThread1of3ForFork0InUse]) [2022-11-16 11:03:40,272 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-16 11:03:40,272 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:40,273 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-16 11:03:40,273 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-16 11:03:40,303 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 89#L1013-10true, t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,304 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,304 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,304 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,304 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,304 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,340 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 298#L1013-6true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 392#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse]) [2022-11-16 11:03:40,340 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is not cut-off event [2022-11-16 11:03:40,340 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-16 11:03:40,341 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-16 11:03:40,341 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-16 11:03:40,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 162#L1013-7true, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse]) [2022-11-16 11:03:40,347 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-16 11:03:40,347 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-16 11:03:40,347 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-16 11:03:40,348 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:03:40,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 149#L1013-10true, 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0InUse]) [2022-11-16 11:03:40,382 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:40,382 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,382 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,382 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 165#L1013-10true, Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,383 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:40,383 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,383 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,383 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,385 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 165#L1013-10true, Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,385 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-16 11:03:40,386 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,386 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:03:40,386 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-16 11:03:40,386 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-16 11:03:40,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1458] t_funEXIT-->L1040-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][327], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,401 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-16 11:03:40,401 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:40,401 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:03:40,402 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:40,402 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1459] t_funEXIT-->L1040-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][328], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), 206#L1040-5true, Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,403 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-16 11:03:40,403 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:03:40,403 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:40,403 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:40,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,411 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-16 11:03:40,411 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-16 11:03:40,411 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-16 11:03:40,411 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-16 11:03:40,425 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1457] t_funEXIT-->L1040-5: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_11| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_11|, t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 640#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)), 676#true, Black: 365#(= 0 |ULTIMATE.start_main_#t~post16#1|), Black: 367#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 0 |ULTIMATE.start_main_#t~post16#1|)), Black: 364#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 400#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 396#(and (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 414#true, Black: 382#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 390#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 376#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 398#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 394#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), 206#L1040-5true, Black: 384#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0)), Black: 386#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 3)) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), Black: 388#(and (= |t_funThread1of3ForFork0_#t~mem6#1| 0) (= (select |#valid| 3) 1) (= 3 |~#A~0.base|) (= |t_funThread1of3ForFork0_#t~post7#1| 0)), t_funThread1of3ForFork0NotInUse, 375#(and (= (select |#valid| 3) 1) (= 3 |~#A~0.base|))]) [2022-11-16 11:03:40,425 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-16 11:03:40,425 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:03:40,425 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:40,426 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-16 11:03:40,426 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:03:40,427 INFO L130 PetriNetUnfolder]: 495/4208 cut-off events. [2022-11-16 11:03:40,427 INFO L131 PetriNetUnfolder]: For 2937/3413 co-relation queries the response was YES. [2022-11-16 11:03:40,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7048 conditions, 4208 events. 495/4208 cut-off events. For 2937/3413 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 40746 event pairs, 152 based on Foata normal form. 28/3740 useless extension candidates. Maximal degree in co-relation 6865. Up to 493 conditions per place. [2022-11-16 11:03:40,481 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 22 selfloop transitions, 9 changer transitions 0/364 dead transitions. [2022-11-16 11:03:40,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 364 transitions, 1082 flow [2022-11-16 11:03:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:03:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:03:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2751 transitions. [2022-11-16 11:03:40,485 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261261261261261 [2022-11-16 11:03:40,485 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2751 transitions. [2022-11-16 11:03:40,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2751 transitions. [2022-11-16 11:03:40,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:03:40,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2751 transitions. [2022-11-16 11:03:40,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 305.6666666666667) internal successors, (2751), 9 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:40,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 370.0) internal successors, (3700), 10 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:40,498 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 370.0) internal successors, (3700), 10 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:40,498 INFO L175 Difference]: Start difference. First operand has 346 places, 353 transitions, 982 flow. Second operand 9 states and 2751 transitions. [2022-11-16 11:03:40,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 364 transitions, 1082 flow [2022-11-16 11:03:40,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 364 transitions, 1068 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:03:40,516 INFO L231 Difference]: Finished difference. Result has 355 places, 357 transitions, 1028 flow [2022-11-16 11:03:40,516 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1028, PETRI_PLACES=355, PETRI_TRANSITIONS=357} [2022-11-16 11:03:40,517 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 34 predicate places. [2022-11-16 11:03:40,517 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 357 transitions, 1028 flow [2022-11-16 11:03:40,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.9) internal successors, (3049), 10 states have internal predecessors, (3049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:40,518 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:03:40,518 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:40,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:40,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ab71fcb-f2fd-44a1-894d-7b7df89ce031/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:03:40,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2022-11-16 11:03:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash 869056805, now seen corresponding path program 1 times [2022-11-16 11:03:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:03:40,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851473860] [2022-11-16 11:03:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:03:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:40,950 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-16 11:03:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:03:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851473860] [2022-11-16 11:03:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851473860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:40,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:03:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982387564] [2022-11-16 11:03:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:40,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:03:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:03:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:03:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:03:40,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 370 [2022-11-16 11:03:40,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 357 transitions, 1028 flow. Second operand has 6 states, 6 states have (on average 253.16666666666666) internal successors, (1519), 6 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:03:40,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:03:40,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 370 [2022-11-16 11:03:40,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand