./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:51:49,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:51:49,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:51:49,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:51:49,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:51:49,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:51:49,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:51:49,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:51:49,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:51:49,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:51:49,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:51:49,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:51:49,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:51:49,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:51:49,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:51:49,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:51:49,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:51:49,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:51:49,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:51:49,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:51:49,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:51:49,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:51:49,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:51:49,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:51:49,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:51:49,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:51:49,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:51:49,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:51:49,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:51:49,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:51:49,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:51:49,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:51:49,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:51:49,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:51:49,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:51:49,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:51:49,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:51:49,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:51:49,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:51:49,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:51:49,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:51:49,896 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 10:51:49,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:51:49,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:51:49,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:51:49,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:51:49,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:51:49,942 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:51:49,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:51:49,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:51:49,943 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:51:49,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:51:49,945 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:51:49,945 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:51:49,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:51:49,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:51:49,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:51:49,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:51:49,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:51:49,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:51:49,946 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:51:49,946 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:51:49,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:51:49,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:51:49,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:51:49,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:51:49,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:51:49,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:51:49,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:49,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:51:49,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:51:49,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:51:49,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:51:49,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:51:49,950 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:51:49,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:51:49,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:51:49,950 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_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2022-11-20 10:51:50,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:51:50,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:51:50,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:51:50,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:51:50,263 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:51:50,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-11-20 10:51:53,419 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:51:53,785 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:51:53,786 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-11-20 10:51:53,807 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/data/046f52d2e/57e5d560939b4168acacc66b71de4904/FLAG4328058b9 [2022-11-20 10:51:53,825 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/data/046f52d2e/57e5d560939b4168acacc66b71de4904 [2022-11-20 10:51:53,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:51:53,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:51:53,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:51:53,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:51:53,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:51:53,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:51:53" (1/1) ... [2022-11-20 10:51:53,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccaaa3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:53, skipping insertion in model container [2022-11-20 10:51:53,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:51:53" (1/1) ... [2022-11-20 10:51:53,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:51:53,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:51:54,445 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-11-20 10:51:54,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:51:54,522 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:51:54,578 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-11-20 10:51:54,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:51:54,685 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:51:54,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54 WrapperNode [2022-11-20 10:51:54,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:51:54,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:51:54,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:51:54,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:51:54,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,772 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 211 [2022-11-20 10:51:54,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:51:54,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:51:54,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:51:54,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:51:54,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,840 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:51:54,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:51:54,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:51:54,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:51:54,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (1/1) ... [2022-11-20 10:51:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:51:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:51:54,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:51:54,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:51:54,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:51:54,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:51:54,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:51:54,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:51:54,948 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 10:51:54,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:51:54,949 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-20 10:51:54,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-20 10:51:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:51:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:51:54,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:51:54,953 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:51:55,200 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:51:55,202 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:51:55,719 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:51:55,731 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:51:55,731 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2022-11-20 10:51:55,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:55 BoogieIcfgContainer [2022-11-20 10:51:55,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:51:55,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:51:55,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:51:55,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:51:55,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:51:53" (1/3) ... [2022-11-20 10:51:55,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608b0a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:51:55, skipping insertion in model container [2022-11-20 10:51:55,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:51:54" (2/3) ... [2022-11-20 10:51:55,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608b0a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:51:55, skipping insertion in model container [2022-11-20 10:51:55,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:51:55" (3/3) ... [2022-11-20 10:51:55,754 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-11-20 10:51:55,765 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:51:55,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:51:55,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-20 10:51:55,779 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:51:55,973 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 10:51:56,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 234 transitions, 476 flow [2022-11-20 10:51:56,119 INFO L130 PetriNetUnfolder]: 49/329 cut-off events. [2022-11-20 10:51:56,119 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 10:51:56,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 329 events. 49/329 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1296 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 186. Up to 8 conditions per place. [2022-11-20 10:51:56,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 234 transitions, 476 flow [2022-11-20 10:51:56,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 231 transitions, 470 flow [2022-11-20 10:51:56,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:51:56,154 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;@34f1807c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:51:56,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-20 10:51:56,167 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 10:51:56,171 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:51:56,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:56,172 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:56,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:51:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1098507437, now seen corresponding path program 1 times [2022-11-20 10:51:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:56,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701115456] [2022-11-20 10:51:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:56,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-20 10:51:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:56,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701115456] [2022-11-20 10:51:56,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701115456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:56,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:56,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:51:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411367108] [2022-11-20 10:51:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:56,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:51:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:51:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:51:56,565 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:51:56,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 231 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:56,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:51:56,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:51:56,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:51:56,769 INFO L130 PetriNetUnfolder]: 7/289 cut-off events. [2022-11-20 10:51:56,769 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 10:51:56,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 289 events. 7/289 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1011 event pairs, 0 based on Foata normal form. 40/292 useless extension candidates. Maximal degree in co-relation 160. Up to 15 conditions per place. [2022-11-20 10:51:56,774 INFO L137 encePairwiseOnDemand]: 200/234 looper letters, 17 selfloop transitions, 4 changer transitions 0/209 dead transitions. [2022-11-20 10:51:56,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 209 transitions, 468 flow [2022-11-20 10:51:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:51:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:51:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2022-11-20 10:51:56,805 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8606837606837607 [2022-11-20 10:51:56,806 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1007 transitions. [2022-11-20 10:51:56,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1007 transitions. [2022-11-20 10:51:56,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:51:56,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1007 transitions. [2022-11-20 10:51:56,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:56,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:56,856 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:56,858 INFO L175 Difference]: Start difference. First operand has 202 places, 231 transitions, 470 flow. Second operand 5 states and 1007 transitions. [2022-11-20 10:51:56,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 209 transitions, 468 flow [2022-11-20 10:51:56,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 209 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:51:56,893 INFO L231 Difference]: Finished difference. Result has 207 places, 205 transitions, 444 flow [2022-11-20 10:51:56,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=444, PETRI_PLACES=207, PETRI_TRANSITIONS=205} [2022-11-20 10:51:56,904 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 5 predicate places. [2022-11-20 10:51:56,904 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 205 transitions, 444 flow [2022-11-20 10:51:56,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:56,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:56,907 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:56,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:51:56,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:51:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1410209178, now seen corresponding path program 1 times [2022-11-20 10:51:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294123112] [2022-11-20 10:51:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:51:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294123112] [2022-11-20 10:51:57,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294123112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:57,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:57,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:51:57,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477266769] [2022-11-20 10:51:57,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:57,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:51:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:57,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:51:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:51:57,108 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:51:57,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 205 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:51:57,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:51:57,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:51:57,222 INFO L130 PetriNetUnfolder]: 7/288 cut-off events. [2022-11-20 10:51:57,222 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-20 10:51:57,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 7/288 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1006 event pairs, 0 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 278. Up to 7 conditions per place. [2022-11-20 10:51:57,231 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 9 selfloop transitions, 8 changer transitions 0/205 dead transitions. [2022-11-20 10:51:57,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 205 transitions, 476 flow [2022-11-20 10:51:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:51:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:51:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 970 transitions. [2022-11-20 10:51:57,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8290598290598291 [2022-11-20 10:51:57,237 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 970 transitions. [2022-11-20 10:51:57,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 970 transitions. [2022-11-20 10:51:57,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:51:57,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 970 transitions. [2022-11-20 10:51:57,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,246 INFO L175 Difference]: Start difference. First operand has 207 places, 205 transitions, 444 flow. Second operand 5 states and 970 transitions. [2022-11-20 10:51:57,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 205 transitions, 476 flow [2022-11-20 10:51:57,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:51:57,262 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 462 flow [2022-11-20 10:51:57,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2022-11-20 10:51:57,264 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 8 predicate places. [2022-11-20 10:51:57,264 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 462 flow [2022-11-20 10:51:57,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:57,267 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:57,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:51:57,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:51:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -766810963, now seen corresponding path program 1 times [2022-11-20 10:51:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963302879] [2022-11-20 10:51:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:57,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:57,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963302879] [2022-11-20 10:51:57,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963302879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:51:57,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140890061] [2022-11-20 10:51:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:57,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:51:57,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:51:57,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:51:57,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:51:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:57,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:51:57,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:57,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:51:57,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140890061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:57,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:51:57,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:51:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778152549] [2022-11-20 10:51:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:57,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:51:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:51:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:51:57,645 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:51:57,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:51:57,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:51:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:51:57,755 INFO L130 PetriNetUnfolder]: 7/287 cut-off events. [2022-11-20 10:51:57,755 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-20 10:51:57,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 287 events. 7/287 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 998 event pairs, 0 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 276. Up to 10 conditions per place. [2022-11-20 10:51:57,759 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 11 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2022-11-20 10:51:57,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 490 flow [2022-11-20 10:51:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:51:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:51:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 777 transitions. [2022-11-20 10:51:57,762 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8301282051282052 [2022-11-20 10:51:57,762 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 777 transitions. [2022-11-20 10:51:57,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 777 transitions. [2022-11-20 10:51:57,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:51:57,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 777 transitions. [2022-11-20 10:51:57,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,769 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,769 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 462 flow. Second operand 4 states and 777 transitions. [2022-11-20 10:51:57,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 490 flow [2022-11-20 10:51:57,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 204 transitions, 478 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:51:57,785 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 456 flow [2022-11-20 10:51:57,786 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2022-11-20 10:51:57,788 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 7 predicate places. [2022-11-20 10:51:57,789 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 456 flow [2022-11-20 10:51:57,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:57,790 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:57,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:57,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 10:51:57,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:51:57,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:51:57,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash 666838021, now seen corresponding path program 1 times [2022-11-20 10:51:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430503741] [2022-11-20 10:51:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:58,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430503741] [2022-11-20 10:51:58,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430503741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:51:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868465390] [2022-11-20 10:51:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:58,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:51:58,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:51:58,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:51:58,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:51:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:58,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:51:58,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:58,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:51:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:51:58,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868465390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:51:58,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:51:58,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:51:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461153242] [2022-11-20 10:51:58,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:51:58,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:51:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:58,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:51:58,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:51:58,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:51:58,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 456 flow. Second operand has 10 states, 10 states have (on average 193.7) internal successors, (1937), 10 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:51:58,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:51:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:51:58,567 INFO L130 PetriNetUnfolder]: 7/295 cut-off events. [2022-11-20 10:51:58,567 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 10:51:58,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 295 events. 7/295 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 984 event pairs, 0 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 266. Up to 7 conditions per place. [2022-11-20 10:51:58,571 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 18 selfloop transitions, 9 changer transitions 0/215 dead transitions. [2022-11-20 10:51:58,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 215 transitions, 548 flow [2022-11-20 10:51:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:51:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:51:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1748 transitions. [2022-11-20 10:51:58,576 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8300094966761633 [2022-11-20 10:51:58,576 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1748 transitions. [2022-11-20 10:51:58,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1748 transitions. [2022-11-20 10:51:58,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:51:58,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1748 transitions. [2022-11-20 10:51:58,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.22222222222223) internal successors, (1748), 9 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,590 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,591 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 456 flow. Second operand 9 states and 1748 transitions. [2022-11-20 10:51:58,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 215 transitions, 548 flow [2022-11-20 10:51:58,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 215 transitions, 534 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:51:58,597 INFO L231 Difference]: Finished difference. Result has 218 places, 208 transitions, 502 flow [2022-11-20 10:51:58,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=218, PETRI_TRANSITIONS=208} [2022-11-20 10:51:58,599 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 16 predicate places. [2022-11-20 10:51:58,600 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 208 transitions, 502 flow [2022-11-20 10:51:58,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 193.7) internal successors, (1937), 10 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,602 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:58,602 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:58,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:51:58,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:51:58,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:51:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1312738843, now seen corresponding path program 2 times [2022-11-20 10:51:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:58,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028334765] [2022-11-20 10:51:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:51:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028334765] [2022-11-20 10:51:58,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028334765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:51:58,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:51:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:51:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038542661] [2022-11-20 10:51:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:51:58,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:51:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:51:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:51:58,901 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:51:58,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 208 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:51:58,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:51:58,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:51:58,981 INFO L130 PetriNetUnfolder]: 5/217 cut-off events. [2022-11-20 10:51:58,981 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-20 10:51:58,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 217 events. 5/217 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 508 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 200. Up to 7 conditions per place. [2022-11-20 10:51:58,984 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 10 selfloop transitions, 4 changer transitions 0/208 dead transitions. [2022-11-20 10:51:58,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 530 flow [2022-11-20 10:51:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:51:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:51:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2022-11-20 10:51:58,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2022-11-20 10:51:58,987 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 972 transitions. [2022-11-20 10:51:58,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 972 transitions. [2022-11-20 10:51:58,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:51:58,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 972 transitions. [2022-11-20 10:51:58,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:58,993 INFO L175 Difference]: Start difference. First operand has 218 places, 208 transitions, 502 flow. Second operand 5 states and 972 transitions. [2022-11-20 10:51:58,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 530 flow [2022-11-20 10:51:58,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 208 transitions, 514 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:51:59,000 INFO L231 Difference]: Finished difference. Result has 217 places, 206 transitions, 494 flow [2022-11-20 10:51:59,000 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-11-20 10:51:59,001 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 15 predicate places. [2022-11-20 10:51:59,001 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 494 flow [2022-11-20 10:51:59,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:59,001 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:59,002 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:59,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:51:59,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:51:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:51:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1868396089, now seen corresponding path program 1 times [2022-11-20 10:51:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:51:59,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145929405] [2022-11-20 10:51:59,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:59,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:51:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:51:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:51:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145929405] [2022-11-20 10:51:59,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145929405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:51:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051079342] [2022-11-20 10:51:59,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:51:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:51:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:51:59,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:51:59,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:51:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:51:59,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:51:59,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:51:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:51:59,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:51:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:51:59,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051079342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:51:59,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:51:59,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 10:51:59,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508881969] [2022-11-20 10:51:59,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:51:59,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:51:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:51:59,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:51:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:51:59,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:51:59,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 494 flow. Second operand has 18 states, 18 states have (on average 194.05555555555554) internal successors, (3493), 18 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:59,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:51:59,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:51:59,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:51:59,800 INFO L130 PetriNetUnfolder]: 5/245 cut-off events. [2022-11-20 10:51:59,800 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-20 10:51:59,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 245 events. 5/245 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 508 event pairs, 0 based on Foata normal form. 4/229 useless extension candidates. Maximal degree in co-relation 208. Up to 9 conditions per place. [2022-11-20 10:51:59,803 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 34 selfloop transitions, 21 changer transitions 0/241 dead transitions. [2022-11-20 10:51:59,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 241 transitions, 758 flow [2022-11-20 10:51:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:51:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:51:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4070 transitions. [2022-11-20 10:51:59,831 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8282458282458283 [2022-11-20 10:51:59,831 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4070 transitions. [2022-11-20 10:51:59,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4070 transitions. [2022-11-20 10:51:59,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:51:59,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4070 transitions. [2022-11-20 10:51:59,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 193.8095238095238) internal successors, (4070), 21 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:59,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 234.0) internal successors, (5148), 22 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:59,854 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 234.0) internal successors, (5148), 22 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:59,854 INFO L175 Difference]: Start difference. First operand has 217 places, 206 transitions, 494 flow. Second operand 21 states and 4070 transitions. [2022-11-20 10:51:59,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 241 transitions, 758 flow [2022-11-20 10:51:59,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 241 transitions, 750 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:51:59,860 INFO L231 Difference]: Finished difference. Result has 238 places, 219 transitions, 642 flow [2022-11-20 10:51:59,861 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=642, PETRI_PLACES=238, PETRI_TRANSITIONS=219} [2022-11-20 10:51:59,861 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 36 predicate places. [2022-11-20 10:51:59,862 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 219 transitions, 642 flow [2022-11-20 10:51:59,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 194.05555555555554) internal successors, (3493), 18 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:51:59,863 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:51:59,864 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:51:59,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:00,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:52:00,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:52:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 94796281, now seen corresponding path program 2 times [2022-11-20 10:52:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:00,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620834642] [2022-11-20 10:52:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:52:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620834642] [2022-11-20 10:52:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620834642] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050134126] [2022-11-20 10:52:00,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:52:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:00,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:00,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:52:00,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:52:00,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:00,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:52:00,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:52:00,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:52:00,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050134126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:00,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:00,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 10:52:00,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378184068] [2022-11-20 10:52:00,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:00,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:52:00,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:00,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:52:00,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:52:00,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 234 [2022-11-20 10:52:00,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 219 transitions, 642 flow. Second operand has 23 states, 23 states have (on average 194.30434782608697) internal successors, (4469), 23 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:00,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:00,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 234 [2022-11-20 10:52:00,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:01,479 INFO L130 PetriNetUnfolder]: 5/266 cut-off events. [2022-11-20 10:52:01,479 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-11-20 10:52:01,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 266 events. 5/266 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 507 event pairs, 0 based on Foata normal form. 3/249 useless extension candidates. Maximal degree in co-relation 334. Up to 12 conditions per place. [2022-11-20 10:52:01,483 INFO L137 encePairwiseOnDemand]: 228/234 looper letters, 46 selfloop transitions, 30 changer transitions 0/262 dead transitions. [2022-11-20 10:52:01,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 262 transitions, 1004 flow [2022-11-20 10:52:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:52:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 10:52:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5809 transitions. [2022-11-20 10:52:01,495 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8274928774928775 [2022-11-20 10:52:01,495 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5809 transitions. [2022-11-20 10:52:01,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5809 transitions. [2022-11-20 10:52:01,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:01,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5809 transitions. [2022-11-20 10:52:01,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 193.63333333333333) internal successors, (5809), 30 states have internal predecessors, (5809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:01,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 234.0) internal successors, (7254), 31 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:01,528 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 234.0) internal successors, (7254), 31 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:01,528 INFO L175 Difference]: Start difference. First operand has 238 places, 219 transitions, 642 flow. Second operand 30 states and 5809 transitions. [2022-11-20 10:52:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 262 transitions, 1004 flow [2022-11-20 10:52:01,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 262 transitions, 924 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 10:52:01,536 INFO L231 Difference]: Finished difference. Result has 263 places, 229 transitions, 740 flow [2022-11-20 10:52:01,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=740, PETRI_PLACES=263, PETRI_TRANSITIONS=229} [2022-11-20 10:52:01,537 INFO L288 CegarLoopForPetriNet]: 202 programPoint places, 61 predicate places. [2022-11-20 10:52:01,537 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 229 transitions, 740 flow [2022-11-20 10:52:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 194.30434782608697) internal successors, (4469), 23 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:01,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:01,540 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:01,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:01,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:01,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-11-20 10:52:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash -969245806, now seen corresponding path program 3 times [2022-11-20 10:52:01,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:01,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688084688] [2022-11-20 10:52:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:52:01,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:52:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:52:01,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:52:01,874 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:52:01,876 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-20 10:52:01,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2022-11-20 10:52:01,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2022-11-20 10:52:01,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2022-11-20 10:52:01,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2022-11-20 10:52:01,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2022-11-20 10:52:01,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2022-11-20 10:52:01,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2022-11-20 10:52:01,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2022-11-20 10:52:01,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2022-11-20 10:52:01,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2022-11-20 10:52:01,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2022-11-20 10:52:01,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2022-11-20 10:52:01,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2022-11-20 10:52:01,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2022-11-20 10:52:01,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2022-11-20 10:52:01,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2022-11-20 10:52:01,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2022-11-20 10:52:01,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2022-11-20 10:52:01,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2022-11-20 10:52:01,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2022-11-20 10:52:01,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2022-11-20 10:52:01,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2022-11-20 10:52:01,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2022-11-20 10:52:01,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2022-11-20 10:52:01,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:52:01,890 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-11-20 10:52:01,893 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 10:52:01,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-20 10:52:01,943 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 10:52:01,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 318 transitions, 654 flow [2022-11-20 10:52:02,025 INFO L130 PetriNetUnfolder]: 82/545 cut-off events. [2022-11-20 10:52:02,025 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 10:52:02,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 545 events. 82/545 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2587 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 331. Up to 12 conditions per place. [2022-11-20 10:52:02,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 318 transitions, 654 flow [2022-11-20 10:52:02,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 318 transitions, 654 flow [2022-11-20 10:52:02,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:52:02,043 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;@34f1807c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:52:02,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-20 10:52:02,046 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 10:52:02,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:52:02,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:02,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:02,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash 975280427, now seen corresponding path program 1 times [2022-11-20 10:52:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690244122] [2022-11-20 10:52:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:02,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690244122] [2022-11-20 10:52:02,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690244122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:02,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:02,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022757775] [2022-11-20 10:52:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:02,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:02,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:02,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:02,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:02,087 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:02,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 318 transitions, 654 flow. Second operand has 4 states, 4 states have (on average 261.5) internal successors, (1046), 4 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:02,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:02,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:02,229 INFO L130 PetriNetUnfolder]: 14/479 cut-off events. [2022-11-20 10:52:02,229 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-20 10:52:02,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 479 events. 14/479 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2288 event pairs, 0 based on Foata normal form. 84/498 useless extension candidates. Maximal degree in co-relation 315. Up to 19 conditions per place. [2022-11-20 10:52:02,266 INFO L137 encePairwiseOnDemand]: 272/318 looper letters, 19 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2022-11-20 10:52:02,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 283 transitions, 630 flow [2022-11-20 10:52:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1366 transitions. [2022-11-20 10:52:02,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8591194968553459 [2022-11-20 10:52:02,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1366 transitions. [2022-11-20 10:52:02,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1366 transitions. [2022-11-20 10:52:02,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:02,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1366 transitions. [2022-11-20 10:52:02,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 273.2) internal successors, (1366), 5 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,281 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,281 INFO L175 Difference]: Start difference. First operand has 275 places, 318 transitions, 654 flow. Second operand 5 states and 1366 transitions. [2022-11-20 10:52:02,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 283 transitions, 630 flow [2022-11-20 10:52:02,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 283 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:52:02,288 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 602 flow [2022-11-20 10:52:02,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=602, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2022-11-20 10:52:02,289 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2022-11-20 10:52:02,289 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 602 flow [2022-11-20 10:52:02,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 261.5) internal successors, (1046), 4 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,290 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:02,290 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:02,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:52:02,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1418006054, now seen corresponding path program 1 times [2022-11-20 10:52:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276361687] [2022-11-20 10:52:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:52:02,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:02,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276361687] [2022-11-20 10:52:02,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276361687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:02,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:02,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101661177] [2022-11-20 10:52:02,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:02,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:02,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:02,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:02,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:02,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:02,484 INFO L130 PetriNetUnfolder]: 14/478 cut-off events. [2022-11-20 10:52:02,484 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 10:52:02,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 478 events. 14/478 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2269 event pairs, 0 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 479. Up to 11 conditions per place. [2022-11-20 10:52:02,494 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 11 selfloop transitions, 8 changer transitions 0/279 dead transitions. [2022-11-20 10:52:02,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 279 transitions, 638 flow [2022-11-20 10:52:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1317 transitions. [2022-11-20 10:52:02,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8283018867924529 [2022-11-20 10:52:02,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1317 transitions. [2022-11-20 10:52:02,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1317 transitions. [2022-11-20 10:52:02,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:02,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1317 transitions. [2022-11-20 10:52:02,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 263.4) internal successors, (1317), 5 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,506 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 602 flow. Second operand 5 states and 1317 transitions. [2022-11-20 10:52:02,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 279 transitions, 638 flow [2022-11-20 10:52:02,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 279 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:52:02,513 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 620 flow [2022-11-20 10:52:02,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=620, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2022-11-20 10:52:02,514 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 7 predicate places. [2022-11-20 10:52:02,515 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 620 flow [2022-11-20 10:52:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.25) internal successors, (1053), 4 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,515 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:02,515 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:52:02,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1008515627, now seen corresponding path program 1 times [2022-11-20 10:52:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:02,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718418893] [2022-11-20 10:52:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:02,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718418893] [2022-11-20 10:52:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718418893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203395784] [2022-11-20 10:52:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:02,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:02,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:02,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:52:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:02,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:02,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:02,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:02,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203395784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:02,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:02,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:52:02,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311741415] [2022-11-20 10:52:02,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:02,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:02,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:02,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:02,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:52:02,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:02,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 620 flow. Second operand has 5 states, 5 states have (on average 262.8) internal successors, (1314), 5 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:02,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:02,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:02,909 INFO L130 PetriNetUnfolder]: 14/477 cut-off events. [2022-11-20 10:52:02,909 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-20 10:52:02,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 477 events. 14/477 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2281 event pairs, 0 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 477. Up to 14 conditions per place. [2022-11-20 10:52:02,916 INFO L137 encePairwiseOnDemand]: 314/318 looper letters, 13 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2022-11-20 10:52:02,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 278 transitions, 652 flow [2022-11-20 10:52:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:52:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1055 transitions. [2022-11-20 10:52:02,919 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294025157232704 [2022-11-20 10:52:02,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1055 transitions. [2022-11-20 10:52:02,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1055 transitions. [2022-11-20 10:52:02,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:02,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1055 transitions. [2022-11-20 10:52:02,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,925 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 620 flow. Second operand 4 states and 1055 transitions. [2022-11-20 10:52:02,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 278 transitions, 652 flow [2022-11-20 10:52:02,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 278 transitions, 640 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:02,930 INFO L231 Difference]: Finished difference. Result has 281 places, 278 transitions, 614 flow [2022-11-20 10:52:02,931 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=614, PETRI_PLACES=281, PETRI_TRANSITIONS=278} [2022-11-20 10:52:02,932 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 6 predicate places. [2022-11-20 10:52:02,932 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 278 transitions, 614 flow [2022-11-20 10:52:02,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 262.8) internal successors, (1314), 5 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:02,932 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:02,932 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:02,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:03,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -670260779, now seen corresponding path program 1 times [2022-11-20 10:52:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903727627] [2022-11-20 10:52:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:03,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903727627] [2022-11-20 10:52:03,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903727627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:03,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068095809] [2022-11-20 10:52:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:03,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:03,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:52:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:03,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:03,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:03,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:03,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068095809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:03,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:03,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:52:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728993793] [2022-11-20 10:52:03,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:03,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:52:03,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:52:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:52:03,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:03,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 278 transitions, 614 flow. Second operand has 10 states, 10 states have (on average 262.7) internal successors, (2627), 10 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:03,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:03,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:03,593 INFO L130 PetriNetUnfolder]: 14/485 cut-off events. [2022-11-20 10:52:03,594 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-20 10:52:03,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 485 events. 14/485 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2274 event pairs, 0 based on Foata normal form. 2/425 useless extension candidates. Maximal degree in co-relation 467. Up to 11 conditions per place. [2022-11-20 10:52:03,604 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 20 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2022-11-20 10:52:03,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 289 transitions, 710 flow [2022-11-20 10:52:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:52:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:52:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2371 transitions. [2022-11-20 10:52:03,611 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8284416491963662 [2022-11-20 10:52:03,611 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2371 transitions. [2022-11-20 10:52:03,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2371 transitions. [2022-11-20 10:52:03,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:03,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2371 transitions. [2022-11-20 10:52:03,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 263.44444444444446) internal successors, (2371), 9 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:03,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 318.0) internal successors, (3180), 10 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:03,628 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 318.0) internal successors, (3180), 10 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:03,628 INFO L175 Difference]: Start difference. First operand has 281 places, 278 transitions, 614 flow. Second operand 9 states and 2371 transitions. [2022-11-20 10:52:03,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 289 transitions, 710 flow [2022-11-20 10:52:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 696 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:03,635 INFO L231 Difference]: Finished difference. Result has 290 places, 282 transitions, 660 flow [2022-11-20 10:52:03,636 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=282} [2022-11-20 10:52:03,637 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 15 predicate places. [2022-11-20 10:52:03,638 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 282 transitions, 660 flow [2022-11-20 10:52:03,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 262.7) internal successors, (2627), 10 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:03,639 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:03,639 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:03,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:03,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 10:52:03,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1944723083, now seen corresponding path program 2 times [2022-11-20 10:52:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:03,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19012216] [2022-11-20 10:52:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:52:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:03,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19012216] [2022-11-20 10:52:03,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19012216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:03,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:03,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719990414] [2022-11-20 10:52:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:03,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:03,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:03,923 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:03,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 282 transitions, 660 flow. Second operand has 4 states, 4 states have (on average 261.75) internal successors, (1047), 4 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:03,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:03,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:04,065 INFO L130 PetriNetUnfolder]: 11/416 cut-off events. [2022-11-20 10:52:04,065 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-20 10:52:04,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 416 events. 11/416 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1794 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 420. Up to 21 conditions per place. [2022-11-20 10:52:04,071 INFO L137 encePairwiseOnDemand]: 311/318 looper letters, 19 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2022-11-20 10:52:04,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 720 flow [2022-11-20 10:52:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1326 transitions. [2022-11-20 10:52:04,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8339622641509434 [2022-11-20 10:52:04,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1326 transitions. [2022-11-20 10:52:04,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1326 transitions. [2022-11-20 10:52:04,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:04,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1326 transitions. [2022-11-20 10:52:04,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 265.2) internal successors, (1326), 5 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,084 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,084 INFO L175 Difference]: Start difference. First operand has 290 places, 282 transitions, 660 flow. Second operand 5 states and 1326 transitions. [2022-11-20 10:52:04,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 720 flow [2022-11-20 10:52:04,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 704 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:52:04,091 INFO L231 Difference]: Finished difference. Result has 293 places, 285 transitions, 676 flow [2022-11-20 10:52:04,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=676, PETRI_PLACES=293, PETRI_TRANSITIONS=285} [2022-11-20 10:52:04,092 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 18 predicate places. [2022-11-20 10:52:04,092 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 285 transitions, 676 flow [2022-11-20 10:52:04,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 261.75) internal successors, (1047), 4 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:04,093 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:04,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:52:04,093 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -886108868, now seen corresponding path program 1 times [2022-11-20 10:52:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:04,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282742631] [2022-11-20 10:52:04,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:04,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 10:52:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:04,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282742631] [2022-11-20 10:52:04,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282742631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:04,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:04,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741313503] [2022-11-20 10:52:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:04,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:04,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:04,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 285 transitions, 676 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:04,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:04,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:04,274 INFO L130 PetriNetUnfolder]: 11/415 cut-off events. [2022-11-20 10:52:04,274 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-20 10:52:04,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 415 events. 11/415 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1791 event pairs, 0 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 427. Up to 10 conditions per place. [2022-11-20 10:52:04,283 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 11 selfloop transitions, 8 changer transitions 0/285 dead transitions. [2022-11-20 10:52:04,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 285 transitions, 712 flow [2022-11-20 10:52:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1317 transitions. [2022-11-20 10:52:04,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8283018867924529 [2022-11-20 10:52:04,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1317 transitions. [2022-11-20 10:52:04,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1317 transitions. [2022-11-20 10:52:04,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:04,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1317 transitions. [2022-11-20 10:52:04,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 263.4) internal successors, (1317), 5 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,294 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,294 INFO L175 Difference]: Start difference. First operand has 293 places, 285 transitions, 676 flow. Second operand 5 states and 1317 transitions. [2022-11-20 10:52:04,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 285 transitions, 712 flow [2022-11-20 10:52:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 285 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:52:04,301 INFO L231 Difference]: Finished difference. Result has 296 places, 285 transitions, 694 flow [2022-11-20 10:52:04,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=694, PETRI_PLACES=296, PETRI_TRANSITIONS=285} [2022-11-20 10:52:04,303 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 21 predicate places. [2022-11-20 10:52:04,303 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 285 transitions, 694 flow [2022-11-20 10:52:04,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:04,304 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:04,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:52:04,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1699570285, now seen corresponding path program 1 times [2022-11-20 10:52:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:04,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928805145] [2022-11-20 10:52:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928805145] [2022-11-20 10:52:04,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928805145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655827300] [2022-11-20 10:52:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:04,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:04,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:52:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:04,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:52:04,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:04,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:04,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655827300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:04,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:04,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 10:52:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919385589] [2022-11-20 10:52:04,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:04,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:52:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:52:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:52:04,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:04,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 285 transitions, 694 flow. Second operand has 18 states, 18 states have (on average 263.1111111111111) internal successors, (4736), 18 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:04,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:04,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:04,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:05,129 INFO L130 PetriNetUnfolder]: 11/443 cut-off events. [2022-11-20 10:52:05,129 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-11-20 10:52:05,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 443 events. 11/443 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1802 event pairs, 0 based on Foata normal form. 4/401 useless extension candidates. Maximal degree in co-relation 421. Up to 11 conditions per place. [2022-11-20 10:52:05,138 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 36 selfloop transitions, 21 changer transitions 0/320 dead transitions. [2022-11-20 10:52:05,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 320 transitions, 962 flow [2022-11-20 10:52:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:52:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:52:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5521 transitions. [2022-11-20 10:52:05,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8267445342917041 [2022-11-20 10:52:05,148 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5521 transitions. [2022-11-20 10:52:05,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5521 transitions. [2022-11-20 10:52:05,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:05,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5521 transitions. [2022-11-20 10:52:05,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 262.9047619047619) internal successors, (5521), 21 states have internal predecessors, (5521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 318.0) internal successors, (6996), 22 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,175 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 318.0) internal successors, (6996), 22 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,176 INFO L175 Difference]: Start difference. First operand has 296 places, 285 transitions, 694 flow. Second operand 21 states and 5521 transitions. [2022-11-20 10:52:05,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 320 transitions, 962 flow [2022-11-20 10:52:05,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 320 transitions, 950 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:05,183 INFO L231 Difference]: Finished difference. Result has 318 places, 298 transitions, 838 flow [2022-11-20 10:52:05,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=838, PETRI_PLACES=318, PETRI_TRANSITIONS=298} [2022-11-20 10:52:05,185 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 43 predicate places. [2022-11-20 10:52:05,185 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 298 transitions, 838 flow [2022-11-20 10:52:05,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 263.1111111111111) internal successors, (4736), 18 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:05,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:05,187 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:05,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:05,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:52:05,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:05,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -840339885, now seen corresponding path program 2 times [2022-11-20 10:52:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427519798] [2022-11-20 10:52:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:05,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427519798] [2022-11-20 10:52:05,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427519798] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:05,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326846958] [2022-11-20 10:52:05,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:52:05,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:05,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:05,758 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:05,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:52:05,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:52:05,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:05,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:52:05,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:06,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:06,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326846958] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:06,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:06,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 10:52:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042998883] [2022-11-20 10:52:06,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:06,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:52:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:52:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:52:06,310 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:06,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 298 transitions, 838 flow. Second operand has 23 states, 23 states have (on average 263.3478260869565) internal successors, (6057), 23 states have internal predecessors, (6057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:06,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:06,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:06,883 INFO L130 PetriNetUnfolder]: 11/464 cut-off events. [2022-11-20 10:52:06,883 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-11-20 10:52:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 464 events. 11/464 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1803 event pairs, 0 based on Foata normal form. 3/421 useless extension candidates. Maximal degree in co-relation 525. Up to 12 conditions per place. [2022-11-20 10:52:06,900 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 48 selfloop transitions, 30 changer transitions 0/341 dead transitions. [2022-11-20 10:52:06,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 341 transitions, 1204 flow [2022-11-20 10:52:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:52:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 10:52:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7881 transitions. [2022-11-20 10:52:06,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8261006289308176 [2022-11-20 10:52:06,917 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7881 transitions. [2022-11-20 10:52:06,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7881 transitions. [2022-11-20 10:52:06,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:06,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7881 transitions. [2022-11-20 10:52:06,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 262.7) internal successors, (7881), 30 states have internal predecessors, (7881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:06,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 318.0) internal successors, (9858), 31 states have internal predecessors, (9858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:06,958 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 318.0) internal successors, (9858), 31 states have internal predecessors, (9858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:06,958 INFO L175 Difference]: Start difference. First operand has 318 places, 298 transitions, 838 flow. Second operand 30 states and 7881 transitions. [2022-11-20 10:52:06,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 341 transitions, 1204 flow [2022-11-20 10:52:06,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 1124 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 10:52:06,968 INFO L231 Difference]: Finished difference. Result has 343 places, 308 transitions, 936 flow [2022-11-20 10:52:06,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=936, PETRI_PLACES=343, PETRI_TRANSITIONS=308} [2022-11-20 10:52:06,970 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 68 predicate places. [2022-11-20 10:52:06,970 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 308 transitions, 936 flow [2022-11-20 10:52:06,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 263.3478260869565) internal successors, (6057), 23 states have internal predecessors, (6057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:06,972 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:06,972 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:06,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:07,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:52:07,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash -454920040, now seen corresponding path program 3 times [2022-11-20 10:52:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:07,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225862264] [2022-11-20 10:52:07,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:07,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225862264] [2022-11-20 10:52:07,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225862264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:07,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844732512] [2022-11-20 10:52:07,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:52:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:07,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:07,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:07,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:52:07,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:52:07,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:07,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:07,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:07,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:07,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844732512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:07,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:07,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:52:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839481434] [2022-11-20 10:52:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:07,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:52:07,523 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 318 [2022-11-20 10:52:07,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 308 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 263.2) internal successors, (1316), 5 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:07,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:07,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 318 [2022-11-20 10:52:07,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:07,672 INFO L130 PetriNetUnfolder]: 11/463 cut-off events. [2022-11-20 10:52:07,672 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-20 10:52:07,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 463 events. 11/463 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1794 event pairs, 0 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 466. Up to 17 conditions per place. [2022-11-20 10:52:07,680 INFO L137 encePairwiseOnDemand]: 314/318 looper letters, 13 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2022-11-20 10:52:07,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 307 transitions, 968 flow [2022-11-20 10:52:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:52:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1055 transitions. [2022-11-20 10:52:07,683 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294025157232704 [2022-11-20 10:52:07,683 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1055 transitions. [2022-11-20 10:52:07,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1055 transitions. [2022-11-20 10:52:07,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:07,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1055 transitions. [2022-11-20 10:52:07,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:07,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:07,690 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:07,690 INFO L175 Difference]: Start difference. First operand has 343 places, 308 transitions, 936 flow. Second operand 4 states and 1055 transitions. [2022-11-20 10:52:07,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 307 transitions, 968 flow [2022-11-20 10:52:07,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 307 transitions, 922 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-20 10:52:07,700 INFO L231 Difference]: Finished difference. Result has 327 places, 307 transitions, 896 flow [2022-11-20 10:52:07,700 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=896, PETRI_PLACES=327, PETRI_TRANSITIONS=307} [2022-11-20 10:52:07,701 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 52 predicate places. [2022-11-20 10:52:07,701 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 307 transitions, 896 flow [2022-11-20 10:52:07,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 263.2) internal successors, (1316), 5 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:07,702 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:07,703 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:07,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:52:07,910 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:07,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash 346639328, now seen corresponding path program 1 times [2022-11-20 10:52:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:07,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367105323] [2022-11-20 10:52:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:08,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:08,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367105323] [2022-11-20 10:52:08,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367105323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:08,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:08,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:52:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522296561] [2022-11-20 10:52:08,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:08,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:52:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:52:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:52:08,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 318 [2022-11-20 10:52:08,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 307 transitions, 896 flow. Second operand has 13 states, 13 states have (on average 205.15384615384616) internal successors, (2667), 13 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:08,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:08,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 318 [2022-11-20 10:52:08,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:24,767 INFO L130 PetriNetUnfolder]: 24429/70829 cut-off events. [2022-11-20 10:52:24,767 INFO L131 PetriNetUnfolder]: For 989/990 co-relation queries the response was YES. [2022-11-20 10:52:25,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106901 conditions, 70829 events. 24429/70829 cut-off events. For 989/990 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 963050 event pairs, 4908 based on Foata normal form. 0/62450 useless extension candidates. Maximal degree in co-relation 106633. Up to 18913 conditions per place. [2022-11-20 10:52:25,593 INFO L137 encePairwiseOnDemand]: 298/318 looper letters, 445 selfloop transitions, 65 changer transitions 0/744 dead transitions. [2022-11-20 10:52:25,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 744 transitions, 2871 flow [2022-11-20 10:52:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:52:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-20 10:52:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5597 transitions. [2022-11-20 10:52:25,603 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7040251572327044 [2022-11-20 10:52:25,604 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5597 transitions. [2022-11-20 10:52:25,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5597 transitions. [2022-11-20 10:52:25,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:25,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5597 transitions. [2022-11-20 10:52:25,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 223.88) internal successors, (5597), 25 states have internal predecessors, (5597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:25,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 318.0) internal successors, (8268), 26 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:25,632 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 318.0) internal successors, (8268), 26 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:25,632 INFO L175 Difference]: Start difference. First operand has 327 places, 307 transitions, 896 flow. Second operand 25 states and 5597 transitions. [2022-11-20 10:52:25,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 744 transitions, 2871 flow [2022-11-20 10:52:25,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 744 transitions, 2861 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:25,657 INFO L231 Difference]: Finished difference. Result has 366 places, 383 transitions, 1400 flow [2022-11-20 10:52:25,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1400, PETRI_PLACES=366, PETRI_TRANSITIONS=383} [2022-11-20 10:52:25,659 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 91 predicate places. [2022-11-20 10:52:25,660 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 383 transitions, 1400 flow [2022-11-20 10:52:25,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 205.15384615384616) internal successors, (2667), 13 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:25,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:25,661 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:25,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:52:25,662 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1357929958, now seen corresponding path program 1 times [2022-11-20 10:52:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:25,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297025969] [2022-11-20 10:52:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:25,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297025969] [2022-11-20 10:52:25,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297025969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:25,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973823471] [2022-11-20 10:52:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:25,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:25,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:25,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:25,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:52:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:25,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:52:25,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-20 10:52:25,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973823471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:25,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:25,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 10:52:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356042081] [2022-11-20 10:52:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:52:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:25,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:52:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:52:25,993 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 318 [2022-11-20 10:52:25,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 383 transitions, 1400 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:25,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:25,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 318 [2022-11-20 10:52:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:27,183 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1088] t_funEXIT-->L957-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#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~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} AuxVars[] AssignedVars[][318], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, 2251#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:27,184 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-20 10:52:27,184 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 10:52:27,184 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-20 10:52:27,185 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-20 10:52:27,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1088] t_funEXIT-->L957-4: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#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~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_7|} AuxVars[] AssignedVars[][318], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 2251#true, Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), 17#t_funENTRYtrue, Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:27,611 INFO L383 tUnfolder$Statistics]: this new event has 218 ancestors and is cut-off event [2022-11-20 10:52:27,612 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-20 10:52:27,612 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-20 10:52:27,612 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-20 10:52:28,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1089] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 2251#true, Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0NotInUse, 225#L957-4true, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:28,145 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-20 10:52:28,145 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-20 10:52:28,145 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-20 10:52:28,145 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-20 10:52:28,389 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([930] L947-1-->L947-2: Formula: (and (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1| (+ (* |v_t_funThread1of2ForFork0_~i~0#1_9| 28) |v_~#cache~0.offset_4|)) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1| |v_~#cache~0.base_5|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_4|, ~#cache~0.base=|v_~#cache~0.base_5|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_4|, ~#cache~0.base=|v_~#cache~0.base_5|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base_1|, t_funThread1of2ForFork0_~i~0#1=|v_t_funThread1of2ForFork0_~i~0#1_9|, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset, t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base][200], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 2251#true, Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), 109#L958true, 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), t_funThread1of2ForFork0InUse, Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), 203#L941-10true, Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 31#L947-2true, Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:28,389 INFO L383 tUnfolder$Statistics]: this new event has 228 ancestors and is cut-off event [2022-11-20 10:52:28,389 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-20 10:52:28,390 INFO L386 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-11-20 10:52:28,390 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 10:52:28,427 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1089] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, 2251#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), 225#L957-4true, t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:28,427 INFO L383 tUnfolder$Statistics]: this new event has 263 ancestors and is cut-off event [2022-11-20 10:52:28,427 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-20 10:52:28,427 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-20 10:52:28,427 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-20 10:52:28,427 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-11-20 10:52:28,428 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][321], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, 2251#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread1of2ForFork0NotInUse, Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), 2184#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread2of2ForFork0InUse, 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), 203#L941-10true, Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 11#L954-18true, Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:28,429 INFO L383 tUnfolder$Statistics]: this new event has 236 ancestors and is cut-off event [2022-11-20 10:52:28,429 INFO L386 tUnfolder$Statistics]: existing Event has 224 ancestors and is cut-off event [2022-11-20 10:52:28,429 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-20 10:52:28,429 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-20 10:52:28,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([724] L954-17-->L954-18: Formula: (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t_ids~0#1.base_5| 0)) InVars {ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid][321], [Black: 2213#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2223#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2199#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2225#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 288#true, Black: 2211#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 2251#true, Black: 2186#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2203#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2197#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2195#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2205#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2209#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 1002#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 714#(<= |ULTIMATE.start_main_~i~1#1| 3), 706#true, Black: 1042#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1019#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1556#(< |ULTIMATE.start_main_~i~1#1| 10), 2184#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), t_funThread1of2ForFork0InUse, Black: 1184#(<= |ULTIMATE.start_main_~i~1#1| 7), t_funThread2of2ForFork0NotInUse, Black: 1573#(< |ULTIMATE.start_main_~i~1#1| 9), 1168#true, Black: 280#(= |ULTIMATE.start_main_~i~1#1| 0), 697#true, Black: 584#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 416#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 690#(= 0 |ULTIMATE.start_main_#t~post43#1|), Black: 689#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 692#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (= |ULTIMATE.start_main_~i~3#1| 0)), 412#true, Black: 2217#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 11#L954-18true, Black: 2201#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|)) (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2207#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#cache~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), 129#L941-10true, Black: 2229#(and (= |~#__global_lock~0.offset| 0) (= 0 |t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2215#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2219#(and (= |~#__global_lock~0.offset| 0) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_cache_entry_addref_#t~post35#1| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|)), Black: 2185#(and (= |~#__global_lock~0.offset| 0) (= (select |#valid| 4) 1) (< |~#cache~0.base| (+ 5 |~#__global_lock~0.offset|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#cache~0.base|))]) [2022-11-20 10:52:28,483 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-20 10:52:28,483 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-11-20 10:52:28,483 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-20 10:52:28,483 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-20 10:52:28,507 INFO L130 PetriNetUnfolder]: 560/6762 cut-off events. [2022-11-20 10:52:28,507 INFO L131 PetriNetUnfolder]: For 3365/3601 co-relation queries the response was YES. [2022-11-20 10:52:28,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 6762 events. 560/6762 cut-off events. For 3365/3601 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 71942 event pairs, 79 based on Foata normal form. 30/5881 useless extension candidates. Maximal degree in co-relation 9205. Up to 191 conditions per place. [2022-11-20 10:52:28,687 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 14 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2022-11-20 10:52:28,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 387 transitions, 1440 flow [2022-11-20 10:52:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:52:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:52:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-20 10:52:28,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8480083857442348 [2022-11-20 10:52:28,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-20 10:52:28,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-20 10:52:28,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:28,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-20 10:52:28,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:28,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:28,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:28,695 INFO L175 Difference]: Start difference. First operand has 366 places, 383 transitions, 1400 flow. Second operand 3 states and 809 transitions. [2022-11-20 10:52:28,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 387 transitions, 1440 flow [2022-11-20 10:52:28,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 387 transitions, 1437 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:52:28,732 INFO L231 Difference]: Finished difference. Result has 367 places, 384 transitions, 1409 flow [2022-11-20 10:52:28,733 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1409, PETRI_PLACES=367, PETRI_TRANSITIONS=384} [2022-11-20 10:52:28,734 INFO L288 CegarLoopForPetriNet]: 275 programPoint places, 92 predicate places. [2022-11-20 10:52:28,734 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 384 transitions, 1409 flow [2022-11-20 10:52:28,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:28,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:28,735 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:28,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:28,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:28,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2022-11-20 10:52:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 103460669, now seen corresponding path program 1 times [2022-11-20 10:52:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:28,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916614376] [2022-11-20 10:52:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:52:28,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:52:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:52:29,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:52:29,025 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:52:29,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2022-11-20 10:52:29,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 31 remaining) [2022-11-20 10:52:29,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 31 remaining) [2022-11-20 10:52:29,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 31 remaining) [2022-11-20 10:52:29,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 31 remaining) [2022-11-20 10:52:29,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 31 remaining) [2022-11-20 10:52:29,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 31 remaining) [2022-11-20 10:52:29,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 31 remaining) [2022-11-20 10:52:29,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 31 remaining) [2022-11-20 10:52:29,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 31 remaining) [2022-11-20 10:52:29,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 31 remaining) [2022-11-20 10:52:29,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 31 remaining) [2022-11-20 10:52:29,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 31 remaining) [2022-11-20 10:52:29,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 31 remaining) [2022-11-20 10:52:29,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 31 remaining) [2022-11-20 10:52:29,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 31 remaining) [2022-11-20 10:52:29,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 31 remaining) [2022-11-20 10:52:29,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 31 remaining) [2022-11-20 10:52:29,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 31 remaining) [2022-11-20 10:52:29,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 31 remaining) [2022-11-20 10:52:29,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 31 remaining) [2022-11-20 10:52:29,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 31 remaining) [2022-11-20 10:52:29,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 31 remaining) [2022-11-20 10:52:29,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 31 remaining) [2022-11-20 10:52:29,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 31 remaining) [2022-11-20 10:52:29,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 31 remaining) [2022-11-20 10:52:29,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 31 remaining) [2022-11-20 10:52:29,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 31 remaining) [2022-11-20 10:52:29,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 31 remaining) [2022-11-20 10:52:29,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 31 remaining) [2022-11-20 10:52:29,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 31 remaining) [2022-11-20 10:52:29,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:52:29,036 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:29,037 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 10:52:29,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-20 10:52:29,105 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 10:52:29,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 402 transitions, 834 flow [2022-11-20 10:52:29,267 INFO L130 PetriNetUnfolder]: 120/802 cut-off events. [2022-11-20 10:52:29,267 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-20 10:52:29,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 802 events. 120/802 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4145 event pairs, 1 based on Foata normal form. 0/614 useless extension candidates. Maximal degree in co-relation 553. Up to 16 conditions per place. [2022-11-20 10:52:29,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 402 transitions, 834 flow [2022-11-20 10:52:29,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 402 transitions, 834 flow [2022-11-20 10:52:29,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:52:29,301 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;@34f1807c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:52:29,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-11-20 10:52:29,304 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-20 10:52:29,304 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:52:29,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:29,305 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:29,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash -720202371, now seen corresponding path program 1 times [2022-11-20 10:52:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:29,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735996067] [2022-11-20 10:52:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:29,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-20 10:52:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:29,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735996067] [2022-11-20 10:52:29,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735996067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:29,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:29,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846986006] [2022-11-20 10:52:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:29,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:29,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:29,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:29,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:29,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 402 transitions, 834 flow. Second operand has 4 states, 4 states have (on average 330.5) internal successors, (1322), 4 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:29,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:29,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:29,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:29,758 INFO L130 PetriNetUnfolder]: 23/705 cut-off events. [2022-11-20 10:52:29,758 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-20 10:52:29,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 705 events. 23/705 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3786 event pairs, 1 based on Foata normal form. 185/792 useless extension candidates. Maximal degree in co-relation 512. Up to 28 conditions per place. [2022-11-20 10:52:29,775 INFO L137 encePairwiseOnDemand]: 344/402 looper letters, 21 selfloop transitions, 4 changer transitions 0/354 dead transitions. [2022-11-20 10:52:29,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 354 transitions, 788 flow [2022-11-20 10:52:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-11-20 10:52:29,778 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8582089552238806 [2022-11-20 10:52:29,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1725 transitions. [2022-11-20 10:52:29,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1725 transitions. [2022-11-20 10:52:29,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:29,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1725 transitions. [2022-11-20 10:52:29,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:29,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:29,788 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:29,788 INFO L175 Difference]: Start difference. First operand has 346 places, 402 transitions, 834 flow. Second operand 5 states and 1725 transitions. [2022-11-20 10:52:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 354 transitions, 788 flow [2022-11-20 10:52:29,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 354 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:52:29,795 INFO L231 Difference]: Finished difference. Result has 349 places, 350 transitions, 756 flow [2022-11-20 10:52:29,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=756, PETRI_PLACES=349, PETRI_TRANSITIONS=350} [2022-11-20 10:52:29,796 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 3 predicate places. [2022-11-20 10:52:29,797 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 350 transitions, 756 flow [2022-11-20 10:52:29,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 330.5) internal successors, (1322), 4 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:29,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:29,798 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:29,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:52:29,798 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1346626662, now seen corresponding path program 1 times [2022-11-20 10:52:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:29,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954399368] [2022-11-20 10:52:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:52:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:29,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954399368] [2022-11-20 10:52:29,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954399368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:29,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:29,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554440997] [2022-11-20 10:52:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:29,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:29,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:29,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 350 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 332.25) internal successors, (1329), 4 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:29,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:29,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:29,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:30,042 INFO L130 PetriNetUnfolder]: 23/704 cut-off events. [2022-11-20 10:52:30,042 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-20 10:52:30,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 704 events. 23/704 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3795 event pairs, 1 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 727. Up to 20 conditions per place. [2022-11-20 10:52:30,062 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 13 selfloop transitions, 8 changer transitions 0/350 dead transitions. [2022-11-20 10:52:30,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 350 transitions, 796 flow [2022-11-20 10:52:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1664 transitions. [2022-11-20 10:52:30,066 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8278606965174129 [2022-11-20 10:52:30,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1664 transitions. [2022-11-20 10:52:30,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1664 transitions. [2022-11-20 10:52:30,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:30,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1664 transitions. [2022-11-20 10:52:30,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 332.8) internal successors, (1664), 5 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,075 INFO L175 Difference]: Start difference. First operand has 349 places, 350 transitions, 756 flow. Second operand 5 states and 1664 transitions. [2022-11-20 10:52:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 350 transitions, 796 flow [2022-11-20 10:52:30,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 350 transitions, 794 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:52:30,083 INFO L231 Difference]: Finished difference. Result has 352 places, 350 transitions, 774 flow [2022-11-20 10:52:30,084 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=774, PETRI_PLACES=352, PETRI_TRANSITIONS=350} [2022-11-20 10:52:30,084 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 6 predicate places. [2022-11-20 10:52:30,084 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 350 transitions, 774 flow [2022-11-20 10:52:30,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 332.25) internal successors, (1329), 4 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,085 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:30,085 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:30,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:52:30,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1204245123, now seen corresponding path program 1 times [2022-11-20 10:52:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:30,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109058732] [2022-11-20 10:52:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:30,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109058732] [2022-11-20 10:52:30,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109058732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114162927] [2022-11-20 10:52:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:30,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:30,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:52:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:30,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:30,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:30,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:30,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114162927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:30,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:52:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182549741] [2022-11-20 10:52:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:30,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:52:30,336 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:30,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 350 transitions, 774 flow. Second operand has 5 states, 5 states have (on average 331.8) internal successors, (1659), 5 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:30,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:30,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:30,531 INFO L130 PetriNetUnfolder]: 23/703 cut-off events. [2022-11-20 10:52:30,531 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-11-20 10:52:30,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 703 events. 23/703 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3772 event pairs, 1 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 725. Up to 23 conditions per place. [2022-11-20 10:52:30,548 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 15 selfloop transitions, 5 changer transitions 0/349 dead transitions. [2022-11-20 10:52:30,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 349 transitions, 810 flow [2022-11-20 10:52:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:52:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1333 transitions. [2022-11-20 10:52:30,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8289800995024875 [2022-11-20 10:52:30,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1333 transitions. [2022-11-20 10:52:30,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1333 transitions. [2022-11-20 10:52:30,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:30,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1333 transitions. [2022-11-20 10:52:30,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 333.25) internal successors, (1333), 4 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,557 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,557 INFO L175 Difference]: Start difference. First operand has 352 places, 350 transitions, 774 flow. Second operand 4 states and 1333 transitions. [2022-11-20 10:52:30,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 349 transitions, 810 flow [2022-11-20 10:52:30,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 349 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:30,566 INFO L231 Difference]: Finished difference. Result has 351 places, 349 transitions, 768 flow [2022-11-20 10:52:30,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=768, PETRI_PLACES=351, PETRI_TRANSITIONS=349} [2022-11-20 10:52:30,567 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 5 predicate places. [2022-11-20 10:52:30,568 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 349 transitions, 768 flow [2022-11-20 10:52:30,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 331.8) internal successors, (1659), 5 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:30,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:30,569 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:30,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:30,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:30,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:30,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1995445113, now seen corresponding path program 1 times [2022-11-20 10:52:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:30,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363458327] [2022-11-20 10:52:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:30,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363458327] [2022-11-20 10:52:30,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363458327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:30,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243919459] [2022-11-20 10:52:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:30,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:30,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:30,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:52:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:30,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:30,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:31,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:52:31,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243919459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:31,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:31,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 10:52:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911818719] [2022-11-20 10:52:31,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:31,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:52:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:31,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:52:31,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:52:31,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:31,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 349 transitions, 768 flow. Second operand has 10 states, 10 states have (on average 331.7) internal successors, (3317), 10 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:31,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:31,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:31,313 INFO L130 PetriNetUnfolder]: 23/711 cut-off events. [2022-11-20 10:52:31,314 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-20 10:52:31,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 711 events. 23/711 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3769 event pairs, 1 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 715. Up to 20 conditions per place. [2022-11-20 10:52:31,331 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 22 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2022-11-20 10:52:31,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 360 transitions, 868 flow [2022-11-20 10:52:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:52:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 10:52:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2994 transitions. [2022-11-20 10:52:31,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8275290215588723 [2022-11-20 10:52:31,335 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2994 transitions. [2022-11-20 10:52:31,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2994 transitions. [2022-11-20 10:52:31,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:31,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2994 transitions. [2022-11-20 10:52:31,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 332.6666666666667) internal successors, (2994), 9 states have internal predecessors, (2994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 402.0) internal successors, (4020), 10 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,346 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 402.0) internal successors, (4020), 10 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,346 INFO L175 Difference]: Start difference. First operand has 351 places, 349 transitions, 768 flow. Second operand 9 states and 2994 transitions. [2022-11-20 10:52:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 360 transitions, 868 flow [2022-11-20 10:52:31,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 854 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:31,353 INFO L231 Difference]: Finished difference. Result has 360 places, 353 transitions, 814 flow [2022-11-20 10:52:31,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=814, PETRI_PLACES=360, PETRI_TRANSITIONS=353} [2022-11-20 10:52:31,354 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 14 predicate places. [2022-11-20 10:52:31,354 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 353 transitions, 814 flow [2022-11-20 10:52:31,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 331.7) internal successors, (3317), 10 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:31,356 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:31,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:31,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 10:52:31,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -251499687, now seen corresponding path program 2 times [2022-11-20 10:52:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:31,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868176962] [2022-11-20 10:52:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:31,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:52:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:31,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868176962] [2022-11-20 10:52:31,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868176962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:31,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:31,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549266608] [2022-11-20 10:52:31,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:31,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:31,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:31,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:31,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 353 transitions, 814 flow. Second operand has 4 states, 4 states have (on average 330.75) internal successors, (1323), 4 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:31,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:31,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:31,858 INFO L130 PetriNetUnfolder]: 20/642 cut-off events. [2022-11-20 10:52:31,859 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-11-20 10:52:31,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 642 events. 20/642 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3327 event pairs, 1 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 678. Up to 40 conditions per place. [2022-11-20 10:52:31,875 INFO L137 encePairwiseOnDemand]: 395/402 looper letters, 21 selfloop transitions, 4 changer transitions 0/360 dead transitions. [2022-11-20 10:52:31,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 878 flow [2022-11-20 10:52:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1673 transitions. [2022-11-20 10:52:31,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8323383084577114 [2022-11-20 10:52:31,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1673 transitions. [2022-11-20 10:52:31,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1673 transitions. [2022-11-20 10:52:31,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:31,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1673 transitions. [2022-11-20 10:52:31,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 334.6) internal successors, (1673), 5 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,885 INFO L175 Difference]: Start difference. First operand has 360 places, 353 transitions, 814 flow. Second operand 5 states and 1673 transitions. [2022-11-20 10:52:31,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 878 flow [2022-11-20 10:52:31,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 862 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 10:52:31,892 INFO L231 Difference]: Finished difference. Result has 363 places, 356 transitions, 830 flow [2022-11-20 10:52:31,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=830, PETRI_PLACES=363, PETRI_TRANSITIONS=356} [2022-11-20 10:52:31,893 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 17 predicate places. [2022-11-20 10:52:31,893 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 356 transitions, 830 flow [2022-11-20 10:52:31,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 330.75) internal successors, (1323), 4 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:31,894 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:31,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:52:31,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash 111617522, now seen corresponding path program 1 times [2022-11-20 10:52:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:31,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190559282] [2022-11-20 10:52:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-20 10:52:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:31,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190559282] [2022-11-20 10:52:31,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190559282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:31,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:31,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:52:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967006328] [2022-11-20 10:52:31,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:52:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:52:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:52:31,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:31,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 356 transitions, 830 flow. Second operand has 4 states, 4 states have (on average 332.75) internal successors, (1331), 4 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:31,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:31,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:31,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:32,137 INFO L130 PetriNetUnfolder]: 20/640 cut-off events. [2022-11-20 10:52:32,137 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-11-20 10:52:32,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 640 events. 20/640 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3309 event pairs, 1 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 688. Up to 20 conditions per place. [2022-11-20 10:52:32,155 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 13 selfloop transitions, 8 changer transitions 0/356 dead transitions. [2022-11-20 10:52:32,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 356 transitions, 870 flow [2022-11-20 10:52:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:52:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:52:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1664 transitions. [2022-11-20 10:52:32,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8278606965174129 [2022-11-20 10:52:32,158 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1664 transitions. [2022-11-20 10:52:32,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1664 transitions. [2022-11-20 10:52:32,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:32,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1664 transitions. [2022-11-20 10:52:32,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 332.8) internal successors, (1664), 5 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:32,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:32,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 402.0) internal successors, (2412), 6 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:32,165 INFO L175 Difference]: Start difference. First operand has 363 places, 356 transitions, 830 flow. Second operand 5 states and 1664 transitions. [2022-11-20 10:52:32,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 356 transitions, 870 flow [2022-11-20 10:52:32,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 356 transitions, 868 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:52:32,175 INFO L231 Difference]: Finished difference. Result has 366 places, 356 transitions, 848 flow [2022-11-20 10:52:32,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=848, PETRI_PLACES=366, PETRI_TRANSITIONS=356} [2022-11-20 10:52:32,176 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 20 predicate places. [2022-11-20 10:52:32,176 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 356 transitions, 848 flow [2022-11-20 10:52:32,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 332.75) internal successors, (1331), 4 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:32,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:32,177 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:32,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:52:32,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:32,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -834822865, now seen corresponding path program 1 times [2022-11-20 10:52:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:32,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777829111] [2022-11-20 10:52:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777829111] [2022-11-20 10:52:32,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777829111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:32,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650924485] [2022-11-20 10:52:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:32,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:32,303 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:32,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:52:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:32,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:52:32,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:32,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:32,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650924485] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:32,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:32,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 10:52:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251043433] [2022-11-20 10:52:32,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:32,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 10:52:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 10:52:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:52:32,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:32,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 356 transitions, 848 flow. Second operand has 18 states, 18 states have (on average 332.1111111111111) internal successors, (5978), 18 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:32,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:32,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:32,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:32,965 INFO L130 PetriNetUnfolder]: 20/668 cut-off events. [2022-11-20 10:52:32,966 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-20 10:52:32,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 668 events. 20/668 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3311 event pairs, 1 based on Foata normal form. 4/596 useless extension candidates. Maximal degree in co-relation 678. Up to 20 conditions per place. [2022-11-20 10:52:32,982 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 38 selfloop transitions, 21 changer transitions 0/391 dead transitions. [2022-11-20 10:52:32,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 391 transitions, 1120 flow [2022-11-20 10:52:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:52:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 10:52:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6972 transitions. [2022-11-20 10:52:32,995 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8258706467661692 [2022-11-20 10:52:32,995 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6972 transitions. [2022-11-20 10:52:32,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6972 transitions. [2022-11-20 10:52:32,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:32,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6972 transitions. [2022-11-20 10:52:33,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:33,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 402.0) internal successors, (8844), 22 states have internal predecessors, (8844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:33,031 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 402.0) internal successors, (8844), 22 states have internal predecessors, (8844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:33,031 INFO L175 Difference]: Start difference. First operand has 366 places, 356 transitions, 848 flow. Second operand 21 states and 6972 transitions. [2022-11-20 10:52:33,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 391 transitions, 1120 flow [2022-11-20 10:52:33,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 391 transitions, 1108 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:52:33,039 INFO L231 Difference]: Finished difference. Result has 388 places, 369 transitions, 992 flow [2022-11-20 10:52:33,040 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=992, PETRI_PLACES=388, PETRI_TRANSITIONS=369} [2022-11-20 10:52:33,040 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 42 predicate places. [2022-11-20 10:52:33,040 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 369 transitions, 992 flow [2022-11-20 10:52:33,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 332.1111111111111) internal successors, (5978), 18 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:33,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:33,042 INFO L209 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:33,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:33,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:33,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:33,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1189257873, now seen corresponding path program 2 times [2022-11-20 10:52:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:33,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760309822] [2022-11-20 10:52:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:33,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760309822] [2022-11-20 10:52:33,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760309822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:33,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135894487] [2022-11-20 10:52:33,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:52:33,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:33,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:33,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:33,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:52:33,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:52:33,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:33,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:52:33,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:33,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:52:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:52:34,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135894487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:52:34,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:52:34,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-20 10:52:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553378721] [2022-11-20 10:52:34,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:52:34,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:52:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:34,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:52:34,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:52:34,137 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:34,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 369 transitions, 992 flow. Second operand has 23 states, 23 states have (on average 332.3478260869565) internal successors, (7644), 23 states have internal predecessors, (7644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:34,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:34,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:34,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:34,776 INFO L130 PetriNetUnfolder]: 20/689 cut-off events. [2022-11-20 10:52:34,776 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-20 10:52:34,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 689 events. 20/689 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3309 event pairs, 1 based on Foata normal form. 3/616 useless extension candidates. Maximal degree in co-relation 728. Up to 20 conditions per place. [2022-11-20 10:52:34,795 INFO L137 encePairwiseOnDemand]: 396/402 looper letters, 50 selfloop transitions, 30 changer transitions 0/412 dead transitions. [2022-11-20 10:52:34,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 412 transitions, 1362 flow [2022-11-20 10:52:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 10:52:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 10:52:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9953 transitions. [2022-11-20 10:52:34,815 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8252902155887231 [2022-11-20 10:52:34,815 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9953 transitions. [2022-11-20 10:52:34,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9953 transitions. [2022-11-20 10:52:34,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:34,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9953 transitions. [2022-11-20 10:52:34,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 331.76666666666665) internal successors, (9953), 30 states have internal predecessors, (9953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:34,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 402.0) internal successors, (12462), 31 states have internal predecessors, (12462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:34,855 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 402.0) internal successors, (12462), 31 states have internal predecessors, (12462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:34,855 INFO L175 Difference]: Start difference. First operand has 388 places, 369 transitions, 992 flow. Second operand 30 states and 9953 transitions. [2022-11-20 10:52:34,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 412 transitions, 1362 flow [2022-11-20 10:52:34,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 412 transitions, 1282 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-20 10:52:34,865 INFO L231 Difference]: Finished difference. Result has 413 places, 379 transitions, 1090 flow [2022-11-20 10:52:34,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1090, PETRI_PLACES=413, PETRI_TRANSITIONS=379} [2022-11-20 10:52:34,866 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 67 predicate places. [2022-11-20 10:52:34,866 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 379 transitions, 1090 flow [2022-11-20 10:52:34,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 332.3478260869565) internal successors, (7644), 23 states have internal predecessors, (7644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:34,868 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:34,869 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:34,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:35,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 10:52:35,074 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash -82362, now seen corresponding path program 3 times [2022-11-20 10:52:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:35,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529297244] [2022-11-20 10:52:35,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:35,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:35,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529297244] [2022-11-20 10:52:35,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529297244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:52:35,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155543094] [2022-11-20 10:52:35,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:52:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:52:35,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:52:35,211 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:52:35,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:52:35,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:52:35,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:52:35,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:52:35,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:52:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:35,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:52:35,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155543094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:35,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:52:35,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 10:52:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057137847] [2022-11-20 10:52:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:35,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:52:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:52:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:52:35,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 402 [2022-11-20 10:52:35,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 379 transitions, 1090 flow. Second operand has 5 states, 5 states have (on average 332.2) internal successors, (1661), 5 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:35,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:35,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 402 [2022-11-20 10:52:35,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:52:35,674 INFO L130 PetriNetUnfolder]: 20/687 cut-off events. [2022-11-20 10:52:35,674 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-11-20 10:52:35,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 687 events. 20/687 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3296 event pairs, 1 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 696. Up to 30 conditions per place. [2022-11-20 10:52:35,686 INFO L137 encePairwiseOnDemand]: 398/402 looper letters, 15 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2022-11-20 10:52:35,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 378 transitions, 1126 flow [2022-11-20 10:52:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:52:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-20 10:52:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1333 transitions. [2022-11-20 10:52:35,689 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8289800995024875 [2022-11-20 10:52:35,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1333 transitions. [2022-11-20 10:52:35,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1333 transitions. [2022-11-20 10:52:35,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:52:35,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1333 transitions. [2022-11-20 10:52:35,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 333.25) internal successors, (1333), 4 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:35,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:35,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:35,692 INFO L175 Difference]: Start difference. First operand has 413 places, 379 transitions, 1090 flow. Second operand 4 states and 1333 transitions. [2022-11-20 10:52:35,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 378 transitions, 1126 flow [2022-11-20 10:52:35,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 378 transitions, 1080 flow, removed 5 selfloop flow, removed 18 redundant places. [2022-11-20 10:52:35,702 INFO L231 Difference]: Finished difference. Result has 397 places, 378 transitions, 1050 flow [2022-11-20 10:52:35,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1050, PETRI_PLACES=397, PETRI_TRANSITIONS=378} [2022-11-20 10:52:35,704 INFO L288 CegarLoopForPetriNet]: 346 programPoint places, 51 predicate places. [2022-11-20 10:52:35,704 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 378 transitions, 1050 flow [2022-11-20 10:52:35,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 332.2) internal successors, (1661), 5 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:35,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:52:35,705 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:52:35,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:52:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f878e98-c1d3-4026-a1d0-dbdb8f95158d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 10:52:35,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2022-11-20 10:52:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:52:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash -616462076, now seen corresponding path program 1 times [2022-11-20 10:52:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:52:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377875590] [2022-11-20 10:52:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:52:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:52:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:52:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-20 10:52:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:52:36,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377875590] [2022-11-20 10:52:36,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377875590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:52:36,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:52:36,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:52:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135572897] [2022-11-20 10:52:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:52:36,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:52:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:52:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:52:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:52:36,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 402 [2022-11-20 10:52:36,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 378 transitions, 1050 flow. Second operand has 13 states, 13 states have (on average 262.15384615384613) internal successors, (3408), 13 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:52:36,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:52:36,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 402 [2022-11-20 10:52:36,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand