./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/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_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:43:33,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:43:33,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:43:33,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:43:33,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:43:33,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:43:33,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:43:33,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:43:33,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:43:33,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:43:33,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:43:33,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:43:33,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:43:33,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:43:33,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:43:33,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:43:33,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:43:33,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:43:33,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:43:33,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:43:33,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:43:33,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:43:33,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:43:33,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:43:33,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:43:33,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:43:33,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:43:33,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:43:33,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:43:33,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:43:33,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:43:33,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:43:33,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:43:33,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:43:33,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:43:33,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:43:33,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:43:33,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:43:33,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:43:33,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:43:33,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:43:33,862 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 20:43:33,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:43:33,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:43:33,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:43:33,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:43:33,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:43:33,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:43:33,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:43:33,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:43:33,890 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:43:33,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:43:33,891 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:43:33,891 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:43:33,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:43:33,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:43:33,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:43:33,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:43:33,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:43:33,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:43:33,894 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:43:33,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:43:33,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:43:33,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:43:33,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:43:33,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:43:33,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:43:33,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:43:33,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:43:33,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:43:33,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:43:33,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:43:33,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:43:33,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:43:33,898 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:43:33,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:43:33,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:43:33,899 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_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-18 20:43:34,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:43:34,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:43:34,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:43:34,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:43:34,252 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:43:34,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-18 20:43:34,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/data/2e07b0148/45ca207ac45d43f59a5052ee90ba815b/FLAG3fbf3dd18 [2022-11-18 20:43:34,957 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:43:34,958 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2022-11-18 20:43:34,975 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/data/2e07b0148/45ca207ac45d43f59a5052ee90ba815b/FLAG3fbf3dd18 [2022-11-18 20:43:35,239 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/data/2e07b0148/45ca207ac45d43f59a5052ee90ba815b [2022-11-18 20:43:35,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:43:35,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:43:35,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:43:35,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:43:35,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:43:35,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:43:35" (1/1) ... [2022-11-18 20:43:35,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575a8723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:35, skipping insertion in model container [2022-11-18 20:43:35,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:43:35" (1/1) ... [2022-11-18 20:43:35,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:43:35,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:43:36,008 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-18 20:43:36,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:43:36,063 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:43:36,102 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i[47038,47051] [2022-11-18 20:43:36,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:43:36,181 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:43:36,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36 WrapperNode [2022-11-18 20:43:36,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:43:36,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:43:36,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:43:36,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:43:36,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,257 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 217 [2022-11-18 20:43:36,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:43:36,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:43:36,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:43:36,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:43:36,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,316 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:43:36,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:43:36,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:43:36,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:43:36,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (1/1) ... [2022-11-18 20:43:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:43:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:36,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:43:36,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:43:36,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:43:36,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:43:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:43:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:43:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 20:43:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:43:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-18 20:43:36,416 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-18 20:43:36,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:43:36,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:43:36,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:43:36,419 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:43:36,568 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:43:36,571 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:43:37,078 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:43:37,088 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:43:37,089 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-11-18 20:43:37,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:43:37 BoogieIcfgContainer [2022-11-18 20:43:37,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:43:37,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:43:37,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:43:37,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:43:37,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:43:35" (1/3) ... [2022-11-18 20:43:37,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@deb9291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:43:37, skipping insertion in model container [2022-11-18 20:43:37,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:43:36" (2/3) ... [2022-11-18 20:43:37,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@deb9291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:43:37, skipping insertion in model container [2022-11-18 20:43:37,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:43:37" (3/3) ... [2022-11-18 20:43:37,109 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2022-11-18 20:43:37,121 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:43:37,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:43:37,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-18 20:43:37,134 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:43:37,230 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-18 20:43:37,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 236 transitions, 480 flow [2022-11-18 20:43:37,466 INFO L130 PetriNetUnfolder]: 43/315 cut-off events. [2022-11-18 20:43:37,467 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 20:43:37,477 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-18 20:43:37,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 236 transitions, 480 flow [2022-11-18 20:43:37,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 231 transitions, 470 flow [2022-11-18 20:43:37,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:43:37,523 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;@5b1458df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:43:37,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-18 20:43:37,537 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-18 20:43:37,537 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:43:37,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:37,538 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-18 20:43:37,539 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-18 20:43:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1528895984, now seen corresponding path program 1 times [2022-11-18 20:43:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:37,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789692931] [2022-11-18 20:43:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789692931] [2022-11-18 20:43:38,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789692931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:38,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:38,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:43:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660837447] [2022-11-18 20:43:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:43:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:38,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:43:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:38,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-18 20:43:38,255 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-18 20:43:38,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:38,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-18 20:43:38,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:38,530 INFO L130 PetriNetUnfolder]: 6/473 cut-off events. [2022-11-18 20:43:38,530 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-18 20:43:38,538 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-18 20:43:38,543 INFO L137 encePairwiseOnDemand]: 203/236 looper letters, 11 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2022-11-18 20:43:38,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 464 flow [2022-11-18 20:43:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:43:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:43:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1596 transitions. [2022-11-18 20:43:38,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8453389830508474 [2022-11-18 20:43:38,567 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1596 transitions. [2022-11-18 20:43:38,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1596 transitions. [2022-11-18 20:43:38,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:38,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1596 transitions. [2022-11-18 20:43:38,584 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-18 20:43:38,599 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-18 20:43:38,601 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-18 20:43:38,603 INFO L175 Difference]: Start difference. First operand has 207 places, 231 transitions, 470 flow. Second operand 8 states and 1596 transitions. [2022-11-18 20:43:38,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 464 flow [2022-11-18 20:43:38,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:43:38,614 INFO L231 Difference]: Finished difference. Result has 211 places, 204 transitions, 432 flow [2022-11-18 20:43:38,616 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-18 20:43:38,620 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 4 predicate places. [2022-11-18 20:43:38,620 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 432 flow [2022-11-18 20:43:38,621 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-18 20:43:38,621 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:38,622 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-18 20:43:38,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:43:38,622 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-18 20:43:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1528885954, now seen corresponding path program 1 times [2022-11-18 20:43:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:38,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098431484] [2022-11-18 20:43:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:38,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098431484] [2022-11-18 20:43:38,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098431484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:38,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:38,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361704348] [2022-11-18 20:43:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:38,712 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-18 20:43:38,713 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-18 20:43:38,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:38,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-18 20:43:38,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:38,819 INFO L130 PetriNetUnfolder]: 6/472 cut-off events. [2022-11-18 20:43:38,820 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 20:43:38,821 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-18 20:43:38,823 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 11 selfloop transitions, 4 changer transitions 0/203 dead transitions. [2022-11-18 20:43:38,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 460 flow [2022-11-18 20:43:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 981 transitions. [2022-11-18 20:43:38,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313559322033899 [2022-11-18 20:43:38,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 981 transitions. [2022-11-18 20:43:38,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 981 transitions. [2022-11-18 20:43:38,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:38,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 981 transitions. [2022-11-18 20:43:38,831 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-18 20:43:38,833 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-18 20:43:38,834 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-18 20:43:38,835 INFO L175 Difference]: Start difference. First operand has 211 places, 204 transitions, 432 flow. Second operand 5 states and 981 transitions. [2022-11-18 20:43:38,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 203 transitions, 460 flow [2022-11-18 20:43:38,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 444 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-18 20:43:38,860 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 422 flow [2022-11-18 20:43:38,860 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-18 20:43:38,861 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-18 20:43:38,862 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 422 flow [2022-11-18 20:43:38,862 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-18 20:43:38,862 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:38,863 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-18 20:43:38,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:43:38,863 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-18 20:43:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash 151135674, now seen corresponding path program 1 times [2022-11-18 20:43:38,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:38,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198799315] [2022-11-18 20:43:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:38,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198799315] [2022-11-18 20:43:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198799315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:38,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:38,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208351473] [2022-11-18 20:43:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:38,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:38,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 236 [2022-11-18 20:43:38,992 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-18 20:43:38,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:38,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 236 [2022-11-18 20:43:38,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:39,138 INFO L130 PetriNetUnfolder]: 6/471 cut-off events. [2022-11-18 20:43:39,138 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-18 20:43:39,140 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-18 20:43:39,142 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 12 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2022-11-18 20:43:39,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 466 flow [2022-11-18 20:43:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:43:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:43:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions. [2022-11-18 20:43:39,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8227401129943502 [2022-11-18 20:43:39,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions. [2022-11-18 20:43:39,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions. [2022-11-18 20:43:39,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:39,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions. [2022-11-18 20:43:39,154 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-18 20:43:39,158 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-18 20:43:39,159 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-18 20:43:39,160 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 422 flow. Second operand 6 states and 1165 transitions. [2022-11-18 20:43:39,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 466 flow [2022-11-18 20:43:39,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 204 transitions, 458 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:43:39,166 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 424 flow [2022-11-18 20:43:39,166 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-18 20:43:39,167 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2022-11-18 20:43:39,167 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 424 flow [2022-11-18 20:43:39,168 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-18 20:43:39,169 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:39,169 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-18 20:43:39,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:43:39,169 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-18 20:43:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 150824823, now seen corresponding path program 1 times [2022-11-18 20:43:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:39,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181691789] [2022-11-18 20:43:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:39,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:39,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181691789] [2022-11-18 20:43:39,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181691789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:39,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:39,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419585875] [2022-11-18 20:43:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:39,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:39,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 236 [2022-11-18 20:43:39,250 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-18 20:43:39,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:39,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 236 [2022-11-18 20:43:39,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:39,359 INFO L130 PetriNetUnfolder]: 6/470 cut-off events. [2022-11-18 20:43:39,359 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-18 20:43:39,361 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-18 20:43:39,363 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 13 selfloop transitions, 3 changer transitions 0/203 dead transitions. [2022-11-18 20:43:39,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 464 flow [2022-11-18 20:43:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:43:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:43:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2022-11-18 20:43:39,375 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8358050847457628 [2022-11-18 20:43:39,375 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2022-11-18 20:43:39,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2022-11-18 20:43:39,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:39,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2022-11-18 20:43:39,378 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-18 20:43:39,381 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-18 20:43:39,381 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-18 20:43:39,382 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 424 flow. Second operand 4 states and 789 transitions. [2022-11-18 20:43:39,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 203 transitions, 464 flow [2022-11-18 20:43:39,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 203 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:43:39,386 INFO L231 Difference]: Finished difference. Result has 204 places, 201 transitions, 416 flow [2022-11-18 20:43:39,386 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-18 20:43:39,387 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-18 20:43:39,387 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 201 transitions, 416 flow [2022-11-18 20:43:39,388 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-18 20:43:39,388 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:39,388 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-18 20:43:39,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:43:39,389 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-18 20:43:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 165110258, now seen corresponding path program 1 times [2022-11-18 20:43:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586263254] [2022-11-18 20:43:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:39,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586263254] [2022-11-18 20:43:39,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586263254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:39,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:39,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731884288] [2022-11-18 20:43:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:39,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:39,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2022-11-18 20:43:39,484 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-18 20:43:39,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:39,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2022-11-18 20:43:39,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:39,567 INFO L130 PetriNetUnfolder]: 4/344 cut-off events. [2022-11-18 20:43:39,567 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 20:43:39,569 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-18 20:43:39,570 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 10 selfloop transitions, 4 changer transitions 0/201 dead transitions. [2022-11-18 20:43:39,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 444 flow [2022-11-18 20:43:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2022-11-18 20:43:39,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8449152542372881 [2022-11-18 20:43:39,574 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 997 transitions. [2022-11-18 20:43:39,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 997 transitions. [2022-11-18 20:43:39,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:39,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 997 transitions. [2022-11-18 20:43:39,578 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-18 20:43:39,580 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-18 20:43:39,581 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-18 20:43:39,581 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 416 flow. Second operand 5 states and 997 transitions. [2022-11-18 20:43:39,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 444 flow [2022-11-18 20:43:39,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:43:39,586 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 418 flow [2022-11-18 20:43:39,586 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-18 20:43:39,591 INFO L288 CegarLoopForPetriNet]: 207 programPoint places, -3 predicate places. [2022-11-18 20:43:39,591 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 418 flow [2022-11-18 20:43:39,591 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-18 20:43:39,592 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:39,592 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-18 20:43:39,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:43:39,593 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-18 20:43:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -454347722, now seen corresponding path program 1 times [2022-11-18 20:43:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:39,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043456392] [2022-11-18 20:43:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:43:39,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:43:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:43:39,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:43:39,709 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:43:39,710 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-18 20:43:39,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2022-11-18 20:43:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2022-11-18 20:43:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2022-11-18 20:43:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2022-11-18 20:43:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2022-11-18 20:43:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2022-11-18 20:43:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2022-11-18 20:43:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2022-11-18 20:43:39,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2022-11-18 20:43:39,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2022-11-18 20:43:39,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2022-11-18 20:43:39,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2022-11-18 20:43:39,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2022-11-18 20:43:39,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2022-11-18 20:43:39,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2022-11-18 20:43:39,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2022-11-18 20:43:39,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2022-11-18 20:43:39,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2022-11-18 20:43:39,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2022-11-18 20:43:39,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2022-11-18 20:43:39,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:43:39,730 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 20:43:39,733 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 20:43:39,733 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-18 20:43:39,769 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:43:39,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 624 flow [2022-11-18 20:43:39,853 INFO L130 PetriNetUnfolder]: 72/498 cut-off events. [2022-11-18 20:43:39,854 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 20:43:39,857 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-18 20:43:39,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 303 transitions, 624 flow [2022-11-18 20:43:39,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 301 transitions, 620 flow [2022-11-18 20:43:39,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:43:39,865 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;@5b1458df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:43:39,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-18 20:43:39,871 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-18 20:43:39,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:43:39,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:39,871 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-18 20:43:39,872 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-18 20:43:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash 119872176, now seen corresponding path program 1 times [2022-11-18 20:43:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:39,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495254896] [2022-11-18 20:43:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:40,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495254896] [2022-11-18 20:43:40,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495254896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:40,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:40,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:43:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982713636] [2022-11-18 20:43:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:40,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:43:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:40,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:43:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:40,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-18 20:43:40,042 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-18 20:43:40,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:40,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-18 20:43:40,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:40,277 INFO L130 PetriNetUnfolder]: 16/791 cut-off events. [2022-11-18 20:43:40,277 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-11-18 20:43:40,282 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-18 20:43:40,287 INFO L137 encePairwiseOnDemand]: 259/303 looper letters, 15 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2022-11-18 20:43:40,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 610 flow [2022-11-18 20:43:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:43:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:43:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2046 transitions. [2022-11-18 20:43:40,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2022-11-18 20:43:40,293 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2046 transitions. [2022-11-18 20:43:40,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2046 transitions. [2022-11-18 20:43:40,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:40,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2046 transitions. [2022-11-18 20:43:40,303 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-18 20:43:40,308 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-18 20:43:40,309 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-18 20:43:40,309 INFO L175 Difference]: Start difference. First operand has 265 places, 301 transitions, 620 flow. Second operand 8 states and 2046 transitions. [2022-11-18 20:43:40,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 610 flow [2022-11-18 20:43:40,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:43:40,314 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 558 flow [2022-11-18 20:43:40,315 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-18 20:43:40,317 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 3 predicate places. [2022-11-18 20:43:40,317 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 558 flow [2022-11-18 20:43:40,318 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-18 20:43:40,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:40,318 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-18 20:43:40,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:43:40,320 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-18 20:43:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash 119862146, now seen corresponding path program 1 times [2022-11-18 20:43:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:40,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664654565] [2022-11-18 20:43:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:40,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:40,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664654565] [2022-11-18 20:43:40,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664654565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:40,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:40,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351951782] [2022-11-18 20:43:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:40,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:40,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-18 20:43:40,411 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-18 20:43:40,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:40,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-18 20:43:40,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:40,609 INFO L130 PetriNetUnfolder]: 16/790 cut-off events. [2022-11-18 20:43:40,609 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-18 20:43:40,615 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-18 20:43:40,619 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 4 changer transitions 0/261 dead transitions. [2022-11-18 20:43:40,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 590 flow [2022-11-18 20:43:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2022-11-18 20:43:40,623 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8237623762376237 [2022-11-18 20:43:40,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2022-11-18 20:43:40,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2022-11-18 20:43:40,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:40,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2022-11-18 20:43:40,627 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-18 20:43:40,630 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-18 20:43:40,631 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-18 20:43:40,631 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 558 flow. Second operand 5 states and 1248 transitions. [2022-11-18 20:43:40,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 590 flow [2022-11-18 20:43:40,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 261 transitions, 574 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-18 20:43:40,638 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 548 flow [2022-11-18 20:43:40,639 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-18 20:43:40,640 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-18 20:43:40,640 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 548 flow [2022-11-18 20:43:40,641 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-18 20:43:40,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:40,641 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-18 20:43:40,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:43:40,644 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-18 20:43:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash -578929111, now seen corresponding path program 1 times [2022-11-18 20:43:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:40,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831951360] [2022-11-18 20:43:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:40,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831951360] [2022-11-18 20:43:40,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831951360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:40,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:40,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747245361] [2022-11-18 20:43:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:40,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:40,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2022-11-18 20:43:40,748 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-18 20:43:40,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:40,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2022-11-18 20:43:40,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:40,976 INFO L130 PetriNetUnfolder]: 16/789 cut-off events. [2022-11-18 20:43:40,976 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-18 20:43:40,981 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-18 20:43:40,985 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 16 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2022-11-18 20:43:40,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 612 flow [2022-11-18 20:43:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:43:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:43:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2022-11-18 20:43:40,990 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.817931793179318 [2022-11-18 20:43:40,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2022-11-18 20:43:40,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2022-11-18 20:43:40,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:40,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2022-11-18 20:43:40,997 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-18 20:43:41,001 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-18 20:43:41,002 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-18 20:43:41,002 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 548 flow. Second operand 6 states and 1487 transitions. [2022-11-18 20:43:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 612 flow [2022-11-18 20:43:41,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 604 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:43:41,009 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 550 flow [2022-11-18 20:43:41,010 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-18 20:43:41,010 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -1 predicate places. [2022-11-18 20:43:41,010 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 550 flow [2022-11-18 20:43:41,011 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-18 20:43:41,011 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:41,012 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-18 20:43:41,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:43:41,012 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-18 20:43:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash -579239962, now seen corresponding path program 1 times [2022-11-18 20:43:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:41,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353426060] [2022-11-18 20:43:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:41,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353426060] [2022-11-18 20:43:41,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353426060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:41,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:41,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932697983] [2022-11-18 20:43:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:41,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:41,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 303 [2022-11-18 20:43:41,078 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-18 20:43:41,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:41,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 303 [2022-11-18 20:43:41,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:41,245 INFO L130 PetriNetUnfolder]: 16/788 cut-off events. [2022-11-18 20:43:41,246 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-18 20:43:41,251 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-18 20:43:41,255 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 17 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2022-11-18 20:43:41,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 610 flow [2022-11-18 20:43:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:43:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:43:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1005 transitions. [2022-11-18 20:43:41,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8292079207920792 [2022-11-18 20:43:41,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1005 transitions. [2022-11-18 20:43:41,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1005 transitions. [2022-11-18 20:43:41,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:41,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1005 transitions. [2022-11-18 20:43:41,263 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-18 20:43:41,265 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-18 20:43:41,266 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-18 20:43:41,266 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 550 flow. Second operand 4 states and 1005 transitions. [2022-11-18 20:43:41,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 610 flow [2022-11-18 20:43:41,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:43:41,273 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 542 flow [2022-11-18 20:43:41,273 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-18 20:43:41,274 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -4 predicate places. [2022-11-18 20:43:41,275 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 542 flow [2022-11-18 20:43:41,275 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-18 20:43:41,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:41,276 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-18 20:43:41,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:43:41,276 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-18 20:43:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1173350771, now seen corresponding path program 1 times [2022-11-18 20:43:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:41,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783725947] [2022-11-18 20:43:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:41,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:41,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783725947] [2022-11-18 20:43:41,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783725947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:41,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:41,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850945516] [2022-11-18 20:43:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:41,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:41,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 20:43:41,378 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-18 20:43:41,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:41,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 20:43:41,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:41,567 INFO L130 PetriNetUnfolder]: 12/680 cut-off events. [2022-11-18 20:43:41,568 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-18 20:43:41,573 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-18 20:43:41,576 INFO L137 encePairwiseOnDemand]: 296/303 looper letters, 19 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2022-11-18 20:43:41,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2022-11-18 20:43:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1271 transitions. [2022-11-18 20:43:41,580 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.838943894389439 [2022-11-18 20:43:41,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1271 transitions. [2022-11-18 20:43:41,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1271 transitions. [2022-11-18 20:43:41,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:41,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1271 transitions. [2022-11-18 20:43:41,585 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-18 20:43:41,589 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-18 20:43:41,590 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-18 20:43:41,590 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 542 flow. Second operand 5 states and 1271 transitions. [2022-11-18 20:43:41,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2022-11-18 20:43:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 266 transitions, 596 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:43:41,602 INFO L231 Difference]: Finished difference. Result has 265 places, 262 transitions, 568 flow [2022-11-18 20:43:41,604 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-18 20:43:41,605 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 0 predicate places. [2022-11-18 20:43:41,605 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 568 flow [2022-11-18 20:43:41,614 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-18 20:43:41,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:41,614 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-18 20:43:41,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:43:41,615 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-18 20:43:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1578948222, now seen corresponding path program 1 times [2022-11-18 20:43:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:41,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164058897] [2022-11-18 20:43:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:41,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:41,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164058897] [2022-11-18 20:43:41,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164058897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:41,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:41,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:43:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304374361] [2022-11-18 20:43:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:43:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:41,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:43:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:43:41,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 303 [2022-11-18 20:43:41,932 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-18 20:43:41,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:41,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 303 [2022-11-18 20:43:41,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:44,947 INFO L130 PetriNetUnfolder]: 4046/13313 cut-off events. [2022-11-18 20:43:44,947 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-11-18 20:43:44,996 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-18 20:43:45,070 INFO L137 encePairwiseOnDemand]: 288/303 looper letters, 221 selfloop transitions, 32 changer transitions 0/447 dead transitions. [2022-11-18 20:43:45,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 447 transitions, 1490 flow [2022-11-18 20:43:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:43:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:43:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3413 transitions. [2022-11-18 20:43:45,080 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7040016501650165 [2022-11-18 20:43:45,080 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3413 transitions. [2022-11-18 20:43:45,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3413 transitions. [2022-11-18 20:43:45,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:45,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3413 transitions. [2022-11-18 20:43:45,092 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-18 20:43:45,101 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-18 20:43:45,104 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-18 20:43:45,104 INFO L175 Difference]: Start difference. First operand has 265 places, 262 transitions, 568 flow. Second operand 16 states and 3413 transitions. [2022-11-18 20:43:45,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 447 transitions, 1490 flow [2022-11-18 20:43:45,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 447 transitions, 1488 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:43:45,115 INFO L231 Difference]: Finished difference. Result has 289 places, 293 transitions, 803 flow [2022-11-18 20:43:45,116 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-18 20:43:45,116 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 24 predicate places. [2022-11-18 20:43:45,117 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 293 transitions, 803 flow [2022-11-18 20:43:45,117 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-18 20:43:45,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:45,118 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-18 20:43:45,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:43:45,119 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-18 20:43:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 412042784, now seen corresponding path program 1 times [2022-11-18 20:43:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:45,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756504461] [2022-11-18 20:43:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:45,197 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-18 20:43:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756504461] [2022-11-18 20:43:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756504461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:45,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:45,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133938578] [2022-11-18 20:43:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:45,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:45,203 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 20:43:45,204 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-18 20:43:45,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:45,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 20:43:45,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:45,535 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-18 20:43:45,536 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 20:43:45,536 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 20:43:45,536 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:43:45,537 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:43:45,619 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-18 20:43:45,619 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 20:43:45,619 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:43:45,620 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:43:45,620 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:43:45,675 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-18 20:43:45,675 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-18 20:43:45,676 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:43:45,676 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:43:45,676 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:43:45,693 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-18 20:43:45,694 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:43:45,694 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:43:45,694 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:43:45,694 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:43:45,695 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:43:45,696 INFO L130 PetriNetUnfolder]: 132/1589 cut-off events. [2022-11-18 20:43:45,696 INFO L131 PetriNetUnfolder]: For 756/978 co-relation queries the response was YES. [2022-11-18 20:43:45,707 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-18 20:43:45,716 INFO L137 encePairwiseOnDemand]: 297/303 looper letters, 11 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2022-11-18 20:43:45,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 293 transitions, 839 flow [2022-11-18 20:43:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1262 transitions. [2022-11-18 20:43:45,721 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.833003300330033 [2022-11-18 20:43:45,721 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1262 transitions. [2022-11-18 20:43:45,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1262 transitions. [2022-11-18 20:43:45,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:45,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1262 transitions. [2022-11-18 20:43:45,727 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-18 20:43:45,731 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-18 20:43:45,732 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-18 20:43:45,732 INFO L175 Difference]: Start difference. First operand has 289 places, 293 transitions, 803 flow. Second operand 5 states and 1262 transitions. [2022-11-18 20:43:45,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 293 transitions, 839 flow [2022-11-18 20:43:45,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:43:45,747 INFO L231 Difference]: Finished difference. Result has 292 places, 293 transitions, 822 flow [2022-11-18 20:43:45,747 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-18 20:43:45,748 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 27 predicate places. [2022-11-18 20:43:45,748 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 293 transitions, 822 flow [2022-11-18 20:43:45,749 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-18 20:43:45,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:45,750 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-18 20:43:45,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:43:45,750 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-18 20:43:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash -111574750, now seen corresponding path program 1 times [2022-11-18 20:43:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867166082] [2022-11-18 20:43:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:45,940 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-18 20:43:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:45,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867166082] [2022-11-18 20:43:45,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867166082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:45,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186509509] [2022-11-18 20:43:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:45,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:45,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:45,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:45,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:43:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:46,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:43:46,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:46,196 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-18 20:43:46,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:43:46,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186509509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:46,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:43:46,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 20:43:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518574863] [2022-11-18 20:43:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:46,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:46,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:46,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:43:46,202 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 20:43:46,204 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-18 20:43:46,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:46,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 20:43:46,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:46,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-18 20:43:46,499 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 20:43:46,500 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 20:43:46,500 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:43:46,500 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:43:46,583 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-18 20:43:46,583 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 20:43:46,584 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:43:46,584 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:43:46,584 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:43:46,689 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-18 20:43:46,690 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-18 20:43:46,690 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:43:46,690 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:43:46,690 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:43:46,700 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-18 20:43:46,701 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:43:46,701 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:43:46,701 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:43:46,701 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:43:46,702 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:43:46,702 INFO L130 PetriNetUnfolder]: 132/1588 cut-off events. [2022-11-18 20:43:46,703 INFO L131 PetriNetUnfolder]: For 763/975 co-relation queries the response was YES. [2022-11-18 20:43:46,711 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-18 20:43:46,719 INFO L137 encePairwiseOnDemand]: 299/303 looper letters, 13 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2022-11-18 20:43:46,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 854 flow [2022-11-18 20:43:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:43:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:43:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1011 transitions. [2022-11-18 20:43:46,722 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2022-11-18 20:43:46,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1011 transitions. [2022-11-18 20:43:46,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1011 transitions. [2022-11-18 20:43:46,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:46,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1011 transitions. [2022-11-18 20:43:46,726 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-18 20:43:46,729 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-18 20:43:46,729 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-18 20:43:46,730 INFO L175 Difference]: Start difference. First operand has 292 places, 293 transitions, 822 flow. Second operand 4 states and 1011 transitions. [2022-11-18 20:43:46,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 854 flow [2022-11-18 20:43:46,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 292 transitions, 842 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:43:46,743 INFO L231 Difference]: Finished difference. Result has 291 places, 292 transitions, 816 flow [2022-11-18 20:43:46,744 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-18 20:43:46,745 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, 26 predicate places. [2022-11-18 20:43:46,745 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 816 flow [2022-11-18 20:43:46,746 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-18 20:43:46,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:46,746 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-18 20:43:46,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:46,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:46,947 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-18 20:43:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:46,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1577907406, now seen corresponding path program 1 times [2022-11-18 20:43:46,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:46,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975330487] [2022-11-18 20:43:46,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:47,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:47,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975330487] [2022-11-18 20:43:47,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975330487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:43:47,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593402375] [2022-11-18 20:43:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:47,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:43:47,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:43:47,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:43:47,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:43:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:47,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:43:47,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:43:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:47,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:43:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:47,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593402375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:43:47,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:43:47,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 20:43:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892325297] [2022-11-18 20:43:47,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:43:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:43:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:43:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:43:47,327 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2022-11-18 20:43:47,330 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-18 20:43:47,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:47,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2022-11-18 20:43:47,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:47,463 INFO L130 PetriNetUnfolder]: 3/307 cut-off events. [2022-11-18 20:43:47,463 INFO L131 PetriNetUnfolder]: For 66/70 co-relation queries the response was YES. [2022-11-18 20:43:47,465 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-18 20:43:47,466 INFO L137 encePairwiseOnDemand]: 298/303 looper letters, 13 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2022-11-18 20:43:47,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 204 transitions, 588 flow [2022-11-18 20:43:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:43:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:43:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2263 transitions. [2022-11-18 20:43:47,472 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8298496516318299 [2022-11-18 20:43:47,472 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2263 transitions. [2022-11-18 20:43:47,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2263 transitions. [2022-11-18 20:43:47,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:47,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2263 transitions. [2022-11-18 20:43:47,480 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-18 20:43:47,486 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-18 20:43:47,487 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-18 20:43:47,487 INFO L175 Difference]: Start difference. First operand has 291 places, 292 transitions, 816 flow. Second operand 9 states and 2263 transitions. [2022-11-18 20:43:47,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 204 transitions, 588 flow [2022-11-18 20:43:47,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 548 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-11-18 20:43:47,493 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 510 flow [2022-11-18 20:43:47,494 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-18 20:43:47,495 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -49 predicate places. [2022-11-18 20:43:47,495 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 510 flow [2022-11-18 20:43:47,496 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-18 20:43:47,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:47,496 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-18 20:43:47,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:43:47,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:43:47,702 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-18 20:43:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash 986756205, now seen corresponding path program 1 times [2022-11-18 20:43:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:47,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866864650] [2022-11-18 20:43:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:47,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866864650] [2022-11-18 20:43:47,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866864650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:47,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:47,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:43:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875757030] [2022-11-18 20:43:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:47,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:43:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:43:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:47,926 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 303 [2022-11-18 20:43:47,927 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-18 20:43:47,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:47,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 303 [2022-11-18 20:43:47,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:49,035 INFO L130 PetriNetUnfolder]: 1007/3723 cut-off events. [2022-11-18 20:43:49,036 INFO L131 PetriNetUnfolder]: For 705/730 co-relation queries the response was YES. [2022-11-18 20:43:49,051 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-18 20:43:49,068 INFO L137 encePairwiseOnDemand]: 289/303 looper letters, 132 selfloop transitions, 32 changer transitions 0/299 dead transitions. [2022-11-18 20:43:49,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 299 transitions, 1146 flow [2022-11-18 20:43:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:43:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:43:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2367 transitions. [2022-11-18 20:43:49,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7101710171017102 [2022-11-18 20:43:49,078 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2367 transitions. [2022-11-18 20:43:49,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2367 transitions. [2022-11-18 20:43:49,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:49,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2367 transitions. [2022-11-18 20:43:49,088 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-18 20:43:49,096 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-18 20:43:49,098 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-18 20:43:49,098 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 510 flow. Second operand 11 states and 2367 transitions. [2022-11-18 20:43:49,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 299 transitions, 1146 flow [2022-11-18 20:43:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 299 transitions, 1123 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-11-18 20:43:49,110 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 730 flow [2022-11-18 20:43:49,111 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-18 20:43:49,112 INFO L288 CegarLoopForPetriNet]: 265 programPoint places, -40 predicate places. [2022-11-18 20:43:49,112 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 730 flow [2022-11-18 20:43:49,113 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-18 20:43:49,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:49,113 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-18 20:43:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:43:49,114 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-18 20:43:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1978150363, now seen corresponding path program 1 times [2022-11-18 20:43:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:49,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061488663] [2022-11-18 20:43:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:43:49,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:43:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:43:49,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:43:49,195 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:43:49,196 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-18 20:43:49,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-18 20:43:49,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-18 20:43:49,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-18 20:43:49,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-18 20:43:49,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-18 20:43:49,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-18 20:43:49,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-18 20:43:49,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-18 20:43:49,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-18 20:43:49,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-18 20:43:49,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-18 20:43:49,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-18 20:43:49,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-18 20:43:49,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-18 20:43:49,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-18 20:43:49,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-18 20:43:49,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-18 20:43:49,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-18 20:43:49,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-18 20:43:49,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-18 20:43:49,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-18 20:43:49,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-18 20:43:49,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-18 20:43:49,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-18 20:43:49,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:43:49,204 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:43:49,205 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 20:43:49,205 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-18 20:43:49,262 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 20:43:49,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 370 transitions, 770 flow [2022-11-18 20:43:49,399 INFO L130 PetriNetUnfolder]: 106/722 cut-off events. [2022-11-18 20:43:49,399 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-18 20:43:49,407 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-18 20:43:49,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 370 transitions, 770 flow [2022-11-18 20:43:49,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 368 transitions, 766 flow [2022-11-18 20:43:49,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:43:49,420 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;@5b1458df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:43:49,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-18 20:43:49,424 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-11-18 20:43:49,425 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:43:49,425 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:49,425 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-18 20:43:49,425 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-18 20:43:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -721879760, now seen corresponding path program 1 times [2022-11-18 20:43:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660055846] [2022-11-18 20:43:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:49,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660055846] [2022-11-18 20:43:49,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660055846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:49,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:49,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:43:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030675122] [2022-11-18 20:43:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:49,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:43:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:49,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:43:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:43:49,510 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-18 20:43:49,512 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-18 20:43:49,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:49,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-18 20:43:49,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:49,850 INFO L130 PetriNetUnfolder]: 30/1181 cut-off events. [2022-11-18 20:43:49,850 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-11-18 20:43:49,863 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-18 20:43:49,870 INFO L137 encePairwiseOnDemand]: 315/370 looper letters, 19 selfloop transitions, 8 changer transitions 0/323 dead transitions. [2022-11-18 20:43:49,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 754 flow [2022-11-18 20:43:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:43:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:43:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2496 transitions. [2022-11-18 20:43:49,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8432432432432433 [2022-11-18 20:43:49,876 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2496 transitions. [2022-11-18 20:43:49,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2496 transitions. [2022-11-18 20:43:49,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:49,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2496 transitions. [2022-11-18 20:43:49,885 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-18 20:43:49,890 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-18 20:43:49,892 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-18 20:43:49,892 INFO L175 Difference]: Start difference. First operand has 321 places, 368 transitions, 766 flow. Second operand 8 states and 2496 transitions. [2022-11-18 20:43:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 754 flow [2022-11-18 20:43:49,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:43:49,898 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 680 flow [2022-11-18 20:43:49,899 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-18 20:43:49,900 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 2 predicate places. [2022-11-18 20:43:49,900 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 680 flow [2022-11-18 20:43:49,901 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-18 20:43:49,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:49,901 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-18 20:43:49,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:43:49,902 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-18 20:43:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash -721889790, now seen corresponding path program 1 times [2022-11-18 20:43:49,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:49,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066718885] [2022-11-18 20:43:49,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:49,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066718885] [2022-11-18 20:43:49,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066718885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:49,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:49,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530611123] [2022-11-18 20:43:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:49,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:49,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:49,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:49,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-18 20:43:49,957 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-18 20:43:49,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:49,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-18 20:43:49,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:50,289 INFO L130 PetriNetUnfolder]: 30/1180 cut-off events. [2022-11-18 20:43:50,290 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-11-18 20:43:50,300 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-18 20:43:50,306 INFO L137 encePairwiseOnDemand]: 365/370 looper letters, 15 selfloop transitions, 4 changer transitions 0/316 dead transitions. [2022-11-18 20:43:50,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 316 transitions, 716 flow [2022-11-18 20:43:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1515 transitions. [2022-11-18 20:43:50,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8189189189189189 [2022-11-18 20:43:50,312 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1515 transitions. [2022-11-18 20:43:50,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1515 transitions. [2022-11-18 20:43:50,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:50,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1515 transitions. [2022-11-18 20:43:50,315 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-18 20:43:50,319 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-18 20:43:50,320 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-18 20:43:50,320 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 680 flow. Second operand 5 states and 1515 transitions. [2022-11-18 20:43:50,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 316 transitions, 716 flow [2022-11-18 20:43:50,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 700 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-18 20:43:50,327 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 670 flow [2022-11-18 20:43:50,329 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-18 20:43:50,329 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-18 20:43:50,330 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 670 flow [2022-11-18 20:43:50,331 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-18 20:43:50,331 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:50,332 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-18 20:43:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:43:50,332 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-18 20:43:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash -903434981, now seen corresponding path program 1 times [2022-11-18 20:43:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:50,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426040829] [2022-11-18 20:43:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:50,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426040829] [2022-11-18 20:43:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426040829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:50,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:50,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:43:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35874975] [2022-11-18 20:43:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:50,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:43:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:43:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:43:50,400 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 370 [2022-11-18 20:43:50,401 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-18 20:43:50,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:50,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 370 [2022-11-18 20:43:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:50,755 INFO L130 PetriNetUnfolder]: 30/1179 cut-off events. [2022-11-18 20:43:50,755 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-11-18 20:43:50,771 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-18 20:43:50,779 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 20 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-18 20:43:50,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 756 flow [2022-11-18 20:43:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:43:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:43:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1809 transitions. [2022-11-18 20:43:50,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8148648648648649 [2022-11-18 20:43:50,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1809 transitions. [2022-11-18 20:43:50,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1809 transitions. [2022-11-18 20:43:50,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:50,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1809 transitions. [2022-11-18 20:43:50,788 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-18 20:43:50,793 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-18 20:43:50,794 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-18 20:43:50,795 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 670 flow. Second operand 6 states and 1809 transitions. [2022-11-18 20:43:50,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 756 flow [2022-11-18 20:43:50,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 748 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:43:50,803 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 672 flow [2022-11-18 20:43:50,803 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-18 20:43:50,804 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2022-11-18 20:43:50,804 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 672 flow [2022-11-18 20:43:50,805 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-18 20:43:50,805 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:50,806 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-18 20:43:50,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:43:50,806 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-18 20:43:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -903745832, now seen corresponding path program 1 times [2022-11-18 20:43:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:50,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716705183] [2022-11-18 20:43:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:50,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716705183] [2022-11-18 20:43:50,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716705183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:50,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:50,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028285209] [2022-11-18 20:43:50,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:50,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:50,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 370 [2022-11-18 20:43:50,866 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-18 20:43:50,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:50,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 370 [2022-11-18 20:43:50,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:51,179 INFO L130 PetriNetUnfolder]: 30/1178 cut-off events. [2022-11-18 20:43:51,179 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-11-18 20:43:51,193 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-18 20:43:51,200 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 21 selfloop transitions, 3 changer transitions 0/320 dead transitions. [2022-11-18 20:43:51,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 754 flow [2022-11-18 20:43:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:43:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:43:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1221 transitions. [2022-11-18 20:43:51,203 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-18 20:43:51,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1221 transitions. [2022-11-18 20:43:51,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1221 transitions. [2022-11-18 20:43:51,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:51,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1221 transitions. [2022-11-18 20:43:51,206 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-18 20:43:51,211 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-18 20:43:51,212 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-18 20:43:51,212 INFO L175 Difference]: Start difference. First operand has 319 places, 315 transitions, 672 flow. Second operand 4 states and 1221 transitions. [2022-11-18 20:43:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 754 flow [2022-11-18 20:43:51,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:43:51,220 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 664 flow [2022-11-18 20:43:51,220 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-18 20:43:51,221 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2022-11-18 20:43:51,221 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 664 flow [2022-11-18 20:43:51,222 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-18 20:43:51,222 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:51,222 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-18 20:43:51,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:43:51,223 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-18 20:43:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1242822097, now seen corresponding path program 1 times [2022-11-18 20:43:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632272761] [2022-11-18 20:43:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:51,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:51,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632272761] [2022-11-18 20:43:51,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632272761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:51,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:51,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:43:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800527170] [2022-11-18 20:43:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:51,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:43:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:43:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:43:51,345 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 20:43:51,347 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-18 20:43:51,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:51,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 20:43:51,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:43:51,736 INFO L130 PetriNetUnfolder]: 26/1070 cut-off events. [2022-11-18 20:43:51,736 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-18 20:43:51,749 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-18 20:43:51,756 INFO L137 encePairwiseOnDemand]: 363/370 looper letters, 21 selfloop transitions, 4 changer transitions 0/321 dead transitions. [2022-11-18 20:43:51,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 728 flow [2022-11-18 20:43:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:43:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:43:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-11-18 20:43:51,761 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8313513513513513 [2022-11-18 20:43:51,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1538 transitions. [2022-11-18 20:43:51,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1538 transitions. [2022-11-18 20:43:51,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:43:51,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1538 transitions. [2022-11-18 20:43:51,765 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-18 20:43:51,769 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-18 20:43:51,770 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-18 20:43:51,770 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 664 flow. Second operand 5 states and 1538 transitions. [2022-11-18 20:43:51,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 728 flow [2022-11-18 20:43:51,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:43:51,779 INFO L231 Difference]: Finished difference. Result has 320 places, 317 transitions, 690 flow [2022-11-18 20:43:51,780 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-18 20:43:51,781 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2022-11-18 20:43:51,781 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 690 flow [2022-11-18 20:43:51,782 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-18 20:43:51,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:43:51,782 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-18 20:43:51,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:43:51,783 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-18 20:43:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:43:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 96355770, now seen corresponding path program 1 times [2022-11-18 20:43:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:43:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120285386] [2022-11-18 20:43:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:43:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:43:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:43:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:43:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:43:52,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120285386] [2022-11-18 20:43:52,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120285386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:43:52,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:43:52,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:43:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778545406] [2022-11-18 20:43:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:43:52,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:43:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:43:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:43:52,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:43:52,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 370 [2022-11-18 20:43:52,146 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-18 20:43:52,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:43:52,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 370 [2022-11-18 20:43:52,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:44:17,925 INFO L130 PetriNetUnfolder]: 55076/140729 cut-off events. [2022-11-18 20:44:17,926 INFO L131 PetriNetUnfolder]: For 2572/2572 co-relation queries the response was YES. [2022-11-18 20:44:18,557 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-18 20:44:19,654 INFO L137 encePairwiseOnDemand]: 354/370 looper letters, 315 selfloop transitions, 38 changer transitions 0/593 dead transitions. [2022-11-18 20:44:19,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 593 transitions, 2054 flow [2022-11-18 20:44:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:44:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:44:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4249 transitions. [2022-11-18 20:44:19,669 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7177364864864865 [2022-11-18 20:44:19,669 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4249 transitions. [2022-11-18 20:44:19,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4249 transitions. [2022-11-18 20:44:19,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:44:19,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4249 transitions. [2022-11-18 20:44:19,681 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-18 20:44:19,691 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-18 20:44:19,694 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-18 20:44:19,694 INFO L175 Difference]: Start difference. First operand has 320 places, 317 transitions, 690 flow. Second operand 16 states and 4249 transitions. [2022-11-18 20:44:19,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 593 transitions, 2054 flow [2022-11-18 20:44:19,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 593 transitions, 2052 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:44:19,709 INFO L231 Difference]: Finished difference. Result has 344 places, 354 transitions, 969 flow [2022-11-18 20:44:19,710 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-18 20:44:19,711 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 23 predicate places. [2022-11-18 20:44:19,711 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 354 transitions, 969 flow [2022-11-18 20:44:19,712 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-18 20:44:19,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:44:19,712 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-18 20:44:19,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:44:19,713 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-18 20:44:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash -836580835, now seen corresponding path program 1 times [2022-11-18 20:44:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:44:19,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934108986] [2022-11-18 20:44:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:44:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:19,790 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-18 20:44:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:44:19,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934108986] [2022-11-18 20:44:19,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934108986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:44:19,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:44:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:44:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887257227] [2022-11-18 20:44:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:44:19,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:44:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:44:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:44:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:44:19,797 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 20:44:19,799 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-18 20:44:19,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:44:19,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 20:44:19,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:44:20,214 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-18 20:44:20,215 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 20:44:20,215 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:44:20,215 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 20:44:20,215 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:44:20,383 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-18 20:44:20,383 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 20:44:20,383 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:44:20,384 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:20,384 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:20,583 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-18 20:44:20,583 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-18 20:44:20,583 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 20:44:20,584 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:20,584 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 20:44:20,940 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-18 20:44:20,940 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-18 20:44:20,940 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:44:20,940 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:20,940 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:44:21,053 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-18 20:44:21,053 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,053 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:21,053 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:21,053 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,059 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-18 20:44:21,059 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,060 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:21,060 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:21,060 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,064 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-18 20:44:21,065 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,065 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:21,065 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:44:21,065 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:21,067 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-18 20:44:21,067 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,067 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:21,067 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:44:21,067 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:44:21,068 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:21,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_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-18 20:44:21,127 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 20:44:21,127 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 20:44:21,127 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:21,127 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:21,135 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-18 20:44:21,135 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-18 20:44:21,135 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 20:44:21,136 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-18 20:44:21,136 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 20:44:21,140 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-18 20:44:21,140 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-18 20:44:21,140 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:44:21,140 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:44:21,140 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:44:21,147 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-18 20:44:21,148 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-18 20:44:21,148 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:21,148 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:21,148 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,148 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:21,150 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-18 20:44:21,150 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-18 20:44:21,150 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:21,150 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:21,150 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:44:21,150 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:44:21,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[][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-18 20:44:21,159 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 20:44:21,159 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:21,160 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:21,160 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:21,162 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-18 20:44:21,162 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 20:44:21,162 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:21,162 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:21,163 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:21,204 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-18 20:44:21,204 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:21,204 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:21,204 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:44:21,204 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:21,205 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-18 20:44:21,205 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:21,205 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:21,205 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:21,205 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:21,207 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-18 20:44:21,207 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:21,207 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:21,207 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:21,207 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:21,207 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 20:44:21,214 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-18 20:44:21,214 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-18 20:44:21,214 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:21,215 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 20:44:21,215 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:21,218 INFO L130 PetriNetUnfolder]: 573/5045 cut-off events. [2022-11-18 20:44:21,218 INFO L131 PetriNetUnfolder]: For 3183/4289 co-relation queries the response was YES. [2022-11-18 20:44:21,254 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-18 20:44:21,289 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 13 selfloop transitions, 8 changer transitions 0/354 dead transitions. [2022-11-18 20:44:21,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 354 transitions, 1009 flow [2022-11-18 20:44:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:44:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:44:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1529 transitions. [2022-11-18 20:44:21,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8264864864864865 [2022-11-18 20:44:21,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1529 transitions. [2022-11-18 20:44:21,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1529 transitions. [2022-11-18 20:44:21,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:44:21,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1529 transitions. [2022-11-18 20:44:21,297 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-18 20:44:21,300 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-18 20:44:21,301 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-18 20:44:21,301 INFO L175 Difference]: Start difference. First operand has 344 places, 354 transitions, 969 flow. Second operand 5 states and 1529 transitions. [2022-11-18 20:44:21,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 354 transitions, 1009 flow [2022-11-18 20:44:21,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 1008 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:44:21,320 INFO L231 Difference]: Finished difference. Result has 347 places, 354 transitions, 988 flow [2022-11-18 20:44:21,320 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-18 20:44:21,321 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 26 predicate places. [2022-11-18 20:44:21,321 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 354 transitions, 988 flow [2022-11-18 20:44:21,322 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-18 20:44:21,322 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:44:21,322 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-18 20:44:21,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:44:21,322 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-18 20:44:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash -164200905, now seen corresponding path program 1 times [2022-11-18 20:44:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:44:21,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926536354] [2022-11-18 20:44:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:44:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:21,422 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-18 20:44:21,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:44:21,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926536354] [2022-11-18 20:44:21,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926536354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:44:21,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750845692] [2022-11-18 20:44:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:21,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:44:21,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:44:21,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:44:21,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:44:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:21,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:44:21,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:44:21,638 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-18 20:44:21,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:44:21,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750845692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:44:21,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:44:21,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-18 20:44:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080568467] [2022-11-18 20:44:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:44:21,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:44:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:44:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:44:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:44:21,644 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 20:44:21,645 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-18 20:44:21,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:44:21,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 20:44:21,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:44:22,004 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-18 20:44:22,005 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is not cut-off event [2022-11-18 20:44:22,005 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:44:22,005 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:44:22,005 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is not cut-off event [2022-11-18 20:44:22,211 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-18 20:44:22,211 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-18 20:44:22,211 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:22,211 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:22,211 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-18 20:44:22,426 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-18 20:44:22,426 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-18 20:44:22,426 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:22,426 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 20:44:22,427 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 20:44:22,587 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-18 20:44:22,588 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-18 20:44:22,588 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:22,588 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:44:22,588 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-18 20:44:22,752 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-18 20:44:22,753 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:22,753 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:22,753 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:22,753 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:22,761 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-18 20:44:22,761 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:22,762 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:22,762 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:22,762 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:22,769 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-18 20:44:22,769 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:22,769 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:22,769 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:44:22,770 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:22,772 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-18 20:44:22,772 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:22,773 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:22,773 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:22,773 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:44:22,773 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-18 20:44:23,018 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-18 20:44:23,019 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 20:44:23,019 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:23,019 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 20:44:23,019 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:23,026 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-18 20:44:23,027 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-18 20:44:23,027 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 20:44:23,027 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-18 20:44:23,027 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 20:44:23,031 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-18 20:44:23,031 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-18 20:44:23,031 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:44:23,031 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:44:23,032 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:44:23,037 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-18 20:44:23,037 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-18 20:44:23,037 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:23,038 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:23,038 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:23,038 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:23,039 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-18 20:44:23,039 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-18 20:44:23,039 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:23,039 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:44:23,039 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:44:23,039 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:44:23,048 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-18 20:44:23,048 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 20:44:23,048 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:23,048 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:23,049 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:23,050 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-18 20:44:23,050 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 20:44:23,050 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:23,050 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:23,050 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:23,080 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-18 20:44:23,080 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:23,080 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:23,080 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:44:23,080 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:23,080 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-18 20:44:23,080 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:23,080 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:23,080 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:23,080 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:23,082 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-18 20:44:23,082 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:23,082 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 20:44:23,082 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:23,082 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:23,082 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:44:23,087 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-18 20:44:23,087 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-18 20:44:23,099 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 20:44:23,100 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:23,100 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:23,103 INFO L130 PetriNetUnfolder]: 573/5043 cut-off events. [2022-11-18 20:44:23,103 INFO L131 PetriNetUnfolder]: For 3192/4258 co-relation queries the response was YES. [2022-11-18 20:44:23,151 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-18 20:44:23,184 INFO L137 encePairwiseOnDemand]: 366/370 looper letters, 15 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2022-11-18 20:44:23,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 1024 flow [2022-11-18 20:44:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:44:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-18 20:44:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1225 transitions. [2022-11-18 20:44:23,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8277027027027027 [2022-11-18 20:44:23,187 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1225 transitions. [2022-11-18 20:44:23,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1225 transitions. [2022-11-18 20:44:23,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:44:23,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1225 transitions. [2022-11-18 20:44:23,191 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-18 20:44:23,193 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-18 20:44:23,194 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-18 20:44:23,194 INFO L175 Difference]: Start difference. First operand has 347 places, 354 transitions, 988 flow. Second operand 4 states and 1225 transitions. [2022-11-18 20:44:23,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 1024 flow [2022-11-18 20:44:23,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 353 transitions, 1012 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:44:23,213 INFO L231 Difference]: Finished difference. Result has 346 places, 353 transitions, 982 flow [2022-11-18 20:44:23,213 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-18 20:44:23,214 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 25 predicate places. [2022-11-18 20:44:23,215 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 353 transitions, 982 flow [2022-11-18 20:44:23,215 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-18 20:44:23,215 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:44:23,216 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-18 20:44:23,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:44:23,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-18 20:44:23,422 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-18 20:44:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2069422248, now seen corresponding path program 1 times [2022-11-18 20:44:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:44:23,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578877087] [2022-11-18 20:44:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:44:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:44:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:44:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578877087] [2022-11-18 20:44:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578877087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:44:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445081436] [2022-11-18 20:44:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:44:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:44:23,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:44:23,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:44:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:23,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:44:23,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:44:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:44:23,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:44:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:44:23,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445081436] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:44:23,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:44:23,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 20:44:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898331805] [2022-11-18 20:44:23,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:44:23,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:44:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:44:23,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:44:23,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:44:23,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 370 [2022-11-18 20:44:23,769 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-18 20:44:23,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:44:23,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 370 [2022-11-18 20:44:23,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:44:24,303 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-18 20:44:24,303 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-11-18 20:44:24,303 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 20:44:24,304 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-11-18 20:44:24,304 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is not cut-off event [2022-11-18 20:44:24,550 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-18 20:44:24,551 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:24,551 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:24,551 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:24,551 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:24,552 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-18 20:44:24,553 INFO L383 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-11-18 20:44:24,553 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:24,553 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-11-18 20:44:24,553 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:44:24,562 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-18 20:44:24,562 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,562 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,562 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,562 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,650 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-18 20:44:24,651 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 20:44:24,651 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:24,651 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 20:44:24,651 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:24,654 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-18 20:44:24,654 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 20:44:24,654 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:24,655 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:24,655 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 20:44:24,661 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-18 20:44:24,661 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is not cut-off event [2022-11-18 20:44:24,661 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:24,661 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-11-18 20:44:24,661 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is not cut-off event [2022-11-18 20:44:24,682 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-18 20:44:24,682 INFO L383 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,682 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,682 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,682 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,682 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,716 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-18 20:44:24,716 INFO L383 tUnfolder$Statistics]: this new event has 194 ancestors and is not cut-off event [2022-11-18 20:44:24,716 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-18 20:44:24,716 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-11-18 20:44:24,716 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-18 20:44:24,721 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-18 20:44:24,721 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-18 20:44:24,721 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-18 20:44:24,721 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-18 20:44:24,721 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-18 20:44:24,753 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-18 20:44:24,754 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:24,754 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,754 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,754 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,754 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-18 20:44:24,754 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:24,754 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,754 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,754 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,756 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-18 20:44:24,757 INFO L383 tUnfolder$Statistics]: this new event has 222 ancestors and is cut-off event [2022-11-18 20:44:24,757 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,757 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 20:44:24,757 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-11-18 20:44:24,757 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 20:44:24,769 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-18 20:44:24,769 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-18 20:44:24,769 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:24,769 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 20:44:24,770 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:24,770 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-18 20:44:24,770 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-18 20:44:24,770 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 20:44:24,770 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:24,770 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:24,777 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-18 20:44:24,778 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-18 20:44:24,778 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-18 20:44:24,778 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is not cut-off event [2022-11-18 20:44:24,778 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-18 20:44:24,788 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-18 20:44:24,788 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-18 20:44:24,788 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 20:44:24,788 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:24,788 INFO L386 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-11-18 20:44:24,788 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-18 20:44:24,789 INFO L130 PetriNetUnfolder]: 495/4208 cut-off events. [2022-11-18 20:44:24,789 INFO L131 PetriNetUnfolder]: For 2937/3413 co-relation queries the response was YES. [2022-11-18 20:44:24,829 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-18 20:44:24,856 INFO L137 encePairwiseOnDemand]: 364/370 looper letters, 22 selfloop transitions, 9 changer transitions 0/364 dead transitions. [2022-11-18 20:44:24,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 364 transitions, 1082 flow [2022-11-18 20:44:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:44:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:44:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2751 transitions. [2022-11-18 20:44:24,861 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261261261261261 [2022-11-18 20:44:24,861 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2751 transitions. [2022-11-18 20:44:24,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2751 transitions. [2022-11-18 20:44:24,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:44:24,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2751 transitions. [2022-11-18 20:44:24,868 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-18 20:44:24,872 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-18 20:44:24,874 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-18 20:44:24,874 INFO L175 Difference]: Start difference. First operand has 346 places, 353 transitions, 982 flow. Second operand 9 states and 2751 transitions. [2022-11-18 20:44:24,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 364 transitions, 1082 flow [2022-11-18 20:44:24,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 364 transitions, 1068 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:44:24,896 INFO L231 Difference]: Finished difference. Result has 355 places, 357 transitions, 1028 flow [2022-11-18 20:44:24,896 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-18 20:44:24,897 INFO L288 CegarLoopForPetriNet]: 321 programPoint places, 34 predicate places. [2022-11-18 20:44:24,897 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 357 transitions, 1028 flow [2022-11-18 20:44:24,898 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-18 20:44:24,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:44:24,899 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-18 20:44:24,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:44:25,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8e0dc65-df3d-4b1e-9858-de519a79ebbb/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-18 20:44:25,105 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-18 20:44:25,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:44:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash 869056805, now seen corresponding path program 1 times [2022-11-18 20:44:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:44:25,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265809171] [2022-11-18 20:44:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:44:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:44:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:44:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:44:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:44:25,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265809171] [2022-11-18 20:44:25,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265809171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:44:25,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:44:25,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:44:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666108889] [2022-11-18 20:44:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:44:25,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:44:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:44:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:44:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:44:25,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 370 [2022-11-18 20:44:25,274 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-18 20:44:25,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:44:25,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 370 [2022-11-18 20:44:25,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand