./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8 --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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- 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-2329fc7 [2022-12-13 22:20:51,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:20:51,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:20:51,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:20:51,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:20:51,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:20:51,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:20:51,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:20:51,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:20:51,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:20:51,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:20:51,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:20:51,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:20:51,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:20:51,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:20:51,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:20:51,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:20:51,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:20:51,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:20:51,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:20:51,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:20:51,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:20:51,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:20:51,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:20:51,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:20:51,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:20:51,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:20:51,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:20:51,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:20:51,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:20:51,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:20:51,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:20:51,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:20:51,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:20:51,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:20:51,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:20:51,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:20:51,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:20:51,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:20:51,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:20:51,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:20:51,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 22:20:51,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:20:51,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:20:51,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:20:51,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:20:51,634 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:20:51,634 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:20:51,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:20:51,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:20:51,635 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:20:51,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:20:51,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:20:51,636 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:20:51,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:20:51,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:20:51,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:20:51,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:20:51,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:20:51,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:20:51,637 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 22:20:51,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:20:51,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:20:51,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:20:51,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:20:51,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:20:51,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:20:51,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:20:51,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:20:51,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:20:51,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:20:51,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:20:51,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:20:51,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:20:51,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:20:51,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:20:51,640 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:20:51,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:20:51,641 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:20:51,641 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2022-12-13 22:20:51,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:20:51,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:20:51,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:20:51,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:20:51,866 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:20:51,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread/queue_longer.i [2022-12-13 22:20:54,448 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:20:54,606 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:20:54,607 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i [2022-12-13 22:20:54,616 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/data/05cab4501/8c59685e1ee14bc3b4312f3b16ba26e2/FLAG38a647b6e [2022-12-13 22:20:54,981 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/data/05cab4501/8c59685e1ee14bc3b4312f3b16ba26e2 [2022-12-13 22:20:54,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:20:54,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:20:54,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:20:54,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:20:54,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:20:54,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:20:54" (1/1) ... [2022-12-13 22:20:54,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f5454c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:54, skipping insertion in model container [2022-12-13 22:20:54,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:20:54" (1/1) ... [2022-12-13 22:20:54,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:20:55,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:20:55,298 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2022-12-13 22:20:55,301 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2022-12-13 22:20:55,303 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2022-12-13 22:20:55,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:20:55,314 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:20:55,345 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2022-12-13 22:20:55,347 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2022-12-13 22:20:55,349 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_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2022-12-13 22:20:55,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:20:55,383 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:20:55,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55 WrapperNode [2022-12-13 22:20:55,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:20:55,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:20:55,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:20:55,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:20:55,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,422 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2022-12-13 22:20:55,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:20:55,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:20:55,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:20:55,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:20:55,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,445 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:20:55,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:20:55,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:20:55,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:20:55,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (1/1) ... [2022-12-13 22:20:55,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:20:55,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:20:55,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:20:55,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:20:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 22:20:55,505 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 22:20:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 22:20:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:20:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:20:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:20:55,507 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 22:20:55,616 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:20:55,617 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:20:55,910 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:20:55,927 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:20:55,927 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 22:20:55,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:55 BoogieIcfgContainer [2022-12-13 22:20:55,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:20:55,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:20:55,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:20:55,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:20:55,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:20:54" (1/3) ... [2022-12-13 22:20:55,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b22a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:20:55, skipping insertion in model container [2022-12-13 22:20:55,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:55" (2/3) ... [2022-12-13 22:20:55,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b22a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:20:55, skipping insertion in model container [2022-12-13 22:20:55,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:55" (3/3) ... [2022-12-13 22:20:55,937 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-13 22:20:55,944 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 22:20:55,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:20:55,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-13 22:20:55,952 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:20:56,045 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 22:20:56,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 626 flow [2022-12-13 22:20:56,182 INFO L130 PetriNetUnfolder]: 15/303 cut-off events. [2022-12-13 22:20:56,182 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 22:20:56,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 303 events. 15/303 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 471 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-13 22:20:56,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 626 flow [2022-12-13 22:20:56,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 293 transitions, 595 flow [2022-12-13 22:20:56,201 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:20:56,212 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 293 transitions, 595 flow [2022-12-13 22:20:56,215 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 293 transitions, 595 flow [2022-12-13 22:20:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 293 transitions, 595 flow [2022-12-13 22:20:56,277 INFO L130 PetriNetUnfolder]: 15/293 cut-off events. [2022-12-13 22:20:56,277 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 22:20:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 293 events. 15/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 427 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-13 22:20:56,290 INFO L119 LiptonReduction]: Number of co-enabled transitions 23276 [2022-12-13 22:21:02,781 INFO L134 LiptonReduction]: Checked pairs total: 58351 [2022-12-13 22:21:02,781 INFO L136 LiptonReduction]: Total number of compositions: 282 [2022-12-13 22:21:02,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:21:02,796 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;@22dd6201, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:21:02,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-12-13 22:21:02,799 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 22:21:02,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:21:02,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:02,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 22:21:02,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash 965566228, now seen corresponding path program 1 times [2022-12-13 22:21:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:02,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221579585] [2022-12-13 22:21:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:03,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221579585] [2022-12-13 22:21:03,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221579585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:03,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:03,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:21:03,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831008426] [2022-12-13 22:21:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:03,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:21:03,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:21:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:21:03,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 587 [2022-12-13 22:21:03,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 269.2) internal successors, (1346), 5 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:03,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:03,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 587 [2022-12-13 22:21:03,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:04,328 INFO L130 PetriNetUnfolder]: 3013/5040 cut-off events. [2022-12-13 22:21:04,328 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 22:21:04,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9937 conditions, 5040 events. 3013/5040 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 26908 event pairs, 2536 based on Foata normal form. 78/3612 useless extension candidates. Maximal degree in co-relation 9716. Up to 4787 conditions per place. [2022-12-13 22:21:04,357 INFO L137 encePairwiseOnDemand]: 578/587 looper letters, 72 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2022-12-13 22:21:04,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 85 transitions, 337 flow [2022-12-13 22:21:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1423 transitions. [2022-12-13 22:21:04,371 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4848381601362862 [2022-12-13 22:21:04,372 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1423 transitions. [2022-12-13 22:21:04,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1423 transitions. [2022-12-13 22:21:04,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:04,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1423 transitions. [2022-12-13 22:21:04,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 284.6) internal successors, (1423), 5 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:04,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:04,389 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:04,391 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 5 states and 1423 transitions. [2022-12-13 22:21:04,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 85 transitions, 337 flow [2022-12-13 22:21:04,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 332 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:04,396 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 205 flow [2022-12-13 22:21:04,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2022-12-13 22:21:04,399 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2022-12-13 22:21:04,399 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 205 flow [2022-12-13 22:21:04,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.2) internal successors, (1346), 5 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:04,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:04,400 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:04,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:21:04,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -132329427, now seen corresponding path program 1 times [2022-12-13 22:21:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:04,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222532743] [2022-12-13 22:21:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:04,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:04,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222532743] [2022-12-13 22:21:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222532743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:04,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:04,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:21:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845170993] [2022-12-13 22:21:04,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:04,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:21:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:21:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:21:05,064 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 587 [2022-12-13 22:21:05,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 266.1666666666667) internal successors, (1597), 6 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:05,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:05,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 587 [2022-12-13 22:21:05,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:05,614 INFO L130 PetriNetUnfolder]: 3244/5422 cut-off events. [2022-12-13 22:21:05,615 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-12-13 22:21:05,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11068 conditions, 5422 events. 3244/5422 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 29757 event pairs, 719 based on Foata normal form. 27/3920 useless extension candidates. Maximal degree in co-relation 10047. Up to 4820 conditions per place. [2022-12-13 22:21:05,640 INFO L137 encePairwiseOnDemand]: 579/587 looper letters, 118 selfloop transitions, 13 changer transitions 0/137 dead transitions. [2022-12-13 22:21:05,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 137 transitions, 589 flow [2022-12-13 22:21:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1455 transitions. [2022-12-13 22:21:05,645 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4957410562180579 [2022-12-13 22:21:05,645 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1455 transitions. [2022-12-13 22:21:05,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1455 transitions. [2022-12-13 22:21:05,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:05,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1455 transitions. [2022-12-13 22:21:05,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:05,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:05,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:05,656 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 205 flow. Second operand 5 states and 1455 transitions. [2022-12-13 22:21:05,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 137 transitions, 589 flow [2022-12-13 22:21:05,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 589 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:21:05,664 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 277 flow [2022-12-13 22:21:05,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2022-12-13 22:21:05,665 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 10 predicate places. [2022-12-13 22:21:05,665 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 277 flow [2022-12-13 22:21:05,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.1666666666667) internal successors, (1597), 6 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:05,666 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:05,666 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:05,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:21:05,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash -132098787, now seen corresponding path program 2 times [2022-12-13 22:21:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:05,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989017558] [2022-12-13 22:21:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:05,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:06,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:06,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989017558] [2022-12-13 22:21:06,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989017558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:06,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:06,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:21:06,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790869042] [2022-12-13 22:21:06,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:06,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:21:06,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:06,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:21:06,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:21:07,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 587 [2022-12-13 22:21:07,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 267.1666666666667) internal successors, (1603), 6 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:07,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:07,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 587 [2022-12-13 22:21:07,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:07,955 INFO L130 PetriNetUnfolder]: 3364/5604 cut-off events. [2022-12-13 22:21:07,955 INFO L131 PetriNetUnfolder]: For 892/892 co-relation queries the response was YES. [2022-12-13 22:21:07,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12032 conditions, 5604 events. 3364/5604 cut-off events. For 892/892 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 30805 event pairs, 819 based on Foata normal form. 27/4038 useless extension candidates. Maximal degree in co-relation 10504. Up to 4878 conditions per place. [2022-12-13 22:21:07,987 INFO L137 encePairwiseOnDemand]: 579/587 looper letters, 119 selfloop transitions, 15 changer transitions 0/140 dead transitions. [2022-12-13 22:21:07,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 140 transitions, 660 flow [2022-12-13 22:21:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1459 transitions. [2022-12-13 22:21:07,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4971039182282794 [2022-12-13 22:21:07,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1459 transitions. [2022-12-13 22:21:07,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1459 transitions. [2022-12-13 22:21:07,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:07,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1459 transitions. [2022-12-13 22:21:08,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 291.8) internal successors, (1459), 5 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:08,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:08,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:08,014 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 277 flow. Second operand 5 states and 1459 transitions. [2022-12-13 22:21:08,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 140 transitions, 660 flow [2022-12-13 22:21:08,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 140 transitions, 646 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 22:21:08,021 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 325 flow [2022-12-13 22:21:08,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2022-12-13 22:21:08,021 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2022-12-13 22:21:08,021 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 325 flow [2022-12-13 22:21:08,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.1666666666667) internal successors, (1603), 6 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:08,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:08,022 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:08,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:21:08,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash -132215037, now seen corresponding path program 3 times [2022-12-13 22:21:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:08,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850992495] [2022-12-13 22:21:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:08,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850992495] [2022-12-13 22:21:08,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850992495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:08,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:08,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:21:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360494260] [2022-12-13 22:21:08,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:08,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:21:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:21:08,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:21:09,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 587 [2022-12-13 22:21:09,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 267.1666666666667) internal successors, (1603), 6 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:09,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:09,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 587 [2022-12-13 22:21:09,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:10,031 INFO L130 PetriNetUnfolder]: 3422/5708 cut-off events. [2022-12-13 22:21:10,031 INFO L131 PetriNetUnfolder]: For 1265/1265 co-relation queries the response was YES. [2022-12-13 22:21:10,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 5708 events. 3422/5708 cut-off events. For 1265/1265 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 31737 event pairs, 814 based on Foata normal form. 27/4123 useless extension candidates. Maximal degree in co-relation 11242. Up to 4867 conditions per place. [2022-12-13 22:21:10,048 INFO L137 encePairwiseOnDemand]: 580/587 looper letters, 120 selfloop transitions, 16 changer transitions 0/142 dead transitions. [2022-12-13 22:21:10,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 142 transitions, 709 flow [2022-12-13 22:21:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1459 transitions. [2022-12-13 22:21:10,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4971039182282794 [2022-12-13 22:21:10,051 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1459 transitions. [2022-12-13 22:21:10,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1459 transitions. [2022-12-13 22:21:10,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:10,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1459 transitions. [2022-12-13 22:21:10,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 291.8) internal successors, (1459), 5 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,057 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,058 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 325 flow. Second operand 5 states and 1459 transitions. [2022-12-13 22:21:10,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 142 transitions, 709 flow [2022-12-13 22:21:10,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 142 transitions, 691 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:10,062 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 369 flow [2022-12-13 22:21:10,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2022-12-13 22:21:10,063 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2022-12-13 22:21:10,063 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 369 flow [2022-12-13 22:21:10,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.1666666666667) internal successors, (1603), 6 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:10,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:10,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:21:10,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash 689634943, now seen corresponding path program 1 times [2022-12-13 22:21:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475887561] [2022-12-13 22:21:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:10,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:10,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475887561] [2022-12-13 22:21:10,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475887561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:10,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:10,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622364221] [2022-12-13 22:21:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:10,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:10,097 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 587 [2022-12-13 22:21:10,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:10,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 587 [2022-12-13 22:21:10,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:10,801 INFO L130 PetriNetUnfolder]: 5823/9723 cut-off events. [2022-12-13 22:21:10,801 INFO L131 PetriNetUnfolder]: For 4343/4343 co-relation queries the response was YES. [2022-12-13 22:21:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21356 conditions, 9723 events. 5823/9723 cut-off events. For 4343/4343 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 61165 event pairs, 2679 based on Foata normal form. 0/7069 useless extension candidates. Maximal degree in co-relation 19360. Up to 5360 conditions per place. [2022-12-13 22:21:10,829 INFO L137 encePairwiseOnDemand]: 582/587 looper letters, 160 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2022-12-13 22:21:10,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 169 transitions, 954 flow [2022-12-13 22:21:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 999 transitions. [2022-12-13 22:21:10,833 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5672913117546848 [2022-12-13 22:21:10,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 999 transitions. [2022-12-13 22:21:10,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 999 transitions. [2022-12-13 22:21:10,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:10,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 999 transitions. [2022-12-13 22:21:10,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,837 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 369 flow. Second operand 3 states and 999 transitions. [2022-12-13 22:21:10,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 169 transitions, 954 flow [2022-12-13 22:21:10,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 169 transitions, 900 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:10,840 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 355 flow [2022-12-13 22:21:10,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2022-12-13 22:21:10,841 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2022-12-13 22:21:10,841 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 355 flow [2022-12-13 22:21:10,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:10,842 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:10,842 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:10,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:21:10,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1783955680, now seen corresponding path program 1 times [2022-12-13 22:21:10,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:10,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328724506] [2022-12-13 22:21:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:11,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:11,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328724506] [2022-12-13 22:21:11,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328724506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:11,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:11,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:21:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370797523] [2022-12-13 22:21:11,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:11,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:21:11,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:11,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:21:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:21:11,199 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 587 [2022-12-13 22:21:11,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 269.8) internal successors, (1349), 5 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:11,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:11,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 587 [2022-12-13 22:21:11,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:11,968 INFO L130 PetriNetUnfolder]: 5983/9974 cut-off events. [2022-12-13 22:21:11,969 INFO L131 PetriNetUnfolder]: For 3668/3668 co-relation queries the response was YES. [2022-12-13 22:21:11,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22012 conditions, 9974 events. 5983/9974 cut-off events. For 3668/3668 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 60585 event pairs, 4756 based on Foata normal form. 0/7335 useless extension candidates. Maximal degree in co-relation 19465. Up to 9506 conditions per place. [2022-12-13 22:21:11,995 INFO L137 encePairwiseOnDemand]: 579/587 looper letters, 88 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2022-12-13 22:21:11,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 561 flow [2022-12-13 22:21:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1425 transitions. [2022-12-13 22:21:11,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4855195911413969 [2022-12-13 22:21:11,997 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1425 transitions. [2022-12-13 22:21:11,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1425 transitions. [2022-12-13 22:21:11,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:11,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1425 transitions. [2022-12-13 22:21:12,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:12,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:12,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:12,003 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 355 flow. Second operand 5 states and 1425 transitions. [2022-12-13 22:21:12,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 561 flow [2022-12-13 22:21:12,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:12,006 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 389 flow [2022-12-13 22:21:12,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2022-12-13 22:21:12,006 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2022-12-13 22:21:12,006 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 389 flow [2022-12-13 22:21:12,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.8) internal successors, (1349), 5 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:12,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:12,007 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:12,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:21:12,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:12,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 550456561, now seen corresponding path program 1 times [2022-12-13 22:21:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111205823] [2022-12-13 22:21:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:12,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111205823] [2022-12-13 22:21:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111205823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:21:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987514474] [2022-12-13 22:21:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:12,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:21:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:21:12,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:21:12,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 587 [2022-12-13 22:21:12,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 266.42857142857144) internal successors, (1865), 7 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:12,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:12,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 587 [2022-12-13 22:21:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:13,497 INFO L130 PetriNetUnfolder]: 7218/12163 cut-off events. [2022-12-13 22:21:13,498 INFO L131 PetriNetUnfolder]: For 3045/3045 co-relation queries the response was YES. [2022-12-13 22:21:13,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27030 conditions, 12163 events. 7218/12163 cut-off events. For 3045/3045 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 78187 event pairs, 1070 based on Foata normal form. 90/9352 useless extension candidates. Maximal degree in co-relation 16694. Up to 8489 conditions per place. [2022-12-13 22:21:13,557 INFO L137 encePairwiseOnDemand]: 568/587 looper letters, 151 selfloop transitions, 31 changer transitions 0/188 dead transitions. [2022-12-13 22:21:13,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 188 transitions, 1005 flow [2022-12-13 22:21:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:21:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:21:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1759 transitions. [2022-12-13 22:21:13,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4994321408290744 [2022-12-13 22:21:13,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1759 transitions. [2022-12-13 22:21:13,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1759 transitions. [2022-12-13 22:21:13,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:13,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1759 transitions. [2022-12-13 22:21:13,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 293.1666666666667) internal successors, (1759), 6 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:13,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 587.0) internal successors, (4109), 7 states have internal predecessors, (4109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:13,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 587.0) internal successors, (4109), 7 states have internal predecessors, (4109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:13,566 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 389 flow. Second operand 6 states and 1759 transitions. [2022-12-13 22:21:13,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 188 transitions, 1005 flow [2022-12-13 22:21:13,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 188 transitions, 993 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:13,581 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 550 flow [2022-12-13 22:21:13,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2022-12-13 22:21:13,582 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 28 predicate places. [2022-12-13 22:21:13,582 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 550 flow [2022-12-13 22:21:13,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.42857142857144) internal successors, (1865), 7 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:13,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:13,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:13,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:21:13,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -90385092, now seen corresponding path program 1 times [2022-12-13 22:21:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:13,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488404783] [2022-12-13 22:21:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:13,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:13,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488404783] [2022-12-13 22:21:13,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488404783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:13,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:13,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282313298] [2022-12-13 22:21:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:13,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:13,633 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 587 [2022-12-13 22:21:13,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:13,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:13,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 587 [2022-12-13 22:21:13,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:14,367 INFO L130 PetriNetUnfolder]: 5433/9373 cut-off events. [2022-12-13 22:21:14,367 INFO L131 PetriNetUnfolder]: For 4308/4308 co-relation queries the response was YES. [2022-12-13 22:21:14,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22915 conditions, 9373 events. 5433/9373 cut-off events. For 4308/4308 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 56468 event pairs, 2856 based on Foata normal form. 0/7369 useless extension candidates. Maximal degree in co-relation 21369. Up to 5954 conditions per place. [2022-12-13 22:21:14,397 INFO L137 encePairwiseOnDemand]: 583/587 looper letters, 127 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2022-12-13 22:21:14,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 856 flow [2022-12-13 22:21:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 965 transitions. [2022-12-13 22:21:14,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5479840999432141 [2022-12-13 22:21:14,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 965 transitions. [2022-12-13 22:21:14,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 965 transitions. [2022-12-13 22:21:14,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:14,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 965 transitions. [2022-12-13 22:21:14,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:14,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:14,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:14,403 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 550 flow. Second operand 3 states and 965 transitions. [2022-12-13 22:21:14,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 856 flow [2022-12-13 22:21:14,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 136 transitions, 794 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-12-13 22:21:14,411 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 416 flow [2022-12-13 22:21:14,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2022-12-13 22:21:14,411 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2022-12-13 22:21:14,412 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 416 flow [2022-12-13 22:21:14,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:14,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:14,412 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:14,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:21:14,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -529763925, now seen corresponding path program 2 times [2022-12-13 22:21:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:14,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511482712] [2022-12-13 22:21:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:15,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511482712] [2022-12-13 22:21:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511482712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:15,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:15,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:21:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765906657] [2022-12-13 22:21:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:15,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:21:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:21:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:21:15,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 587 [2022-12-13 22:21:15,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 267.6666666666667) internal successors, (1606), 6 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:15,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:15,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 587 [2022-12-13 22:21:15,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:16,672 INFO L130 PetriNetUnfolder]: 5456/9296 cut-off events. [2022-12-13 22:21:16,672 INFO L131 PetriNetUnfolder]: For 3377/3377 co-relation queries the response was YES. [2022-12-13 22:21:16,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22282 conditions, 9296 events. 5456/9296 cut-off events. For 3377/3377 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 54449 event pairs, 1959 based on Foata normal form. 63/7459 useless extension candidates. Maximal degree in co-relation 18071. Up to 8079 conditions per place. [2022-12-13 22:21:16,697 INFO L137 encePairwiseOnDemand]: 580/587 looper letters, 106 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2022-12-13 22:21:16,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 123 transitions, 720 flow [2022-12-13 22:21:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:21:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:21:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1428 transitions. [2022-12-13 22:21:16,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48654173764906306 [2022-12-13 22:21:16,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1428 transitions. [2022-12-13 22:21:16,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1428 transitions. [2022-12-13 22:21:16,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:16,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1428 transitions. [2022-12-13 22:21:16,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 285.6) internal successors, (1428), 5 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:16,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:16,705 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 587.0) internal successors, (3522), 6 states have internal predecessors, (3522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:16,705 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 416 flow. Second operand 5 states and 1428 transitions. [2022-12-13 22:21:16,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 123 transitions, 720 flow [2022-12-13 22:21:16,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 123 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:21:16,710 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 397 flow [2022-12-13 22:21:16,711 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2022-12-13 22:21:16,711 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 20 predicate places. [2022-12-13 22:21:16,711 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 397 flow [2022-12-13 22:21:16,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.6666666666667) internal successors, (1606), 6 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:16,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:16,712 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:16,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:21:16,712 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:16,712 INFO L85 PathProgramCache]: Analyzing trace with hash 301750063, now seen corresponding path program 1 times [2022-12-13 22:21:16,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:16,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163892239] [2022-12-13 22:21:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:16,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:16,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163892239] [2022-12-13 22:21:16,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163892239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:21:16,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710878884] [2022-12-13 22:21:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:21:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:21:16,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:21:16,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 22:21:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:16,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 22:21:16,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:21:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:16,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:21:16,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710878884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:16,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:21:16,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 22:21:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301905402] [2022-12-13 22:21:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:21:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:21:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:21:16,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 587 [2022-12-13 22:21:16,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 397 flow. Second operand has 4 states, 4 states have (on average 290.75) internal successors, (1163), 4 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:16,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:16,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 587 [2022-12-13 22:21:16,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:17,719 INFO L130 PetriNetUnfolder]: 5055/8789 cut-off events. [2022-12-13 22:21:17,719 INFO L131 PetriNetUnfolder]: For 3722/3726 co-relation queries the response was YES. [2022-12-13 22:21:17,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20892 conditions, 8789 events. 5055/8789 cut-off events. For 3722/3726 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 54041 event pairs, 344 based on Foata normal form. 2/7081 useless extension candidates. Maximal degree in co-relation 16894. Up to 4376 conditions per place. [2022-12-13 22:21:17,742 INFO L137 encePairwiseOnDemand]: 584/587 looper letters, 193 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2022-12-13 22:21:17,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 203 transitions, 1207 flow [2022-12-13 22:21:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:21:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:21:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1308 transitions. [2022-12-13 22:21:17,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5570698466780238 [2022-12-13 22:21:17,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1308 transitions. [2022-12-13 22:21:17,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1308 transitions. [2022-12-13 22:21:17,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:17,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1308 transitions. [2022-12-13 22:21:17,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:17,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 587.0) internal successors, (2935), 5 states have internal predecessors, (2935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:17,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 587.0) internal successors, (2935), 5 states have internal predecessors, (2935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:17,748 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 397 flow. Second operand 4 states and 1308 transitions. [2022-12-13 22:21:17,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 203 transitions, 1207 flow [2022-12-13 22:21:17,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 203 transitions, 1163 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 22:21:17,754 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 377 flow [2022-12-13 22:21:17,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2022-12-13 22:21:17,755 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 18 predicate places. [2022-12-13 22:21:17,755 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 377 flow [2022-12-13 22:21:17,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 290.75) internal successors, (1163), 4 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:17,756 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:17,756 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:17,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:21:17,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 22:21:17,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash 301750177, now seen corresponding path program 1 times [2022-12-13 22:21:17,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:17,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953369924] [2022-12-13 22:21:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 22:21:18,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:18,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953369924] [2022-12-13 22:21:18,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953369924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:18,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:18,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898965677] [2022-12-13 22:21:18,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:18,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:18,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:18,016 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 587 [2022-12-13 22:21:18,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:18,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:18,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 587 [2022-12-13 22:21:18,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:18,712 INFO L130 PetriNetUnfolder]: 4812/8420 cut-off events. [2022-12-13 22:21:18,712 INFO L131 PetriNetUnfolder]: For 3755/3763 co-relation queries the response was YES. [2022-12-13 22:21:18,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20044 conditions, 8420 events. 4812/8420 cut-off events. For 3755/3763 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 50985 event pairs, 742 based on Foata normal form. 4/6910 useless extension candidates. Maximal degree in co-relation 16305. Up to 6507 conditions per place. [2022-12-13 22:21:18,755 INFO L137 encePairwiseOnDemand]: 583/587 looper letters, 125 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2022-12-13 22:21:18,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 137 transitions, 804 flow [2022-12-13 22:21:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2022-12-13 22:21:18,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5457126632595116 [2022-12-13 22:21:18,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 961 transitions. [2022-12-13 22:21:18,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 961 transitions. [2022-12-13 22:21:18,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:18,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 961 transitions. [2022-12-13 22:21:18,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:18,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:18,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:18,760 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 377 flow. Second operand 3 states and 961 transitions. [2022-12-13 22:21:18,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 137 transitions, 804 flow [2022-12-13 22:21:18,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:21:18,764 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 386 flow [2022-12-13 22:21:18,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2022-12-13 22:21:18,764 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 18 predicate places. [2022-12-13 22:21:18,764 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 386 flow [2022-12-13 22:21:18,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:18,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:18,765 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:18,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:21:18,765 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1478385293, now seen corresponding path program 1 times [2022-12-13 22:21:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:18,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048504598] [2022-12-13 22:21:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:18,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048504598] [2022-12-13 22:21:18,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048504598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:18,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:18,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293658794] [2022-12-13 22:21:18,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:18,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:18,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:18,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 587 [2022-12-13 22:21:18,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:18,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:18,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 587 [2022-12-13 22:21:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:19,513 INFO L130 PetriNetUnfolder]: 5378/9563 cut-off events. [2022-12-13 22:21:19,513 INFO L131 PetriNetUnfolder]: For 5286/5286 co-relation queries the response was YES. [2022-12-13 22:21:19,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23889 conditions, 9563 events. 5378/9563 cut-off events. For 5286/5286 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 60325 event pairs, 2555 based on Foata normal form. 36/8039 useless extension candidates. Maximal degree in co-relation 19301. Up to 7875 conditions per place. [2022-12-13 22:21:19,547 INFO L137 encePairwiseOnDemand]: 580/587 looper letters, 129 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-12-13 22:21:19,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 139 transitions, 815 flow [2022-12-13 22:21:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-12-13 22:21:19,549 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5485519591141397 [2022-12-13 22:21:19,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2022-12-13 22:21:19,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2022-12-13 22:21:19,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:19,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2022-12-13 22:21:19,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:19,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:19,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:19,552 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 386 flow. Second operand 3 states and 966 transitions. [2022-12-13 22:21:19,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 139 transitions, 815 flow [2022-12-13 22:21:19,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 139 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:19,557 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 402 flow [2022-12-13 22:21:19,557 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2022-12-13 22:21:19,558 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 20 predicate places. [2022-12-13 22:21:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 402 flow [2022-12-13 22:21:19,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:19,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:19,558 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:19,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:21:19,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1402845516, now seen corresponding path program 1 times [2022-12-13 22:21:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137428286] [2022-12-13 22:21:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137428286] [2022-12-13 22:21:19,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137428286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:19,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:19,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 22:21:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336462169] [2022-12-13 22:21:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:19,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 22:21:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 22:21:19,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 22:21:20,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 587 [2022-12-13 22:21:20,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 402 flow. Second operand has 11 states, 11 states have (on average 264.72727272727275) internal successors, (2912), 11 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:20,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:20,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 587 [2022-12-13 22:21:20,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:22,364 INFO L130 PetriNetUnfolder]: 6391/11149 cut-off events. [2022-12-13 22:21:22,364 INFO L131 PetriNetUnfolder]: For 5894/5894 co-relation queries the response was YES. [2022-12-13 22:21:22,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28880 conditions, 11149 events. 6391/11149 cut-off events. For 5894/5894 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 68550 event pairs, 4191 based on Foata normal form. 0/9545 useless extension candidates. Maximal degree in co-relation 20771. Up to 8083 conditions per place. [2022-12-13 22:21:22,401 INFO L137 encePairwiseOnDemand]: 572/587 looper letters, 169 selfloop transitions, 28 changer transitions 6/210 dead transitions. [2022-12-13 22:21:22,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 210 transitions, 1270 flow [2022-12-13 22:21:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:21:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 22:21:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3062 transitions. [2022-12-13 22:21:22,405 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47421403128387796 [2022-12-13 22:21:22,405 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3062 transitions. [2022-12-13 22:21:22,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3062 transitions. [2022-12-13 22:21:22,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:22,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3062 transitions. [2022-12-13 22:21:22,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 278.3636363636364) internal successors, (3062), 11 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:22,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 587.0) internal successors, (7044), 12 states have internal predecessors, (7044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:22,412 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 587.0) internal successors, (7044), 12 states have internal predecessors, (7044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:22,412 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 402 flow. Second operand 11 states and 3062 transitions. [2022-12-13 22:21:22,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 210 transitions, 1270 flow [2022-12-13 22:21:22,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 210 transitions, 1265 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:22,421 INFO L231 Difference]: Finished difference. Result has 111 places, 109 transitions, 575 flow [2022-12-13 22:21:22,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=575, PETRI_PLACES=111, PETRI_TRANSITIONS=109} [2022-12-13 22:21:22,421 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 34 predicate places. [2022-12-13 22:21:22,422 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 575 flow [2022-12-13 22:21:22,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 264.72727272727275) internal successors, (2912), 11 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:22,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:22,422 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] [2022-12-13 22:21:22,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:21:22,422 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1585692279, now seen corresponding path program 1 times [2022-12-13 22:21:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:22,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857994476] [2022-12-13 22:21:22,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857994476] [2022-12-13 22:21:23,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857994476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:23,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:23,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 22:21:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907828390] [2022-12-13 22:21:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:23,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 22:21:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:21:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:21:24,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 587 [2022-12-13 22:21:24,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 575 flow. Second operand has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:24,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:24,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 587 [2022-12-13 22:21:24,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:26,764 INFO L130 PetriNetUnfolder]: 6946/12080 cut-off events. [2022-12-13 22:21:26,764 INFO L131 PetriNetUnfolder]: For 7662/7662 co-relation queries the response was YES. [2022-12-13 22:21:26,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33007 conditions, 12080 events. 6946/12080 cut-off events. For 7662/7662 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 75302 event pairs, 2248 based on Foata normal form. 34/10596 useless extension candidates. Maximal degree in co-relation 21760. Up to 8804 conditions per place. [2022-12-13 22:21:26,810 INFO L137 encePairwiseOnDemand]: 569/587 looper letters, 265 selfloop transitions, 48 changer transitions 3/323 dead transitions. [2022-12-13 22:21:26,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 323 transitions, 2153 flow [2022-12-13 22:21:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 22:21:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-13 22:21:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5838 transitions. [2022-12-13 22:21:26,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.432412413895267 [2022-12-13 22:21:26,817 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5838 transitions. [2022-12-13 22:21:26,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5838 transitions. [2022-12-13 22:21:26,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:26,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5838 transitions. [2022-12-13 22:21:26,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 253.82608695652175) internal successors, (5838), 23 states have internal predecessors, (5838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:26,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 587.0) internal successors, (14088), 24 states have internal predecessors, (14088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:26,832 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 587.0) internal successors, (14088), 24 states have internal predecessors, (14088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:26,832 INFO L175 Difference]: Start difference. First operand has 111 places, 109 transitions, 575 flow. Second operand 23 states and 5838 transitions. [2022-12-13 22:21:26,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 323 transitions, 2153 flow [2022-12-13 22:21:26,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 323 transitions, 2100 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-13 22:21:26,848 INFO L231 Difference]: Finished difference. Result has 136 places, 124 transitions, 764 flow [2022-12-13 22:21:26,849 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=764, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2022-12-13 22:21:26,849 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 59 predicate places. [2022-12-13 22:21:26,849 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 764 flow [2022-12-13 22:21:26,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:26,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:26,849 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] [2022-12-13 22:21:26,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:21:26,850 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash -515324983, now seen corresponding path program 1 times [2022-12-13 22:21:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:26,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684630921] [2022-12-13 22:21:26,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:27,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684630921] [2022-12-13 22:21:27,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684630921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:27,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:27,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 22:21:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331897008] [2022-12-13 22:21:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 22:21:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:27,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:21:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:21:28,910 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 587 [2022-12-13 22:21:28,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 764 flow. Second operand has 15 states, 15 states have (on average 240.33333333333334) internal successors, (3605), 15 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:28,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:28,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 587 [2022-12-13 22:21:28,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:30,669 INFO L130 PetriNetUnfolder]: 6896/12022 cut-off events. [2022-12-13 22:21:30,670 INFO L131 PetriNetUnfolder]: For 9079/9079 co-relation queries the response was YES. [2022-12-13 22:21:30,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34636 conditions, 12022 events. 6896/12022 cut-off events. For 9079/9079 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 74707 event pairs, 2385 based on Foata normal form. 0/10528 useless extension candidates. Maximal degree in co-relation 22755. Up to 8804 conditions per place. [2022-12-13 22:21:30,721 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 208 selfloop transitions, 41 changer transitions 3/259 dead transitions. [2022-12-13 22:21:30,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 259 transitions, 1839 flow [2022-12-13 22:21:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:21:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 22:21:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4016 transitions. [2022-12-13 22:21:30,727 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42759795570698467 [2022-12-13 22:21:30,727 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4016 transitions. [2022-12-13 22:21:30,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4016 transitions. [2022-12-13 22:21:30,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:30,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4016 transitions. [2022-12-13 22:21:30,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 251.0) internal successors, (4016), 16 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:30,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:30,737 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:30,737 INFO L175 Difference]: Start difference. First operand has 136 places, 124 transitions, 764 flow. Second operand 16 states and 4016 transitions. [2022-12-13 22:21:30,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 259 transitions, 1839 flow [2022-12-13 22:21:30,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 259 transitions, 1731 flow, removed 18 selfloop flow, removed 13 redundant places. [2022-12-13 22:21:30,764 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 730 flow [2022-12-13 22:21:30,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=730, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2022-12-13 22:21:30,765 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 61 predicate places. [2022-12-13 22:21:30,765 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 730 flow [2022-12-13 22:21:30,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 240.33333333333334) internal successors, (3605), 15 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:30,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:30,766 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] [2022-12-13 22:21:30,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 22:21:30,766 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash -352434563, now seen corresponding path program 2 times [2022-12-13 22:21:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:30,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9971439] [2022-12-13 22:21:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:32,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:32,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9971439] [2022-12-13 22:21:32,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9971439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:32,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:32,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 22:21:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849968357] [2022-12-13 22:21:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:32,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 22:21:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:21:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:21:33,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 587 [2022-12-13 22:21:33,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 730 flow. Second operand has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:33,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:33,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 587 [2022-12-13 22:21:33,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:35,545 INFO L130 PetriNetUnfolder]: 7168/12504 cut-off events. [2022-12-13 22:21:35,545 INFO L131 PetriNetUnfolder]: For 8783/8783 co-relation queries the response was YES. [2022-12-13 22:21:35,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35893 conditions, 12504 events. 7168/12504 cut-off events. For 8783/8783 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 78905 event pairs, 2148 based on Foata normal form. 34/11014 useless extension candidates. Maximal degree in co-relation 22022. Up to 8199 conditions per place. [2022-12-13 22:21:35,604 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 248 selfloop transitions, 51 changer transitions 3/309 dead transitions. [2022-12-13 22:21:35,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 309 transitions, 2132 flow [2022-12-13 22:21:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 22:21:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 22:21:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5336 transitions. [2022-12-13 22:21:35,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4328709337227225 [2022-12-13 22:21:35,610 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5336 transitions. [2022-12-13 22:21:35,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5336 transitions. [2022-12-13 22:21:35,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:35,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5336 transitions. [2022-12-13 22:21:35,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 254.0952380952381) internal successors, (5336), 21 states have internal predecessors, (5336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:35,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 587.0) internal successors, (12914), 22 states have internal predecessors, (12914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:35,623 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 587.0) internal successors, (12914), 22 states have internal predecessors, (12914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:35,623 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 730 flow. Second operand 21 states and 5336 transitions. [2022-12-13 22:21:35,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 309 transitions, 2132 flow [2022-12-13 22:21:35,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 309 transitions, 2048 flow, removed 1 selfloop flow, removed 15 redundant places. [2022-12-13 22:21:35,651 INFO L231 Difference]: Finished difference. Result has 146 places, 129 transitions, 809 flow [2022-12-13 22:21:35,651 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=809, PETRI_PLACES=146, PETRI_TRANSITIONS=129} [2022-12-13 22:21:35,651 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 69 predicate places. [2022-12-13 22:21:35,651 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 129 transitions, 809 flow [2022-12-13 22:21:35,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:35,651 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:35,652 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] [2022-12-13 22:21:35,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 22:21:35,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:35,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1097137087, now seen corresponding path program 2 times [2022-12-13 22:21:35,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:35,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397841624] [2022-12-13 22:21:35,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:36,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:36,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397841624] [2022-12-13 22:21:36,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397841624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:36,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:36,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:21:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003455185] [2022-12-13 22:21:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:36,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:21:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:36,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:21:36,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:21:37,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 587 [2022-12-13 22:21:37,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 129 transitions, 809 flow. Second operand has 16 states, 16 states have (on average 240.25) internal successors, (3844), 16 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:37,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:37,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 587 [2022-12-13 22:21:37,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:39,505 INFO L130 PetriNetUnfolder]: 7118/12426 cut-off events. [2022-12-13 22:21:39,505 INFO L131 PetriNetUnfolder]: For 10702/10702 co-relation queries the response was YES. [2022-12-13 22:21:39,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36820 conditions, 12426 events. 7118/12426 cut-off events. For 10702/10702 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 78337 event pairs, 1960 based on Foata normal form. 0/10944 useless extension candidates. Maximal degree in co-relation 22618. Up to 8199 conditions per place. [2022-12-13 22:21:39,565 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 207 selfloop transitions, 46 changer transitions 3/263 dead transitions. [2022-12-13 22:21:39,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 263 transitions, 1892 flow [2022-12-13 22:21:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:21:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 22:21:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4015 transitions. [2022-12-13 22:21:39,570 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4274914821124361 [2022-12-13 22:21:39,570 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4015 transitions. [2022-12-13 22:21:39,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4015 transitions. [2022-12-13 22:21:39,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:39,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4015 transitions. [2022-12-13 22:21:39,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 250.9375) internal successors, (4015), 16 states have internal predecessors, (4015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:39,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:39,579 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:39,579 INFO L175 Difference]: Start difference. First operand has 146 places, 129 transitions, 809 flow. Second operand 16 states and 4015 transitions. [2022-12-13 22:21:39,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 263 transitions, 1892 flow [2022-12-13 22:21:39,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 263 transitions, 1822 flow, removed 7 selfloop flow, removed 14 redundant places. [2022-12-13 22:21:39,627 INFO L231 Difference]: Finished difference. Result has 147 places, 128 transitions, 825 flow [2022-12-13 22:21:39,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=825, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2022-12-13 22:21:39,627 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 70 predicate places. [2022-12-13 22:21:39,627 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 825 flow [2022-12-13 22:21:39,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 240.25) internal successors, (3844), 16 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:39,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:39,628 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] [2022-12-13 22:21:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 22:21:39,628 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:39,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -535462859, now seen corresponding path program 3 times [2022-12-13 22:21:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:39,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204321114] [2022-12-13 22:21:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:40,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204321114] [2022-12-13 22:21:40,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204321114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:40,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:40,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 22:21:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84681102] [2022-12-13 22:21:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:40,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 22:21:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:21:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:21:41,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 587 [2022-12-13 22:21:41,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 825 flow. Second operand has 15 states, 15 states have (on average 240.33333333333334) internal successors, (3605), 15 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:41,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:41,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 587 [2022-12-13 22:21:41,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:42,758 INFO L130 PetriNetUnfolder]: 7318/12774 cut-off events. [2022-12-13 22:21:42,758 INFO L131 PetriNetUnfolder]: For 10827/10827 co-relation queries the response was YES. [2022-12-13 22:21:42,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38001 conditions, 12774 events. 7318/12774 cut-off events. For 10827/10827 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 81191 event pairs, 1958 based on Foata normal form. 0/11292 useless extension candidates. Maximal degree in co-relation 22378. Up to 8233 conditions per place. [2022-12-13 22:21:42,823 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 200 selfloop transitions, 48 changer transitions 3/258 dead transitions. [2022-12-13 22:21:42,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 258 transitions, 1890 flow [2022-12-13 22:21:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 22:21:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 22:21:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3768 transitions. [2022-12-13 22:21:42,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42793867120954004 [2022-12-13 22:21:42,827 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3768 transitions. [2022-12-13 22:21:42,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3768 transitions. [2022-12-13 22:21:42,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:42,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3768 transitions. [2022-12-13 22:21:42,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 251.2) internal successors, (3768), 15 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:42,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:42,836 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:42,836 INFO L175 Difference]: Start difference. First operand has 147 places, 128 transitions, 825 flow. Second operand 15 states and 3768 transitions. [2022-12-13 22:21:42,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 258 transitions, 1890 flow [2022-12-13 22:21:42,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 258 transitions, 1796 flow, removed 0 selfloop flow, removed 15 redundant places. [2022-12-13 22:21:42,880 INFO L231 Difference]: Finished difference. Result has 149 places, 133 transitions, 895 flow [2022-12-13 22:21:42,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=895, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2022-12-13 22:21:42,880 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 72 predicate places. [2022-12-13 22:21:42,880 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 895 flow [2022-12-13 22:21:42,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 240.33333333333334) internal successors, (3605), 15 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:42,881 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:42,881 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] [2022-12-13 22:21:42,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 22:21:42,881 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:42,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -538201709, now seen corresponding path program 4 times [2022-12-13 22:21:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:42,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774731987] [2022-12-13 22:21:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774731987] [2022-12-13 22:21:43,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774731987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:43,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:43,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:21:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882666827] [2022-12-13 22:21:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:43,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:21:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:43,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:21:43,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:21:45,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 587 [2022-12-13 22:21:45,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 895 flow. Second operand has 16 states, 16 states have (on average 240.25) internal successors, (3844), 16 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:45,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:45,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 587 [2022-12-13 22:21:45,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:48,323 INFO L130 PetriNetUnfolder]: 7349/12837 cut-off events. [2022-12-13 22:21:48,323 INFO L131 PetriNetUnfolder]: For 13742/13742 co-relation queries the response was YES. [2022-12-13 22:21:48,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39420 conditions, 12837 events. 7349/12837 cut-off events. For 13742/13742 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 81966 event pairs, 2173 based on Foata normal form. 0/11375 useless extension candidates. Maximal degree in co-relation 23106. Up to 8036 conditions per place. [2022-12-13 22:21:48,371 INFO L137 encePairwiseOnDemand]: 569/587 looper letters, 209 selfloop transitions, 51 changer transitions 3/270 dead transitions. [2022-12-13 22:21:48,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 270 transitions, 2019 flow [2022-12-13 22:21:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:21:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 22:21:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4014 transitions. [2022-12-13 22:21:48,374 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4273850085178876 [2022-12-13 22:21:48,374 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4014 transitions. [2022-12-13 22:21:48,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4014 transitions. [2022-12-13 22:21:48,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:48,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4014 transitions. [2022-12-13 22:21:48,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 250.875) internal successors, (4014), 16 states have internal predecessors, (4014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:48,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:48,383 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:48,383 INFO L175 Difference]: Start difference. First operand has 149 places, 133 transitions, 895 flow. Second operand 16 states and 4014 transitions. [2022-12-13 22:21:48,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 270 transitions, 2019 flow [2022-12-13 22:21:48,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 270 transitions, 1951 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-12-13 22:21:48,455 INFO L231 Difference]: Finished difference. Result has 157 places, 136 transitions, 987 flow [2022-12-13 22:21:48,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=987, PETRI_PLACES=157, PETRI_TRANSITIONS=136} [2022-12-13 22:21:48,456 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 80 predicate places. [2022-12-13 22:21:48,456 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 136 transitions, 987 flow [2022-12-13 22:21:48,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 240.25) internal successors, (3844), 16 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:48,456 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:48,456 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] [2022-12-13 22:21:48,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 22:21:48,457 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:48,457 INFO L85 PathProgramCache]: Analyzing trace with hash -535462833, now seen corresponding path program 3 times [2022-12-13 22:21:48,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:48,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206522442] [2022-12-13 22:21:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:49,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:49,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206522442] [2022-12-13 22:21:49,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206522442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:49,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:49,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 22:21:49,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781305458] [2022-12-13 22:21:49,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:49,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 22:21:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:21:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:21:50,079 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 587 [2022-12-13 22:21:50,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 136 transitions, 987 flow. Second operand has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:50,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:50,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 587 [2022-12-13 22:21:50,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:51,896 INFO L130 PetriNetUnfolder]: 7299/12771 cut-off events. [2022-12-13 22:21:51,896 INFO L131 PetriNetUnfolder]: For 15447/15447 co-relation queries the response was YES. [2022-12-13 22:21:51,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40000 conditions, 12771 events. 7299/12771 cut-off events. For 15447/15447 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 81451 event pairs, 1967 based on Foata normal form. 34/11351 useless extension candidates. Maximal degree in co-relation 23240. Up to 8290 conditions per place. [2022-12-13 22:21:51,949 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 218 selfloop transitions, 50 changer transitions 3/278 dead transitions. [2022-12-13 22:21:51,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 278 transitions, 2126 flow [2022-12-13 22:21:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 22:21:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 22:21:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4328 transitions. [2022-12-13 22:21:51,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43371079266459567 [2022-12-13 22:21:51,954 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4328 transitions. [2022-12-13 22:21:51,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4328 transitions. [2022-12-13 22:21:51,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:51,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4328 transitions. [2022-12-13 22:21:51,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 254.58823529411765) internal successors, (4328), 17 states have internal predecessors, (4328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:51,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 587.0) internal successors, (10566), 18 states have internal predecessors, (10566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:51,963 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 587.0) internal successors, (10566), 18 states have internal predecessors, (10566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:51,963 INFO L175 Difference]: Start difference. First operand has 157 places, 136 transitions, 987 flow. Second operand 17 states and 4328 transitions. [2022-12-13 22:21:51,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 278 transitions, 2126 flow [2022-12-13 22:21:52,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 278 transitions, 2057 flow, removed 4 selfloop flow, removed 11 redundant places. [2022-12-13 22:21:52,041 INFO L231 Difference]: Finished difference. Result has 162 places, 135 transitions, 1003 flow [2022-12-13 22:21:52,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1003, PETRI_PLACES=162, PETRI_TRANSITIONS=135} [2022-12-13 22:21:52,041 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 85 predicate places. [2022-12-13 22:21:52,041 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 135 transitions, 1003 flow [2022-12-13 22:21:52,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:52,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:52,042 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] [2022-12-13 22:21:52,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 22:21:52,042 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -538535553, now seen corresponding path program 4 times [2022-12-13 22:21:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:52,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094017349] [2022-12-13 22:21:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:52,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094017349] [2022-12-13 22:21:52,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094017349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:52,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:52,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 22:21:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767454974] [2022-12-13 22:21:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:52,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 22:21:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 22:21:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-13 22:21:53,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 587 [2022-12-13 22:21:53,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 135 transitions, 1003 flow. Second operand has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:53,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:53,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 587 [2022-12-13 22:21:53,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:55,597 INFO L130 PetriNetUnfolder]: 7270/12732 cut-off events. [2022-12-13 22:21:55,597 INFO L131 PetriNetUnfolder]: For 14687/14687 co-relation queries the response was YES. [2022-12-13 22:21:55,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39903 conditions, 12732 events. 7270/12732 cut-off events. For 14687/14687 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 81489 event pairs, 2232 based on Foata normal form. 34/11304 useless extension candidates. Maximal degree in co-relation 23124. Up to 8003 conditions per place. [2022-12-13 22:21:55,660 INFO L137 encePairwiseOnDemand]: 572/587 looper letters, 204 selfloop transitions, 46 changer transitions 3/260 dead transitions. [2022-12-13 22:21:55,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 260 transitions, 2040 flow [2022-12-13 22:21:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 22:21:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 22:21:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3825 transitions. [2022-12-13 22:21:55,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.434412265758092 [2022-12-13 22:21:55,664 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3825 transitions. [2022-12-13 22:21:55,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3825 transitions. [2022-12-13 22:21:55,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:55,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3825 transitions. [2022-12-13 22:21:55,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 255.0) internal successors, (3825), 15 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:55,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:55,672 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:55,672 INFO L175 Difference]: Start difference. First operand has 162 places, 135 transitions, 1003 flow. Second operand 15 states and 3825 transitions. [2022-12-13 22:21:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 260 transitions, 2040 flow [2022-12-13 22:21:55,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 260 transitions, 1923 flow, removed 1 selfloop flow, removed 17 redundant places. [2022-12-13 22:21:55,738 INFO L231 Difference]: Finished difference. Result has 160 places, 135 transitions, 988 flow [2022-12-13 22:21:55,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=988, PETRI_PLACES=160, PETRI_TRANSITIONS=135} [2022-12-13 22:21:55,739 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 83 predicate places. [2022-12-13 22:21:55,739 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 135 transitions, 988 flow [2022-12-13 22:21:55,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 244.33333333333334) internal successors, (3665), 15 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:55,739 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:55,739 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:55,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 22:21:55,740 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1362449649, now seen corresponding path program 1 times [2022-12-13 22:21:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:55,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724910939] [2022-12-13 22:21:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724910939] [2022-12-13 22:21:55,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724910939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:55,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:55,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990748646] [2022-12-13 22:21:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:55,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:55,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:55,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 587 [2022-12-13 22:21:55,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 135 transitions, 988 flow. Second operand has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:55,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:55,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 587 [2022-12-13 22:21:55,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:56,862 INFO L130 PetriNetUnfolder]: 6346/11372 cut-off events. [2022-12-13 22:21:56,862 INFO L131 PetriNetUnfolder]: For 16032/16140 co-relation queries the response was YES. [2022-12-13 22:21:56,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35944 conditions, 11372 events. 6346/11372 cut-off events. For 16032/16140 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 73370 event pairs, 2389 based on Foata normal form. 108/10454 useless extension candidates. Maximal degree in co-relation 20780. Up to 9108 conditions per place. [2022-12-13 22:21:56,918 INFO L137 encePairwiseOnDemand]: 584/587 looper letters, 129 selfloop transitions, 1 changer transitions 0/143 dead transitions. [2022-12-13 22:21:56,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 143 transitions, 1285 flow [2022-12-13 22:21:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2022-12-13 22:21:56,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5269733106189665 [2022-12-13 22:21:56,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 928 transitions. [2022-12-13 22:21:56,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 928 transitions. [2022-12-13 22:21:56,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:56,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 928 transitions. [2022-12-13 22:21:56,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:56,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:56,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:56,922 INFO L175 Difference]: Start difference. First operand has 160 places, 135 transitions, 988 flow. Second operand 3 states and 928 transitions. [2022-12-13 22:21:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 143 transitions, 1285 flow [2022-12-13 22:21:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 1202 flow, removed 1 selfloop flow, removed 13 redundant places. [2022-12-13 22:21:56,990 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 899 flow [2022-12-13 22:21:56,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2022-12-13 22:21:56,990 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 70 predicate places. [2022-12-13 22:21:56,990 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 899 flow [2022-12-13 22:21:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:56,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:56,990 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:21:56,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 22:21:56,991 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1362449747, now seen corresponding path program 1 times [2022-12-13 22:21:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:56,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897660900] [2022-12-13 22:21:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 22:21:57,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:57,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897660900] [2022-12-13 22:21:57,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897660900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:57,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:21:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442257817] [2022-12-13 22:21:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:21:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:21:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:21:57,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 587 [2022-12-13 22:21:57,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:57,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:57,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 587 [2022-12-13 22:21:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:21:58,053 INFO L130 PetriNetUnfolder]: 5818/10486 cut-off events. [2022-12-13 22:21:58,053 INFO L131 PetriNetUnfolder]: For 14529/14637 co-relation queries the response was YES. [2022-12-13 22:21:58,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32620 conditions, 10486 events. 5818/10486 cut-off events. For 14529/14637 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 66902 event pairs, 2191 based on Foata normal form. 316/9994 useless extension candidates. Maximal degree in co-relation 18818. Up to 7082 conditions per place. [2022-12-13 22:21:58,103 INFO L137 encePairwiseOnDemand]: 582/587 looper letters, 143 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2022-12-13 22:21:58,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 160 transitions, 1284 flow [2022-12-13 22:21:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:21:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:21:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-12-13 22:21:58,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5343554798409994 [2022-12-13 22:21:58,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-12-13 22:21:58,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-12-13 22:21:58,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:21:58,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-12-13 22:21:58,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:58,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:58,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:58,106 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 899 flow. Second operand 3 states and 941 transitions. [2022-12-13 22:21:58,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 160 transitions, 1284 flow [2022-12-13 22:21:58,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 160 transitions, 1283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:21:58,170 INFO L231 Difference]: Finished difference. Result has 147 places, 132 transitions, 906 flow [2022-12-13 22:21:58,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=147, PETRI_TRANSITIONS=132} [2022-12-13 22:21:58,171 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 70 predicate places. [2022-12-13 22:21:58,171 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 132 transitions, 906 flow [2022-12-13 22:21:58,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:58,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:21:58,171 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] [2022-12-13 22:21:58,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 22:21:58,171 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:21:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:21:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2137179593, now seen corresponding path program 1 times [2022-12-13 22:21:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:21:58,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423113965] [2022-12-13 22:21:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:21:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:21:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:21:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:21:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:21:58,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423113965] [2022-12-13 22:21:58,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423113965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:21:58,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:21:58,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 22:21:58,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819157610] [2022-12-13 22:21:58,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:21:58,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 22:21:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:21:58,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 22:21:58,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-13 22:21:59,086 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 587 [2022-12-13 22:21:59,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 132 transitions, 906 flow. Second operand has 12 states, 12 states have (on average 251.83333333333334) internal successors, (3022), 12 states have internal predecessors, (3022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:21:59,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:21:59,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 587 [2022-12-13 22:21:59,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:00,681 INFO L130 PetriNetUnfolder]: 6821/12034 cut-off events. [2022-12-13 22:22:00,681 INFO L131 PetriNetUnfolder]: For 16920/16920 co-relation queries the response was YES. [2022-12-13 22:22:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39166 conditions, 12034 events. 6821/12034 cut-off events. For 16920/16920 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 76082 event pairs, 4819 based on Foata normal form. 36/11254 useless extension candidates. Maximal degree in co-relation 23825. Up to 10087 conditions per place. [2022-12-13 22:22:00,725 INFO L137 encePairwiseOnDemand]: 573/587 looper letters, 185 selfloop transitions, 33 changer transitions 3/228 dead transitions. [2022-12-13 22:22:00,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 228 transitions, 1906 flow [2022-12-13 22:22:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 22:22:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 22:22:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3648 transitions. [2022-12-13 22:22:00,728 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44390362618642004 [2022-12-13 22:22:00,728 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3648 transitions. [2022-12-13 22:22:00,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3648 transitions. [2022-12-13 22:22:00,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:00,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3648 transitions. [2022-12-13 22:22:00,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 260.57142857142856) internal successors, (3648), 14 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:00,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 587.0) internal successors, (8805), 15 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:00,735 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 587.0) internal successors, (8805), 15 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:00,736 INFO L175 Difference]: Start difference. First operand has 147 places, 132 transitions, 906 flow. Second operand 14 states and 3648 transitions. [2022-12-13 22:22:00,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 228 transitions, 1906 flow [2022-12-13 22:22:00,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 228 transitions, 1898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:22:00,847 INFO L231 Difference]: Finished difference. Result has 167 places, 146 transitions, 1198 flow [2022-12-13 22:22:00,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1198, PETRI_PLACES=167, PETRI_TRANSITIONS=146} [2022-12-13 22:22:00,847 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 90 predicate places. [2022-12-13 22:22:00,847 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 146 transitions, 1198 flow [2022-12-13 22:22:00,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 251.83333333333334) internal successors, (3022), 12 states have internal predecessors, (3022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:00,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:00,848 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] [2022-12-13 22:22:00,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 22:22:00,848 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2137179591, now seen corresponding path program 1 times [2022-12-13 22:22:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:00,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728885388] [2022-12-13 22:22:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:01,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728885388] [2022-12-13 22:22:01,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728885388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:01,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:01,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 22:22:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454146718] [2022-12-13 22:22:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:01,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 22:22:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 22:22:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 22:22:01,696 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 587 [2022-12-13 22:22:01,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 146 transitions, 1198 flow. Second operand has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:01,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:01,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 587 [2022-12-13 22:22:01,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:03,681 INFO L130 PetriNetUnfolder]: 8391/14677 cut-off events. [2022-12-13 22:22:03,681 INFO L131 PetriNetUnfolder]: For 21589/21589 co-relation queries the response was YES. [2022-12-13 22:22:03,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47851 conditions, 14677 events. 8391/14677 cut-off events. For 21589/21589 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 96277 event pairs, 3317 based on Foata normal form. 111/13901 useless extension candidates. Maximal degree in co-relation 39392. Up to 7518 conditions per place. [2022-12-13 22:22:03,744 INFO L137 encePairwiseOnDemand]: 573/587 looper letters, 230 selfloop transitions, 50 changer transitions 6/293 dead transitions. [2022-12-13 22:22:03,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 293 transitions, 2379 flow [2022-12-13 22:22:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 22:22:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 22:22:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3422 transitions. [2022-12-13 22:22:03,750 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44843401913248593 [2022-12-13 22:22:03,750 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3422 transitions. [2022-12-13 22:22:03,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3422 transitions. [2022-12-13 22:22:03,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:03,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3422 transitions. [2022-12-13 22:22:03,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 263.2307692307692) internal successors, (3422), 13 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:03,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 587.0) internal successors, (8218), 14 states have internal predecessors, (8218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:03,761 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 587.0) internal successors, (8218), 14 states have internal predecessors, (8218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:03,761 INFO L175 Difference]: Start difference. First operand has 167 places, 146 transitions, 1198 flow. Second operand 13 states and 3422 transitions. [2022-12-13 22:22:03,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 293 transitions, 2379 flow [2022-12-13 22:22:03,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 293 transitions, 2347 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 22:22:03,958 INFO L231 Difference]: Finished difference. Result has 179 places, 157 transitions, 1383 flow [2022-12-13 22:22:03,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1383, PETRI_PLACES=179, PETRI_TRANSITIONS=157} [2022-12-13 22:22:03,959 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 102 predicate places. [2022-12-13 22:22:03,959 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 157 transitions, 1383 flow [2022-12-13 22:22:03,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:03,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:03,959 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] [2022-12-13 22:22:03,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 22:22:03,960 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 482433360, now seen corresponding path program 1 times [2022-12-13 22:22:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:03,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668132958] [2022-12-13 22:22:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:04,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668132958] [2022-12-13 22:22:04,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668132958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:04,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:04,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 22:22:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034998242] [2022-12-13 22:22:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:04,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 22:22:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 22:22:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-13 22:22:05,256 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 587 [2022-12-13 22:22:05,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 157 transitions, 1383 flow. Second operand has 13 states, 13 states have (on average 248.76923076923077) internal successors, (3234), 13 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:05,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:05,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 587 [2022-12-13 22:22:05,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:07,094 INFO L130 PetriNetUnfolder]: 6919/12186 cut-off events. [2022-12-13 22:22:07,094 INFO L131 PetriNetUnfolder]: For 24321/24321 co-relation queries the response was YES. [2022-12-13 22:22:07,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42225 conditions, 12186 events. 6919/12186 cut-off events. For 24321/24321 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 77022 event pairs, 3665 based on Foata normal form. 68/11556 useless extension candidates. Maximal degree in co-relation 34980. Up to 7712 conditions per place. [2022-12-13 22:22:07,151 INFO L137 encePairwiseOnDemand]: 573/587 looper letters, 224 selfloop transitions, 50 changer transitions 3/284 dead transitions. [2022-12-13 22:22:07,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 284 transitions, 2442 flow [2022-12-13 22:22:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:22:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 22:22:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4145 transitions. [2022-12-13 22:22:07,154 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44133304940374785 [2022-12-13 22:22:07,154 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4145 transitions. [2022-12-13 22:22:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4145 transitions. [2022-12-13 22:22:07,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:07,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4145 transitions. [2022-12-13 22:22:07,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 259.0625) internal successors, (4145), 16 states have internal predecessors, (4145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:07,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:07,163 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:07,163 INFO L175 Difference]: Start difference. First operand has 179 places, 157 transitions, 1383 flow. Second operand 16 states and 4145 transitions. [2022-12-13 22:22:07,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 284 transitions, 2442 flow [2022-12-13 22:22:07,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 284 transitions, 2363 flow, removed 5 selfloop flow, removed 11 redundant places. [2022-12-13 22:22:07,335 INFO L231 Difference]: Finished difference. Result has 183 places, 147 transitions, 1330 flow [2022-12-13 22:22:07,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1330, PETRI_PLACES=183, PETRI_TRANSITIONS=147} [2022-12-13 22:22:07,335 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 106 predicate places. [2022-12-13 22:22:07,335 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 147 transitions, 1330 flow [2022-12-13 22:22:07,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 248.76923076923077) internal successors, (3234), 13 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:07,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:07,336 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] [2022-12-13 22:22:07,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 22:22:07,336 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1817995304, now seen corresponding path program 2 times [2022-12-13 22:22:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144546659] [2022-12-13 22:22:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:07,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144546659] [2022-12-13 22:22:07,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144546659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:07,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:07,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 22:22:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985722808] [2022-12-13 22:22:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:07,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 22:22:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 22:22:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-13 22:22:08,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 587 [2022-12-13 22:22:08,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 147 transitions, 1330 flow. Second operand has 13 states, 13 states have (on average 252.76923076923077) internal successors, (3286), 13 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:08,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:08,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 587 [2022-12-13 22:22:08,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:10,845 INFO L130 PetriNetUnfolder]: 8648/15150 cut-off events. [2022-12-13 22:22:10,845 INFO L131 PetriNetUnfolder]: For 28468/28468 co-relation queries the response was YES. [2022-12-13 22:22:10,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51294 conditions, 15150 events. 8648/15150 cut-off events. For 28468/28468 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 99638 event pairs, 1601 based on Foata normal form. 150/14439 useless extension candidates. Maximal degree in co-relation 44525. Up to 6851 conditions per place. [2022-12-13 22:22:10,937 INFO L137 encePairwiseOnDemand]: 568/587 looper letters, 254 selfloop transitions, 70 changer transitions 0/331 dead transitions. [2022-12-13 22:22:10,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 331 transitions, 2781 flow [2022-12-13 22:22:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:22:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 22:22:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4249 transitions. [2022-12-13 22:22:10,941 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45240630323679726 [2022-12-13 22:22:10,941 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4249 transitions. [2022-12-13 22:22:10,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4249 transitions. [2022-12-13 22:22:10,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:10,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4249 transitions. [2022-12-13 22:22:10,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 265.5625) internal successors, (4249), 16 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:10,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:10,950 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 587.0) internal successors, (9979), 17 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:10,950 INFO L175 Difference]: Start difference. First operand has 183 places, 147 transitions, 1330 flow. Second operand 16 states and 4249 transitions. [2022-12-13 22:22:10,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 331 transitions, 2781 flow [2022-12-13 22:22:11,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 331 transitions, 2682 flow, removed 0 selfloop flow, removed 15 redundant places. [2022-12-13 22:22:11,169 INFO L231 Difference]: Finished difference. Result has 187 places, 162 transitions, 1567 flow [2022-12-13 22:22:11,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1567, PETRI_PLACES=187, PETRI_TRANSITIONS=162} [2022-12-13 22:22:11,169 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 110 predicate places. [2022-12-13 22:22:11,169 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 162 transitions, 1567 flow [2022-12-13 22:22:11,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 252.76923076923077) internal successors, (3286), 13 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:11,170 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:11,170 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] [2022-12-13 22:22:11,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 22:22:11,170 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1817995306, now seen corresponding path program 1 times [2022-12-13 22:22:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076124082] [2022-12-13 22:22:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:11,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076124082] [2022-12-13 22:22:11,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076124082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:11,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:11,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 22:22:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479039264] [2022-12-13 22:22:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:11,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 22:22:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 22:22:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 22:22:12,477 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 587 [2022-12-13 22:22:12,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 162 transitions, 1567 flow. Second operand has 13 states, 13 states have (on average 248.76923076923077) internal successors, (3234), 13 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:12,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:12,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 587 [2022-12-13 22:22:12,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:14,821 INFO L130 PetriNetUnfolder]: 8533/14960 cut-off events. [2022-12-13 22:22:14,821 INFO L131 PetriNetUnfolder]: For 35318/35318 co-relation queries the response was YES. [2022-12-13 22:22:14,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53571 conditions, 14960 events. 8533/14960 cut-off events. For 35318/35318 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 98110 event pairs, 1637 based on Foata normal form. 75/14182 useless extension candidates. Maximal degree in co-relation 46662. Up to 6847 conditions per place. [2022-12-13 22:22:14,908 INFO L137 encePairwiseOnDemand]: 569/587 looper letters, 223 selfloop transitions, 64 changer transitions 0/294 dead transitions. [2022-12-13 22:22:14,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 294 transitions, 2690 flow [2022-12-13 22:22:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:22:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 22:22:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3160 transitions. [2022-12-13 22:22:14,911 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44860874503123227 [2022-12-13 22:22:14,911 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3160 transitions. [2022-12-13 22:22:14,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3160 transitions. [2022-12-13 22:22:14,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:14,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3160 transitions. [2022-12-13 22:22:14,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 263.3333333333333) internal successors, (3160), 12 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:14,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 587.0) internal successors, (7631), 13 states have internal predecessors, (7631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:14,917 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 587.0) internal successors, (7631), 13 states have internal predecessors, (7631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:14,917 INFO L175 Difference]: Start difference. First operand has 187 places, 162 transitions, 1567 flow. Second operand 12 states and 3160 transitions. [2022-12-13 22:22:14,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 294 transitions, 2690 flow [2022-12-13 22:22:15,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 294 transitions, 2601 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-13 22:22:15,143 INFO L231 Difference]: Finished difference. Result has 188 places, 162 transitions, 1629 flow [2022-12-13 22:22:15,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1629, PETRI_PLACES=188, PETRI_TRANSITIONS=162} [2022-12-13 22:22:15,144 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 111 predicate places. [2022-12-13 22:22:15,144 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 162 transitions, 1629 flow [2022-12-13 22:22:15,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 248.76923076923077) internal successors, (3234), 13 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:15,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:15,144 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] [2022-12-13 22:22:15,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 22:22:15,144 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1808785946, now seen corresponding path program 3 times [2022-12-13 22:22:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:15,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235511788] [2022-12-13 22:22:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:15,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:15,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235511788] [2022-12-13 22:22:15,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235511788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:15,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:15,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 22:22:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416022437] [2022-12-13 22:22:15,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:15,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 22:22:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:15,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 22:22:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-13 22:22:16,722 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 587 [2022-12-13 22:22:16,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 162 transitions, 1629 flow. Second operand has 13 states, 13 states have (on average 248.76923076923077) internal successors, (3234), 13 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:16,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:16,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 587 [2022-12-13 22:22:16,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:18,699 INFO L130 PetriNetUnfolder]: 7263/12880 cut-off events. [2022-12-13 22:22:18,699 INFO L131 PetriNetUnfolder]: For 35980/35980 co-relation queries the response was YES. [2022-12-13 22:22:18,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47080 conditions, 12880 events. 7263/12880 cut-off events. For 35980/35980 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 82569 event pairs, 1711 based on Foata normal form. 136/12324 useless extension candidates. Maximal degree in co-relation 37714. Up to 5825 conditions per place. [2022-12-13 22:22:18,781 INFO L137 encePairwiseOnDemand]: 574/587 looper letters, 194 selfloop transitions, 47 changer transitions 3/251 dead transitions. [2022-12-13 22:22:18,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 251 transitions, 2440 flow [2022-12-13 22:22:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:22:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 22:22:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3119 transitions. [2022-12-13 22:22:18,784 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44278818852924473 [2022-12-13 22:22:18,784 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3119 transitions. [2022-12-13 22:22:18,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3119 transitions. [2022-12-13 22:22:18,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:18,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3119 transitions. [2022-12-13 22:22:18,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 259.9166666666667) internal successors, (3119), 12 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:18,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 587.0) internal successors, (7631), 13 states have internal predecessors, (7631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:18,790 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 587.0) internal successors, (7631), 13 states have internal predecessors, (7631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:18,790 INFO L175 Difference]: Start difference. First operand has 188 places, 162 transitions, 1629 flow. Second operand 12 states and 3119 transitions. [2022-12-13 22:22:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 251 transitions, 2440 flow [2022-12-13 22:22:18,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 251 transitions, 2296 flow, removed 2 selfloop flow, removed 14 redundant places. [2022-12-13 22:22:18,999 INFO L231 Difference]: Finished difference. Result has 186 places, 152 transitions, 1492 flow [2022-12-13 22:22:19,000 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1492, PETRI_PLACES=186, PETRI_TRANSITIONS=152} [2022-12-13 22:22:19,000 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 109 predicate places. [2022-12-13 22:22:19,000 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 152 transitions, 1492 flow [2022-12-13 22:22:19,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 248.76923076923077) internal successors, (3234), 13 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:19,001 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:19,001 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] [2022-12-13 22:22:19,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 22:22:19,001 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash -463697640, now seen corresponding path program 2 times [2022-12-13 22:22:19,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:19,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52848670] [2022-12-13 22:22:19,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:19,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52848670] [2022-12-13 22:22:19,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52848670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:19,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:19,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 22:22:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703477334] [2022-12-13 22:22:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:19,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 22:22:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 22:22:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 22:22:20,191 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 587 [2022-12-13 22:22:20,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 152 transitions, 1492 flow. Second operand has 13 states, 13 states have (on average 249.76923076923077) internal successors, (3247), 13 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:20,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:20,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 587 [2022-12-13 22:22:20,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:22,352 INFO L130 PetriNetUnfolder]: 7420/13141 cut-off events. [2022-12-13 22:22:22,352 INFO L131 PetriNetUnfolder]: For 35623/35623 co-relation queries the response was YES. [2022-12-13 22:22:22,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48040 conditions, 13141 events. 7420/13141 cut-off events. For 35623/35623 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 84716 event pairs, 1607 based on Foata normal form. 34/12483 useless extension candidates. Maximal degree in co-relation 38840. Up to 6219 conditions per place. [2022-12-13 22:22:22,426 INFO L137 encePairwiseOnDemand]: 568/587 looper letters, 194 selfloop transitions, 56 changer transitions 3/260 dead transitions. [2022-12-13 22:22:22,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 260 transitions, 2455 flow [2022-12-13 22:22:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 22:22:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 22:22:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3141 transitions. [2022-12-13 22:22:22,429 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4459114139693356 [2022-12-13 22:22:22,429 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3141 transitions. [2022-12-13 22:22:22,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3141 transitions. [2022-12-13 22:22:22,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:22,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3141 transitions. [2022-12-13 22:22:22,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 261.75) internal successors, (3141), 12 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:22,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 587.0) internal successors, (7631), 13 states have internal predecessors, (7631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:22,435 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 587.0) internal successors, (7631), 13 states have internal predecessors, (7631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:22,435 INFO L175 Difference]: Start difference. First operand has 186 places, 152 transitions, 1492 flow. Second operand 12 states and 3141 transitions. [2022-12-13 22:22:22,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 260 transitions, 2455 flow [2022-12-13 22:22:22,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 260 transitions, 2373 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-12-13 22:22:22,645 INFO L231 Difference]: Finished difference. Result has 188 places, 156 transitions, 1591 flow [2022-12-13 22:22:22,645 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1591, PETRI_PLACES=188, PETRI_TRANSITIONS=156} [2022-12-13 22:22:22,646 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 111 predicate places. [2022-12-13 22:22:22,646 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 156 transitions, 1591 flow [2022-12-13 22:22:22,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 249.76923076923077) internal successors, (3247), 13 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:22,646 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:22,646 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] [2022-12-13 22:22:22,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 22:22:22,646 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -452399366, now seen corresponding path program 3 times [2022-12-13 22:22:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:22,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257782128] [2022-12-13 22:22:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:23,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:23,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257782128] [2022-12-13 22:22:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257782128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:23,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 22:22:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652629818] [2022-12-13 22:22:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 22:22:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 22:22:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 22:22:24,149 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 587 [2022-12-13 22:22:24,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 156 transitions, 1591 flow. Second operand has 13 states, 13 states have (on average 244.76923076923077) internal successors, (3182), 13 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:24,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:24,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 587 [2022-12-13 22:22:24,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:26,425 INFO L130 PetriNetUnfolder]: 7563/13400 cut-off events. [2022-12-13 22:22:26,425 INFO L131 PetriNetUnfolder]: For 40452/40452 co-relation queries the response was YES. [2022-12-13 22:22:26,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50017 conditions, 13400 events. 7563/13400 cut-off events. For 40452/40452 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 86755 event pairs, 1797 based on Foata normal form. 34/12742 useless extension candidates. Maximal degree in co-relation 40697. Up to 6262 conditions per place. [2022-12-13 22:22:26,492 INFO L137 encePairwiseOnDemand]: 573/587 looper letters, 194 selfloop transitions, 55 changer transitions 3/259 dead transitions. [2022-12-13 22:22:26,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 259 transitions, 2562 flow [2022-12-13 22:22:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 22:22:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 22:22:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3318 transitions. [2022-12-13 22:22:26,495 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43480539903027127 [2022-12-13 22:22:26,495 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3318 transitions. [2022-12-13 22:22:26,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3318 transitions. [2022-12-13 22:22:26,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:26,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3318 transitions. [2022-12-13 22:22:26,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 255.23076923076923) internal successors, (3318), 13 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:26,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 587.0) internal successors, (8218), 14 states have internal predecessors, (8218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:26,501 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 587.0) internal successors, (8218), 14 states have internal predecessors, (8218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:26,501 INFO L175 Difference]: Start difference. First operand has 188 places, 156 transitions, 1591 flow. Second operand 13 states and 3318 transitions. [2022-12-13 22:22:26,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 259 transitions, 2562 flow [2022-12-13 22:22:26,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 259 transitions, 2471 flow, removed 2 selfloop flow, removed 10 redundant places. [2022-12-13 22:22:26,728 INFO L231 Difference]: Finished difference. Result has 192 places, 158 transitions, 1674 flow [2022-12-13 22:22:26,728 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1674, PETRI_PLACES=192, PETRI_TRANSITIONS=158} [2022-12-13 22:22:26,728 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 115 predicate places. [2022-12-13 22:22:26,728 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 158 transitions, 1674 flow [2022-12-13 22:22:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 244.76923076923077) internal successors, (3182), 13 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:26,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:26,729 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] [2022-12-13 22:22:26,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 22:22:26,729 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1828054614, now seen corresponding path program 4 times [2022-12-13 22:22:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:26,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777522097] [2022-12-13 22:22:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:27,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777522097] [2022-12-13 22:22:27,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777522097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:27,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:27,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 22:22:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913145930] [2022-12-13 22:22:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:27,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 22:22:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 22:22:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 22:22:27,874 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 587 [2022-12-13 22:22:27,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 158 transitions, 1674 flow. Second operand has 12 states, 12 states have (on average 249.91666666666666) internal successors, (2999), 12 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:27,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:27,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 587 [2022-12-13 22:22:27,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:29,948 INFO L130 PetriNetUnfolder]: 7463/13224 cut-off events. [2022-12-13 22:22:29,949 INFO L131 PetriNetUnfolder]: For 43738/43738 co-relation queries the response was YES. [2022-12-13 22:22:29,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50284 conditions, 13224 events. 7463/13224 cut-off events. For 43738/43738 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 85069 event pairs, 1755 based on Foata normal form. 68/12600 useless extension candidates. Maximal degree in co-relation 40793. Up to 5892 conditions per place. [2022-12-13 22:22:30,022 INFO L137 encePairwiseOnDemand]: 576/587 looper letters, 183 selfloop transitions, 45 changer transitions 3/238 dead transitions. [2022-12-13 22:22:30,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 238 transitions, 2481 flow [2022-12-13 22:22:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 22:22:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 22:22:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2865 transitions. [2022-12-13 22:22:30,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4437045067368747 [2022-12-13 22:22:30,026 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2865 transitions. [2022-12-13 22:22:30,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2865 transitions. [2022-12-13 22:22:30,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:30,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2865 transitions. [2022-12-13 22:22:30,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 260.45454545454544) internal successors, (2865), 11 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:30,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 587.0) internal successors, (7044), 12 states have internal predecessors, (7044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:30,033 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 587.0) internal successors, (7044), 12 states have internal predecessors, (7044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:30,033 INFO L175 Difference]: Start difference. First operand has 192 places, 158 transitions, 1674 flow. Second operand 11 states and 2865 transitions. [2022-12-13 22:22:30,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 238 transitions, 2481 flow [2022-12-13 22:22:30,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 238 transitions, 2401 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-12-13 22:22:30,393 INFO L231 Difference]: Finished difference. Result has 194 places, 158 transitions, 1702 flow [2022-12-13 22:22:30,393 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1702, PETRI_PLACES=194, PETRI_TRANSITIONS=158} [2022-12-13 22:22:30,394 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 117 predicate places. [2022-12-13 22:22:30,394 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 158 transitions, 1702 flow [2022-12-13 22:22:30,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 249.91666666666666) internal successors, (2999), 12 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:30,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:30,394 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] [2022-12-13 22:22:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 22:22:30,395 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -378508741, now seen corresponding path program 1 times [2022-12-13 22:22:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:30,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457874355] [2022-12-13 22:22:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:30,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457874355] [2022-12-13 22:22:30,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457874355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:30,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:30,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:22:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723641714] [2022-12-13 22:22:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:30,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:22:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:22:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:22:30,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 587 [2022-12-13 22:22:30,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 158 transitions, 1702 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:30,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:30,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 587 [2022-12-13 22:22:30,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:31,692 INFO L130 PetriNetUnfolder]: 4822/8715 cut-off events. [2022-12-13 22:22:31,692 INFO L131 PetriNetUnfolder]: For 40929/41019 co-relation queries the response was YES. [2022-12-13 22:22:31,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36306 conditions, 8715 events. 4822/8715 cut-off events. For 40929/41019 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 55613 event pairs, 3573 based on Foata normal form. 172/8725 useless extension candidates. Maximal degree in co-relation 31489. Up to 6870 conditions per place. [2022-12-13 22:22:31,731 INFO L137 encePairwiseOnDemand]: 584/587 looper letters, 147 selfloop transitions, 2 changer transitions 3/162 dead transitions. [2022-12-13 22:22:31,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 162 transitions, 1975 flow [2022-12-13 22:22:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:22:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:22:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2022-12-13 22:22:31,732 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5309483248154457 [2022-12-13 22:22:31,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2022-12-13 22:22:31,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2022-12-13 22:22:31,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:31,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2022-12-13 22:22:31,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:31,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:31,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:31,734 INFO L175 Difference]: Start difference. First operand has 194 places, 158 transitions, 1702 flow. Second operand 3 states and 935 transitions. [2022-12-13 22:22:31,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 162 transitions, 1975 flow [2022-12-13 22:22:32,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 162 transitions, 1833 flow, removed 11 selfloop flow, removed 12 redundant places. [2022-12-13 22:22:32,034 INFO L231 Difference]: Finished difference. Result has 185 places, 146 transitions, 1465 flow [2022-12-13 22:22:32,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1465, PETRI_PLACES=185, PETRI_TRANSITIONS=146} [2022-12-13 22:22:32,035 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 108 predicate places. [2022-12-13 22:22:32,035 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 146 transitions, 1465 flow [2022-12-13 22:22:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:32,035 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:32,035 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] [2022-12-13 22:22:32,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 22:22:32,035 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1332010480, now seen corresponding path program 1 times [2022-12-13 22:22:32,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:32,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427255939] [2022-12-13 22:22:32,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:32,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-12-13 22:22:32,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427255939] [2022-12-13 22:22:32,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427255939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:32,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:32,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:22:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507239510] [2022-12-13 22:22:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:32,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:22:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:22:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:22:32,094 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 587 [2022-12-13 22:22:32,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 146 transitions, 1465 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:32,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:32,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 587 [2022-12-13 22:22:32,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:32,752 INFO L130 PetriNetUnfolder]: 2907/5556 cut-off events. [2022-12-13 22:22:32,752 INFO L131 PetriNetUnfolder]: For 21510/21528 co-relation queries the response was YES. [2022-12-13 22:22:32,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22680 conditions, 5556 events. 2907/5556 cut-off events. For 21510/21528 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 33338 event pairs, 763 based on Foata normal form. 588/6014 useless extension candidates. Maximal degree in co-relation 18434. Up to 4149 conditions per place. [2022-12-13 22:22:32,783 INFO L137 encePairwiseOnDemand]: 581/587 looper letters, 141 selfloop transitions, 8 changer transitions 1/160 dead transitions. [2022-12-13 22:22:32,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 160 transitions, 1836 flow [2022-12-13 22:22:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:22:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:22:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2022-12-13 22:22:32,784 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5252697331061896 [2022-12-13 22:22:32,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 925 transitions. [2022-12-13 22:22:32,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 925 transitions. [2022-12-13 22:22:32,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:32,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 925 transitions. [2022-12-13 22:22:32,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:32,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:32,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 587.0) internal successors, (2348), 4 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:32,786 INFO L175 Difference]: Start difference. First operand has 185 places, 146 transitions, 1465 flow. Second operand 3 states and 925 transitions. [2022-12-13 22:22:32,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 160 transitions, 1836 flow [2022-12-13 22:22:32,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 160 transitions, 1806 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 22:22:32,966 INFO L231 Difference]: Finished difference. Result has 184 places, 145 transitions, 1449 flow [2022-12-13 22:22:32,966 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=184, PETRI_TRANSITIONS=145} [2022-12-13 22:22:32,966 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 107 predicate places. [2022-12-13 22:22:32,966 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 145 transitions, 1449 flow [2022-12-13 22:22:32,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:32,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:32,967 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] [2022-12-13 22:22:32,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 22:22:32,967 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash -723867615, now seen corresponding path program 1 times [2022-12-13 22:22:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:32,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542532650] [2022-12-13 22:22:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:32,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:33,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542532650] [2022-12-13 22:22:33,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542532650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:33,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:33,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 22:22:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922083720] [2022-12-13 22:22:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:33,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 22:22:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 22:22:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 22:22:33,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 587 [2022-12-13 22:22:33,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 145 transitions, 1449 flow. Second operand has 11 states, 11 states have (on average 260.90909090909093) internal successors, (2870), 11 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:33,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:33,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 587 [2022-12-13 22:22:33,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:34,860 INFO L130 PetriNetUnfolder]: 3387/6511 cut-off events. [2022-12-13 22:22:34,860 INFO L131 PetriNetUnfolder]: For 22016/22016 co-relation queries the response was YES. [2022-12-13 22:22:34,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25583 conditions, 6511 events. 3387/6511 cut-off events. For 22016/22016 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 40282 event pairs, 841 based on Foata normal form. 0/6321 useless extension candidates. Maximal degree in co-relation 18723. Up to 2115 conditions per place. [2022-12-13 22:22:34,887 INFO L137 encePairwiseOnDemand]: 569/587 looper letters, 183 selfloop transitions, 66 changer transitions 2/257 dead transitions. [2022-12-13 22:22:34,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 257 transitions, 2431 flow [2022-12-13 22:22:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 22:22:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 22:22:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4040 transitions. [2022-12-13 22:22:34,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45883021010789327 [2022-12-13 22:22:34,890 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 4040 transitions. [2022-12-13 22:22:34,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 4040 transitions. [2022-12-13 22:22:34,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:34,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 4040 transitions. [2022-12-13 22:22:34,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 269.3333333333333) internal successors, (4040), 15 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:34,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:34,897 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:34,897 INFO L175 Difference]: Start difference. First operand has 184 places, 145 transitions, 1449 flow. Second operand 15 states and 4040 transitions. [2022-12-13 22:22:34,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 257 transitions, 2431 flow [2022-12-13 22:22:35,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 257 transitions, 2409 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 22:22:35,034 INFO L231 Difference]: Finished difference. Result has 200 places, 154 transitions, 1687 flow [2022-12-13 22:22:35,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1687, PETRI_PLACES=200, PETRI_TRANSITIONS=154} [2022-12-13 22:22:35,035 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 123 predicate places. [2022-12-13 22:22:35,035 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 154 transitions, 1687 flow [2022-12-13 22:22:35,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.90909090909093) internal successors, (2870), 11 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:35,035 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:35,035 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] [2022-12-13 22:22:35,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 22:22:35,035 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1651953769, now seen corresponding path program 1 times [2022-12-13 22:22:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:35,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663715205] [2022-12-13 22:22:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:35,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663715205] [2022-12-13 22:22:35,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663715205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:35,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:35,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:22:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357634667] [2022-12-13 22:22:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:35,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:22:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:22:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:22:37,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 587 [2022-12-13 22:22:37,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 154 transitions, 1687 flow. Second operand has 16 states, 16 states have (on average 254.0) internal successors, (4064), 16 states have internal predecessors, (4064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:37,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:37,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 587 [2022-12-13 22:22:37,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:39,195 INFO L130 PetriNetUnfolder]: 4775/9218 cut-off events. [2022-12-13 22:22:39,195 INFO L131 PetriNetUnfolder]: For 29988/29994 co-relation queries the response was YES. [2022-12-13 22:22:39,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34558 conditions, 9218 events. 4775/9218 cut-off events. For 29988/29994 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 62086 event pairs, 2599 based on Foata normal form. 42/9069 useless extension candidates. Maximal degree in co-relation 27624. Up to 3258 conditions per place. [2022-12-13 22:22:39,251 INFO L137 encePairwiseOnDemand]: 571/587 looper letters, 261 selfloop transitions, 50 changer transitions 6/323 dead transitions. [2022-12-13 22:22:39,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 323 transitions, 3093 flow [2022-12-13 22:22:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 22:22:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 22:22:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5014 transitions. [2022-12-13 22:22:39,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4495651394243701 [2022-12-13 22:22:39,255 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5014 transitions. [2022-12-13 22:22:39,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5014 transitions. [2022-12-13 22:22:39,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:39,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5014 transitions. [2022-12-13 22:22:39,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 263.89473684210526) internal successors, (5014), 19 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:39,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 587.0) internal successors, (11740), 20 states have internal predecessors, (11740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:39,263 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 587.0) internal successors, (11740), 20 states have internal predecessors, (11740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:39,263 INFO L175 Difference]: Start difference. First operand has 200 places, 154 transitions, 1687 flow. Second operand 19 states and 5014 transitions. [2022-12-13 22:22:39,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 323 transitions, 3093 flow [2022-12-13 22:22:39,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 323 transitions, 2972 flow, removed 15 selfloop flow, removed 10 redundant places. [2022-12-13 22:22:39,434 INFO L231 Difference]: Finished difference. Result has 216 places, 165 transitions, 1810 flow [2022-12-13 22:22:39,435 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1810, PETRI_PLACES=216, PETRI_TRANSITIONS=165} [2022-12-13 22:22:39,435 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 139 predicate places. [2022-12-13 22:22:39,435 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 165 transitions, 1810 flow [2022-12-13 22:22:39,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 254.0) internal successors, (4064), 16 states have internal predecessors, (4064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:39,435 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:39,435 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] [2022-12-13 22:22:39,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 22:22:39,435 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -142111809, now seen corresponding path program 2 times [2022-12-13 22:22:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574411814] [2022-12-13 22:22:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574411814] [2022-12-13 22:22:40,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574411814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:40,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:40,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-13 22:22:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52294345] [2022-12-13 22:22:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 22:22:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 22:22:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-12-13 22:22:42,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 587 [2022-12-13 22:22:42,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 165 transitions, 1810 flow. Second operand has 20 states, 20 states have (on average 237.6) internal successors, (4752), 20 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:42,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:42,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 587 [2022-12-13 22:22:42,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:44,339 INFO L130 PetriNetUnfolder]: 5058/9796 cut-off events. [2022-12-13 22:22:44,340 INFO L131 PetriNetUnfolder]: For 29539/29545 co-relation queries the response was YES. [2022-12-13 22:22:44,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36653 conditions, 9796 events. 5058/9796 cut-off events. For 29539/29545 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 67004 event pairs, 2010 based on Foata normal form. 20/9622 useless extension candidates. Maximal degree in co-relation 35713. Up to 4800 conditions per place. [2022-12-13 22:22:44,406 INFO L137 encePairwiseOnDemand]: 568/587 looper letters, 217 selfloop transitions, 62 changer transitions 12/297 dead transitions. [2022-12-13 22:22:44,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 297 transitions, 3023 flow [2022-12-13 22:22:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 22:22:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 22:22:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4674 transitions. [2022-12-13 22:22:44,410 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4190800681431005 [2022-12-13 22:22:44,410 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4674 transitions. [2022-12-13 22:22:44,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4674 transitions. [2022-12-13 22:22:44,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:44,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4674 transitions. [2022-12-13 22:22:44,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 246.0) internal successors, (4674), 19 states have internal predecessors, (4674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:44,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 587.0) internal successors, (11740), 20 states have internal predecessors, (11740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:44,420 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 587.0) internal successors, (11740), 20 states have internal predecessors, (11740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:44,420 INFO L175 Difference]: Start difference. First operand has 216 places, 165 transitions, 1810 flow. Second operand 19 states and 4674 transitions. [2022-12-13 22:22:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 297 transitions, 3023 flow [2022-12-13 22:22:44,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 297 transitions, 2957 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 22:22:44,589 INFO L231 Difference]: Finished difference. Result has 229 places, 168 transitions, 1926 flow [2022-12-13 22:22:44,590 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1926, PETRI_PLACES=229, PETRI_TRANSITIONS=168} [2022-12-13 22:22:44,590 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 152 predicate places. [2022-12-13 22:22:44,590 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 168 transitions, 1926 flow [2022-12-13 22:22:44,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 237.6) internal successors, (4752), 20 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:44,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:44,591 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] [2022-12-13 22:22:44,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 22:22:44,591 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -916640395, now seen corresponding path program 3 times [2022-12-13 22:22:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:44,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739232960] [2022-12-13 22:22:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739232960] [2022-12-13 22:22:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739232960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:45,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:45,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-13 22:22:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413109214] [2022-12-13 22:22:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 22:22:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 22:22:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-12-13 22:22:47,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 587 [2022-12-13 22:22:47,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 168 transitions, 1926 flow. Second operand has 20 states, 20 states have (on average 237.6) internal successors, (4752), 20 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:47,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:47,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 587 [2022-12-13 22:22:47,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:50,113 INFO L130 PetriNetUnfolder]: 5410/10505 cut-off events. [2022-12-13 22:22:50,113 INFO L131 PetriNetUnfolder]: For 32164/32170 co-relation queries the response was YES. [2022-12-13 22:22:50,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39610 conditions, 10505 events. 5410/10505 cut-off events. For 32164/32170 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 72138 event pairs, 1233 based on Foata normal form. 40/10351 useless extension candidates. Maximal degree in co-relation 38683. Up to 3531 conditions per place. [2022-12-13 22:22:50,185 INFO L137 encePairwiseOnDemand]: 568/587 looper letters, 207 selfloop transitions, 74 changer transitions 12/299 dead transitions. [2022-12-13 22:22:50,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 299 transitions, 3144 flow [2022-12-13 22:22:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 22:22:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 22:22:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4670 transitions. [2022-12-13 22:22:50,189 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4187214202456738 [2022-12-13 22:22:50,189 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4670 transitions. [2022-12-13 22:22:50,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4670 transitions. [2022-12-13 22:22:50,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:50,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4670 transitions. [2022-12-13 22:22:50,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 245.78947368421052) internal successors, (4670), 19 states have internal predecessors, (4670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:50,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 587.0) internal successors, (11740), 20 states have internal predecessors, (11740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:50,197 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 587.0) internal successors, (11740), 20 states have internal predecessors, (11740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:50,198 INFO L175 Difference]: Start difference. First operand has 229 places, 168 transitions, 1926 flow. Second operand 19 states and 4670 transitions. [2022-12-13 22:22:50,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 299 transitions, 3144 flow [2022-12-13 22:22:50,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 299 transitions, 3021 flow, removed 8 selfloop flow, removed 17 redundant places. [2022-12-13 22:22:50,383 INFO L231 Difference]: Finished difference. Result has 233 places, 172 transitions, 2031 flow [2022-12-13 22:22:50,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2031, PETRI_PLACES=233, PETRI_TRANSITIONS=172} [2022-12-13 22:22:50,383 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 156 predicate places. [2022-12-13 22:22:50,383 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 172 transitions, 2031 flow [2022-12-13 22:22:50,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 237.6) internal successors, (4752), 20 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:50,384 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:50,384 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] [2022-12-13 22:22:50,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 22:22:50,384 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash 406172103, now seen corresponding path program 4 times [2022-12-13 22:22:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:50,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527824985] [2022-12-13 22:22:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:51,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:51,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527824985] [2022-12-13 22:22:51,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527824985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:51,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:51,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-13 22:22:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27278178] [2022-12-13 22:22:51,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 22:22:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 22:22:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-12-13 22:22:53,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 587 [2022-12-13 22:22:53,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 172 transitions, 2031 flow. Second operand has 20 states, 20 states have (on average 237.6) internal successors, (4752), 20 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:53,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:53,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 587 [2022-12-13 22:22:53,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:55,699 INFO L130 PetriNetUnfolder]: 5378/10449 cut-off events. [2022-12-13 22:22:55,699 INFO L131 PetriNetUnfolder]: For 33711/33717 co-relation queries the response was YES. [2022-12-13 22:22:55,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39990 conditions, 10449 events. 5378/10449 cut-off events. For 33711/33717 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 71690 event pairs, 687 based on Foata normal form. 40/10295 useless extension candidates. Maximal degree in co-relation 36130. Up to 2960 conditions per place. [2022-12-13 22:22:55,768 INFO L137 encePairwiseOnDemand]: 569/587 looper letters, 197 selfloop transitions, 77 changer transitions 12/292 dead transitions. [2022-12-13 22:22:55,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 292 transitions, 3164 flow [2022-12-13 22:22:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 22:22:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 22:22:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4428 transitions. [2022-12-13 22:22:55,772 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4190800681431005 [2022-12-13 22:22:55,772 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4428 transitions. [2022-12-13 22:22:55,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4428 transitions. [2022-12-13 22:22:55,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:55,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4428 transitions. [2022-12-13 22:22:55,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:55,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 587.0) internal successors, (11153), 19 states have internal predecessors, (11153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:55,782 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 587.0) internal successors, (11153), 19 states have internal predecessors, (11153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:55,782 INFO L175 Difference]: Start difference. First operand has 233 places, 172 transitions, 2031 flow. Second operand 18 states and 4428 transitions. [2022-12-13 22:22:55,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 292 transitions, 3164 flow [2022-12-13 22:22:55,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 292 transitions, 3021 flow, removed 8 selfloop flow, removed 15 redundant places. [2022-12-13 22:22:55,983 INFO L231 Difference]: Finished difference. Result has 238 places, 173 transitions, 2105 flow [2022-12-13 22:22:55,983 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2105, PETRI_PLACES=238, PETRI_TRANSITIONS=173} [2022-12-13 22:22:55,983 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 161 predicate places. [2022-12-13 22:22:55,983 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 173 transitions, 2105 flow [2022-12-13 22:22:55,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 237.6) internal successors, (4752), 20 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:55,984 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:55,984 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] [2022-12-13 22:22:55,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 22:22:55,984 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash -646761033, now seen corresponding path program 2 times [2022-12-13 22:22:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:55,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891243968] [2022-12-13 22:22:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:22:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:22:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:22:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891243968] [2022-12-13 22:22:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891243968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:22:56,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:22:56,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 22:22:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505858645] [2022-12-13 22:22:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:22:56,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 22:22:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:22:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 22:22:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 22:22:57,159 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 587 [2022-12-13 22:22:57,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 173 transitions, 2105 flow. Second operand has 12 states, 12 states have (on average 257.6666666666667) internal successors, (3092), 12 states have internal predecessors, (3092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:57,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:22:57,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 587 [2022-12-13 22:22:57,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:22:58,913 INFO L130 PetriNetUnfolder]: 5344/10391 cut-off events. [2022-12-13 22:22:58,913 INFO L131 PetriNetUnfolder]: For 37118/37118 co-relation queries the response was YES. [2022-12-13 22:22:58,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40539 conditions, 10391 events. 5344/10391 cut-off events. For 37118/37118 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 71287 event pairs, 1856 based on Foata normal form. 20/10223 useless extension candidates. Maximal degree in co-relation 36517. Up to 4913 conditions per place. [2022-12-13 22:22:58,988 INFO L137 encePairwiseOnDemand]: 573/587 looper letters, 144 selfloop transitions, 69 changer transitions 2/221 dead transitions. [2022-12-13 22:22:58,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 221 transitions, 2750 flow [2022-12-13 22:22:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 22:22:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 22:22:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2655 transitions. [2022-12-13 22:22:58,990 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45229982964224874 [2022-12-13 22:22:58,990 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2655 transitions. [2022-12-13 22:22:58,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2655 transitions. [2022-12-13 22:22:58,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:22:58,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2655 transitions. [2022-12-13 22:22:58,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 265.5) internal successors, (2655), 10 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:58,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 587.0) internal successors, (6457), 11 states have internal predecessors, (6457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:58,995 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 587.0) internal successors, (6457), 11 states have internal predecessors, (6457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:58,995 INFO L175 Difference]: Start difference. First operand has 238 places, 173 transitions, 2105 flow. Second operand 10 states and 2655 transitions. [2022-12-13 22:22:58,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 221 transitions, 2750 flow [2022-12-13 22:22:59,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 221 transitions, 2603 flow, removed 2 selfloop flow, removed 16 redundant places. [2022-12-13 22:22:59,231 INFO L231 Difference]: Finished difference. Result has 230 places, 172 transitions, 2089 flow [2022-12-13 22:22:59,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2089, PETRI_PLACES=230, PETRI_TRANSITIONS=172} [2022-12-13 22:22:59,231 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 153 predicate places. [2022-12-13 22:22:59,231 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 172 transitions, 2089 flow [2022-12-13 22:22:59,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 257.6666666666667) internal successors, (3092), 12 states have internal predecessors, (3092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:22:59,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:22:59,232 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] [2022-12-13 22:22:59,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 22:22:59,232 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:22:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:22:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1620560769, now seen corresponding path program 1 times [2022-12-13 22:22:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:22:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742075023] [2022-12-13 22:22:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:22:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:22:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:23:00,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742075023] [2022-12-13 22:23:00,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742075023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:23:00,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:23:00,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:23:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906339394] [2022-12-13 22:23:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:23:00,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:23:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:23:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:23:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:23:01,693 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 587 [2022-12-13 22:23:01,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 172 transitions, 2089 flow. Second operand has 16 states, 16 states have (on average 256.1875) internal successors, (4099), 16 states have internal predecessors, (4099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:01,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:23:01,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 587 [2022-12-13 22:23:01,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:23:03,979 INFO L130 PetriNetUnfolder]: 5904/11421 cut-off events. [2022-12-13 22:23:03,979 INFO L131 PetriNetUnfolder]: For 40128/40134 co-relation queries the response was YES. [2022-12-13 22:23:04,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43423 conditions, 11421 events. 5904/11421 cut-off events. For 40128/40134 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 79495 event pairs, 2587 based on Foata normal form. 0/11147 useless extension candidates. Maximal degree in co-relation 38051. Up to 5771 conditions per place. [2022-12-13 22:23:04,050 INFO L137 encePairwiseOnDemand]: 573/587 looper letters, 231 selfloop transitions, 46 changer transitions 7/290 dead transitions. [2022-12-13 22:23:04,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 290 transitions, 3194 flow [2022-12-13 22:23:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 22:23:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 22:23:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3730 transitions. [2022-12-13 22:23:04,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45388172304697005 [2022-12-13 22:23:04,053 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3730 transitions. [2022-12-13 22:23:04,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3730 transitions. [2022-12-13 22:23:04,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:23:04,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3730 transitions. [2022-12-13 22:23:04,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 266.42857142857144) internal successors, (3730), 14 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:04,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 587.0) internal successors, (8805), 15 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:04,060 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 587.0) internal successors, (8805), 15 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:04,060 INFO L175 Difference]: Start difference. First operand has 230 places, 172 transitions, 2089 flow. Second operand 14 states and 3730 transitions. [2022-12-13 22:23:04,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 290 transitions, 3194 flow [2022-12-13 22:23:04,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 290 transitions, 3048 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-12-13 22:23:04,291 INFO L231 Difference]: Finished difference. Result has 236 places, 176 transitions, 2090 flow [2022-12-13 22:23:04,291 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2090, PETRI_PLACES=236, PETRI_TRANSITIONS=176} [2022-12-13 22:23:04,291 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 159 predicate places. [2022-12-13 22:23:04,291 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 176 transitions, 2090 flow [2022-12-13 22:23:04,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 256.1875) internal successors, (4099), 16 states have internal predecessors, (4099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:04,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:23:04,291 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] [2022-12-13 22:23:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 22:23:04,292 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:23:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:23:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1620560796, now seen corresponding path program 1 times [2022-12-13 22:23:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:23:04,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519294480] [2022-12-13 22:23:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:23:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:23:05,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519294480] [2022-12-13 22:23:05,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519294480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:23:05,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:23:05,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:23:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119145009] [2022-12-13 22:23:05,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:23:05,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:23:05,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:23:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:23:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:23:06,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 587 [2022-12-13 22:23:06,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 176 transitions, 2090 flow. Second operand has 16 states, 16 states have (on average 250.1875) internal successors, (4003), 16 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:06,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:23:06,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 587 [2022-12-13 22:23:06,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:23:08,524 INFO L130 PetriNetUnfolder]: 5484/10617 cut-off events. [2022-12-13 22:23:08,524 INFO L131 PetriNetUnfolder]: For 38030/38036 co-relation queries the response was YES. [2022-12-13 22:23:08,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40878 conditions, 10617 events. 5484/10617 cut-off events. For 38030/38036 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 72756 event pairs, 2669 based on Foata normal form. 0/10483 useless extension candidates. Maximal degree in co-relation 39190. Up to 5763 conditions per place. [2022-12-13 22:23:08,575 INFO L137 encePairwiseOnDemand]: 571/587 looper letters, 209 selfloop transitions, 46 changer transitions 16/277 dead transitions. [2022-12-13 22:23:08,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 277 transitions, 3063 flow [2022-12-13 22:23:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 22:23:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 22:23:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3637 transitions. [2022-12-13 22:23:08,577 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4425651009978097 [2022-12-13 22:23:08,577 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3637 transitions. [2022-12-13 22:23:08,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3637 transitions. [2022-12-13 22:23:08,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:23:08,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3637 transitions. [2022-12-13 22:23:08,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 259.7857142857143) internal successors, (3637), 14 states have internal predecessors, (3637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:08,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 587.0) internal successors, (8805), 15 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:08,583 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 587.0) internal successors, (8805), 15 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:08,583 INFO L175 Difference]: Start difference. First operand has 236 places, 176 transitions, 2090 flow. Second operand 14 states and 3637 transitions. [2022-12-13 22:23:08,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 277 transitions, 3063 flow [2022-12-13 22:23:08,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 277 transitions, 2976 flow, removed 5 selfloop flow, removed 12 redundant places. [2022-12-13 22:23:08,811 INFO L231 Difference]: Finished difference. Result has 237 places, 173 transitions, 2067 flow [2022-12-13 22:23:08,812 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2067, PETRI_PLACES=237, PETRI_TRANSITIONS=173} [2022-12-13 22:23:08,812 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 160 predicate places. [2022-12-13 22:23:08,812 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 173 transitions, 2067 flow [2022-12-13 22:23:08,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 250.1875) internal successors, (4003), 16 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:08,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:23:08,812 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] [2022-12-13 22:23:08,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 22:23:08,813 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:23:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:23:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash -230833419, now seen corresponding path program 2 times [2022-12-13 22:23:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:23:08,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926436937] [2022-12-13 22:23:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:23:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:23:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926436937] [2022-12-13 22:23:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926436937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:23:09,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:23:09,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:23:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417010930] [2022-12-13 22:23:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:23:09,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:23:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:23:09,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:23:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:23:10,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 587 [2022-12-13 22:23:10,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 173 transitions, 2067 flow. Second operand has 16 states, 16 states have (on average 250.1875) internal successors, (4003), 16 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:10,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:23:10,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 587 [2022-12-13 22:23:10,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:23:13,077 INFO L130 PetriNetUnfolder]: 5465/10594 cut-off events. [2022-12-13 22:23:13,077 INFO L131 PetriNetUnfolder]: For 37444/37450 co-relation queries the response was YES. [2022-12-13 22:23:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40977 conditions, 10594 events. 5465/10594 cut-off events. For 37444/37450 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 71602 event pairs, 1786 based on Foata normal form. 120/10700 useless extension candidates. Maximal degree in co-relation 37610. Up to 3617 conditions per place. [2022-12-13 22:23:13,160 INFO L137 encePairwiseOnDemand]: 569/587 looper letters, 199 selfloop transitions, 58 changer transitions 19/282 dead transitions. [2022-12-13 22:23:13,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 282 transitions, 3105 flow [2022-12-13 22:23:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 22:23:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 22:23:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3887 transitions. [2022-12-13 22:23:13,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44145371947756956 [2022-12-13 22:23:13,164 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3887 transitions. [2022-12-13 22:23:13,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3887 transitions. [2022-12-13 22:23:13,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:23:13,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3887 transitions. [2022-12-13 22:23:13,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 259.1333333333333) internal successors, (3887), 15 states have internal predecessors, (3887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:13,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:13,171 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:13,171 INFO L175 Difference]: Start difference. First operand has 237 places, 173 transitions, 2067 flow. Second operand 15 states and 3887 transitions. [2022-12-13 22:23:13,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 282 transitions, 3105 flow [2022-12-13 22:23:13,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3013 flow, removed 0 selfloop flow, removed 13 redundant places. [2022-12-13 22:23:13,422 INFO L231 Difference]: Finished difference. Result has 239 places, 174 transitions, 2112 flow [2022-12-13 22:23:13,423 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2112, PETRI_PLACES=239, PETRI_TRANSITIONS=174} [2022-12-13 22:23:13,423 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 162 predicate places. [2022-12-13 22:23:13,423 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 174 transitions, 2112 flow [2022-12-13 22:23:13,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 250.1875) internal successors, (4003), 16 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:13,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:23:13,424 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] [2022-12-13 22:23:13,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 22:23:13,424 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:23:13,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:23:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1351353699, now seen corresponding path program 3 times [2022-12-13 22:23:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:23:13,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386015074] [2022-12-13 22:23:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:23:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:23:14,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386015074] [2022-12-13 22:23:14,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386015074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:23:14,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:23:14,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 22:23:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691687933] [2022-12-13 22:23:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:23:14,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 22:23:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:23:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 22:23:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-12-13 22:23:15,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 587 [2022-12-13 22:23:15,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 174 transitions, 2112 flow. Second operand has 16 states, 16 states have (on average 250.1875) internal successors, (4003), 16 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:15,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:23:15,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 587 [2022-12-13 22:23:15,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:23:17,593 INFO L130 PetriNetUnfolder]: 5155/10034 cut-off events. [2022-12-13 22:23:17,593 INFO L131 PetriNetUnfolder]: For 38098/38104 co-relation queries the response was YES. [2022-12-13 22:23:17,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39846 conditions, 10034 events. 5155/10034 cut-off events. For 38098/38104 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 67401 event pairs, 855 based on Foata normal form. 120/10140 useless extension candidates. Maximal degree in co-relation 33470. Up to 3258 conditions per place. [2022-12-13 22:23:17,654 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 187 selfloop transitions, 65 changer transitions 19/277 dead transitions. [2022-12-13 22:23:17,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 277 transitions, 3106 flow [2022-12-13 22:23:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 22:23:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 22:23:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3885 transitions. [2022-12-13 22:23:17,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44122657580919933 [2022-12-13 22:23:17,658 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3885 transitions. [2022-12-13 22:23:17,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3885 transitions. [2022-12-13 22:23:17,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:23:17,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3885 transitions. [2022-12-13 22:23:17,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 259.0) internal successors, (3885), 15 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:17,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:17,664 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 587.0) internal successors, (9392), 16 states have internal predecessors, (9392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:17,664 INFO L175 Difference]: Start difference. First operand has 239 places, 174 transitions, 2112 flow. Second operand 15 states and 3885 transitions. [2022-12-13 22:23:17,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 277 transitions, 3106 flow [2022-12-13 22:23:17,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 277 transitions, 3004 flow, removed 1 selfloop flow, removed 12 redundant places. [2022-12-13 22:23:17,894 INFO L231 Difference]: Finished difference. Result has 242 places, 174 transitions, 2158 flow [2022-12-13 22:23:17,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2158, PETRI_PLACES=242, PETRI_TRANSITIONS=174} [2022-12-13 22:23:17,894 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 165 predicate places. [2022-12-13 22:23:17,894 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 174 transitions, 2158 flow [2022-12-13 22:23:17,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 250.1875) internal successors, (4003), 16 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:17,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:23:17,895 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:23:17,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 22:23:17,895 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:23:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:23:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1438737120, now seen corresponding path program 1 times [2022-12-13 22:23:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:23:17,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763794078] [2022-12-13 22:23:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:23:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:23:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763794078] [2022-12-13 22:23:18,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763794078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:23:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20831706] [2022-12-13 22:23:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:18,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:23:18,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:23:18,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:23:18,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 22:23:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:18,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 22:23:18,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:23:18,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 22:23:18,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 22:23:18,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:23:18,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 22:23:18,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:23:18,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-12-13 22:23:18,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 22:23:18,938 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 22:23:18,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-13 22:23:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:19,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:23:22,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:22,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 66 [2022-12-13 22:23:22,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:22,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2022-12-13 22:23:22,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-12-13 22:23:22,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-13 22:23:22,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:22,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2022-12-13 22:23:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:22,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20831706] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:23:22,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:23:22,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 39 [2022-12-13 22:23:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838090104] [2022-12-13 22:23:22,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:23:22,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 22:23:22,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:23:22,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 22:23:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1424, Unknown=20, NotChecked=0, Total=1640 [2022-12-13 22:23:24,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:26,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:23:27,624 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 587 [2022-12-13 22:23:27,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 174 transitions, 2158 flow. Second operand has 41 states, 41 states have (on average 212.21951219512195) internal successors, (8701), 41 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:27,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:23:27,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 587 [2022-12-13 22:23:27,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:23:31,480 INFO L130 PetriNetUnfolder]: 5334/10389 cut-off events. [2022-12-13 22:23:31,480 INFO L131 PetriNetUnfolder]: For 40707/40707 co-relation queries the response was YES. [2022-12-13 22:23:31,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41288 conditions, 10389 events. 5334/10389 cut-off events. For 40707/40707 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 69998 event pairs, 1211 based on Foata normal form. 0/10387 useless extension candidates. Maximal degree in co-relation 35249. Up to 2592 conditions per place. [2022-12-13 22:23:31,528 INFO L137 encePairwiseOnDemand]: 570/587 looper letters, 223 selfloop transitions, 89 changer transitions 30/348 dead transitions. [2022-12-13 22:23:31,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 348 transitions, 3629 flow [2022-12-13 22:23:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 22:23:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 22:23:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5249 transitions. [2022-12-13 22:23:31,532 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3725865985235662 [2022-12-13 22:23:31,533 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5249 transitions. [2022-12-13 22:23:31,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5249 transitions. [2022-12-13 22:23:31,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:23:31,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5249 transitions. [2022-12-13 22:23:31,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 218.70833333333334) internal successors, (5249), 24 states have internal predecessors, (5249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:31,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 587.0) internal successors, (14675), 25 states have internal predecessors, (14675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:31,543 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 587.0) internal successors, (14675), 25 states have internal predecessors, (14675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:31,543 INFO L175 Difference]: Start difference. First operand has 242 places, 174 transitions, 2158 flow. Second operand 24 states and 5249 transitions. [2022-12-13 22:23:31,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 348 transitions, 3629 flow [2022-12-13 22:23:31,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 348 transitions, 3497 flow, removed 4 selfloop flow, removed 13 redundant places. [2022-12-13 22:23:31,770 INFO L231 Difference]: Finished difference. Result has 251 places, 178 transitions, 2232 flow [2022-12-13 22:23:31,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2232, PETRI_PLACES=251, PETRI_TRANSITIONS=178} [2022-12-13 22:23:31,771 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 174 predicate places. [2022-12-13 22:23:31,771 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 178 transitions, 2232 flow [2022-12-13 22:23:31,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 212.21951219512195) internal successors, (8701), 41 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:31,772 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:23:31,772 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:23:31,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 22:23:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:23:31,973 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:23:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:23:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1438737094, now seen corresponding path program 1 times [2022-12-13 22:23:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:23:31,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692619417] [2022-12-13 22:23:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:31,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:23:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:23:33,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692619417] [2022-12-13 22:23:33,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692619417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:23:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715132090] [2022-12-13 22:23:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:23:33,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:23:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:23:33,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:23:33,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 22:23:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:23:33,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 80 conjunts are in the unsatisfiable core [2022-12-13 22:23:33,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:23:33,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-12-13 22:23:33,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:23:33,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-13 22:23:33,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:23:33,637 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 22:23:33,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 22:23:33,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-12-13 22:23:33,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 22:23:33,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:23:33,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-12-13 22:23:34,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:23:34,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:23:34,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-12-13 22:23:34,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-12-13 22:23:34,423 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-12-13 22:23:34,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-12-13 22:23:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:23:34,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:23:38,543 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_2222) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2217 1))))) is different from false [2022-12-13 22:23:38,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2217 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_2222) .cse1) 2147483647)))) is different from false [2022-12-13 22:23:38,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2217 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_2222) .cse1) 2147483647)))) is different from false [2022-12-13 22:23:38,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2212 Int) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2212) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2217 1)) (not (<= v_ArrVal_2212 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_2222) .cse1) 2147483647)))) is different from false [2022-12-13 22:23:38,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2212 Int) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2212) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2217 1)) (< 2147483647 v_ArrVal_2212) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_2222) .cse1) 2147483647)))) is different from false [2022-12-13 22:23:38,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2210 Int) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2212 Int) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2210)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2212) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_2222) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2217 1)) (< 2147483647 v_ArrVal_2212)))) is different from false [2022-12-13 22:23:38,655 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2210 Int) (v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2212 Int) (v_ArrVal_2222 Int) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_2210)))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_2212) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2216) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2217 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2217) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2219) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_2222) .cse1) 2147483647) (< 2147483647 v_ArrVal_2212)))) is different from false [2022-12-13 22:23:40,129 INFO L321 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2022-12-13 22:23:40,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 772 treesize of output 459 [2022-12-13 22:23:40,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:23:40,189 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-13 22:23:40,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 487 treesize of output 480 [2022-12-13 22:23:40,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 199 [2022-12-13 22:23:40,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:40,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 260 [2022-12-13 22:23:40,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-12-13 22:23:40,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-12-13 22:23:40,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:23:40,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-12-13 22:23:40,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 22:23:40,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:40,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 215 treesize of output 227 [2022-12-13 22:23:41,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:41,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 506 treesize of output 446 [2022-12-13 22:23:42,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 22:23:42,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 310 treesize of output 256 [2022-12-13 22:23:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 22:23:42,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715132090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:23:42,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:23:42,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2022-12-13 22:23:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330656760] [2022-12-13 22:23:42,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:23:42,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 22:23:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:23:42,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 22:23:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=3211, Unknown=8, NotChecked=854, Total=4422 [2022-12-13 22:23:42,682 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 587 [2022-12-13 22:23:42,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 178 transitions, 2232 flow. Second operand has 67 states, 67 states have (on average 198.97014925373134) internal successors, (13331), 67 states have internal predecessors, (13331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:23:42,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:23:42,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 587 [2022-12-13 22:23:42,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:24:12,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:24:20,963 INFO L130 PetriNetUnfolder]: 7578/14726 cut-off events. [2022-12-13 22:24:20,964 INFO L131 PetriNetUnfolder]: For 60043/60067 co-relation queries the response was YES. [2022-12-13 22:24:21,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57368 conditions, 14726 events. 7578/14726 cut-off events. For 60043/60067 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 103652 event pairs, 2705 based on Foata normal form. 14/14728 useless extension candidates. Maximal degree in co-relation 46921. Up to 3170 conditions per place. [2022-12-13 22:24:21,037 INFO L137 encePairwiseOnDemand]: 555/587 looper letters, 345 selfloop transitions, 150 changer transitions 23/524 dead transitions. [2022-12-13 22:24:21,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 524 transitions, 5279 flow [2022-12-13 22:24:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 22:24:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-13 22:24:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 10433 transitions. [2022-12-13 22:24:21,045 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3484985135451114 [2022-12-13 22:24:21,045 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 10433 transitions. [2022-12-13 22:24:21,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 10433 transitions. [2022-12-13 22:24:21,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:24:21,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 10433 transitions. [2022-12-13 22:24:21,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 204.5686274509804) internal successors, (10433), 51 states have internal predecessors, (10433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:21,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 587.0) internal successors, (30524), 52 states have internal predecessors, (30524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:21,068 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 587.0) internal successors, (30524), 52 states have internal predecessors, (30524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:21,068 INFO L175 Difference]: Start difference. First operand has 251 places, 178 transitions, 2232 flow. Second operand 51 states and 10433 transitions. [2022-12-13 22:24:21,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 524 transitions, 5279 flow [2022-12-13 22:24:21,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 524 transitions, 4959 flow, removed 26 selfloop flow, removed 22 redundant places. [2022-12-13 22:24:21,373 INFO L231 Difference]: Finished difference. Result has 297 places, 258 transitions, 3217 flow [2022-12-13 22:24:21,373 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=3217, PETRI_PLACES=297, PETRI_TRANSITIONS=258} [2022-12-13 22:24:21,373 INFO L288 CegarLoopForPetriNet]: 77 programPoint places, 220 predicate places. [2022-12-13 22:24:21,373 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 258 transitions, 3217 flow [2022-12-13 22:24:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 198.97014925373134) internal successors, (13331), 67 states have internal predecessors, (13331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:24:21,374 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:24:21,375 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:24:21,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 22:24:21,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:24:21,576 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-13 22:24:21,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:24:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1621100224, now seen corresponding path program 2 times [2022-12-13 22:24:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:24:21,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671506166] [2022-12-13 22:24:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:24:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:24:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:24:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:24:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671506166] [2022-12-13 22:24:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671506166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:24:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061359164] [2022-12-13 22:24:23,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:24:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:24:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:24:23,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:24:23,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2a6034-ebf8-44fa-afc0-3ff6d0bd1ed4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 22:24:23,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 22:24:23,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:24:23,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 132 conjunts are in the unsatisfiable core [2022-12-13 22:24:23,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:24:23,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:24:23,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:24:23,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 22:24:23,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 22:24:23,333 INFO L321 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2022-12-13 22:24:23,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 62 [2022-12-13 22:24:23,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-13 22:24:23,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-13 22:24:24,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 22:24:24,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-13 22:24:24,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-13 22:24:25,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-13 22:24:25,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-12-13 22:24:26,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-12-13 22:24:28,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-12-13 22:24:34,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-12-13 22:24:38,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2022-12-13 22:24:48,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2022-12-13 22:24:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:24:54,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:25:02,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2383 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select .cse0 .cse1) (+ v_ArrVal_2378 1))))) is different from false [2022-12-13 22:25:02,021 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_2375 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select .cse0 .cse1) (+ v_ArrVal_2378 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse1) 2147483647)))) is different from false [2022-12-13 22:25:02,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2375) (< (select .cse0 .cse3) (+ v_ArrVal_2378 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647))))) is different from false [2022-12-13 22:25:02,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2375) (not (<= v_ArrVal_2374 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select .cse2 .cse3) (+ v_ArrVal_2378 1)))))) is different from false [2022-12-13 22:25:02,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2374) .cse2 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2374) (< (+ (select .cse0 .cse2) 1) v_ArrVal_2375) (< (select (store (store (store .cse3 .cse4 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select .cse3 .cse4) (+ v_ArrVal_2378 1)))))) is different from false [2022-12-13 22:25:02,126 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2372)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse4 v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select .cse2 .cse3) (+ v_ArrVal_2378 1)) (< (+ (select .cse0 .cse4) 1) v_ArrVal_2374) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647))))) is different from false [2022-12-13 22:25:02,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2377 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4)) v_ArrVal_2372)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse5 v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse2 .cse1))) (< (select .cse3 .cse4) (+ v_ArrVal_2378 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store (store (store .cse3 .cse4 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (+ (select .cse0 .cse5) 1) v_ArrVal_2374)))))) is different from false [2022-12-13 22:25:08,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2377 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse2 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_2378 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse4 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_2374))))))) is different from false [2022-12-13 22:25:08,773 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2374 Int) (v_ArrVal_2377 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2369) |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse0 .cse1))) (< (select .cse2 .cse3) (+ v_ArrVal_2378 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse2 .cse1))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2374) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2375) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647))))))) is different from false [2022-12-13 22:25:08,823 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int)) (v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2368 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2368)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2369) |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_2374) .cse3 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 .cse3))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2374) (not (<= v_ArrVal_2368 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select .cse0 .cse1) (+ v_ArrVal_2378 1)))))))) is different from false [2022-12-13 22:25:08,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int)) (v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2368 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2368)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2369) |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_2374) .cse5 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2368) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse6 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 .cse5))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2374) (< (select .cse0 .cse1) (+ v_ArrVal_2378 1))))))))) is different from false [2022-12-13 22:25:09,188 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int)) (v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2366 Int) (v_ArrVal_2368 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2366) .cse8 v_ArrVal_2368)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2369) |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2374) .cse2 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2366 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse1 .cse2))) (< (+ .cse0 1) v_ArrVal_2368) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2374) (< (select (store (store (store .cse1 .cse4 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_2375) (< (select .cse1 .cse4) (+ v_ArrVal_2378 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse5 .cse2)))))))))))) is different from false [2022-12-13 22:25:09,252 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse6 .cse9))) (or (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int)) (v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2366 Int) (v_ArrVal_2368 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_2366) .cse9 v_ArrVal_2368)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2369) |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_2368) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2374) (< (select (store (store (store .cse0 .cse4 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2375) (< (select .cse0 .cse4) (+ v_ArrVal_2378 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2366)))))))) (= 400 .cse2)))) is different from false [2022-12-13 22:25:09,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2369 (Array Int Int)) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2380 Int) (v_ArrVal_2370 (Array Int Int)) (v_ArrVal_2372 Int) (v_ArrVal_2383 Int) (v_ArrVal_2364 Int) (v_ArrVal_2375 Int) (v_ArrVal_2374 Int) (v_ArrVal_2366 Int) (v_ArrVal_2368 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2364)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2366) .cse8 v_ArrVal_2368)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2369) |c_~#stored_elements~0.base| v_ArrVal_2370))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| 4) |c_~#queue~0.offset|) v_ArrVal_2372)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2374) .cse1 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|)) (.cse4 (select .cse5 .cse8))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2374) (= .cse4 400) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2366) (< (select .cse0 .cse3) (+ v_ArrVal_2378 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647) (< (+ .cse4 1) v_ArrVal_2368) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2375) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_77| (select .cse7 .cse1)))))))))) is different from false [2022-12-13 22:25:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 22:25:13,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061359164] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:25:13,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:25:13,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 26] total 73 [2022-12-13 22:25:13,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144566379] [2022-12-13 22:25:13,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:25:13,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-13 22:25:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:25:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-13 22:25:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3168, Unknown=40, NotChecked=1834, Total=5550 [2022-12-13 22:25:13,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 587 [2022-12-13 22:25:13,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 258 transitions, 3217 flow. Second operand has 75 states, 75 states have (on average 194.76) internal successors, (14607), 75 states have internal predecessors, (14607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:25:13,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:25:13,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 587 [2022-12-13 22:25:13,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:25:28,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:25:32,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:25:35,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:25:52,094 WARN L233 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 321 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:26:09,712 WARN L233 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 300 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:26:12,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:26:18,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:26:37,964 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 265 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:26:41,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:26:43,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (select .cse0 1604)) (.cse1 (select .cse4 .cse9))) (and (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (select .cse0 1608) 2147483647) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= .cse1 401)) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (<= 403 .cse2) (<= .cse2 401)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store (store (store .cse0 .cse3 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse3) 2147483647) (< (select .cse0 .cse3) (+ v_ArrVal_2378 1))))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= (select .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (let ((.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) 1604))) (or (<= .cse5 400) (<= 402 .cse5))) (let ((.cse6 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 1604))) (or (<= .cse7 400) (<= 402 .cse7))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604))) (and (or (<= 402 .cse2) (<= .cse2 400)) (not .cse6)))) (or (<= 401 .cse1) (<= .cse1 399)) (let ((.cse8 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1604))) (or (<= 402 .cse8) (<= .cse8 400))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse9)))))) is different from false [2022-12-13 22:26:45,186 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (select .cse0 1604)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (select .cse0 1608) 2147483647) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= (select .cse1 .cse2) 401)) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (<= 403 .cse3) (<= .cse3 401)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store (store (store .cse0 .cse4 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (select .cse0 .cse4) (+ v_ArrVal_2378 1))))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= (select .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (let ((.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) 1604))) (or (<= .cse5 400) (<= 402 .cse5))) (let ((.cse6 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 1604))) (or (<= .cse7 400) (<= 402 .cse7))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604))) (and (or (<= 402 .cse3) (<= .cse3 400)) (not .cse6)))) (let ((.cse8 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1604))) (or (<= 402 .cse8) (<= .cse8 400))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse2)))))) is different from false [2022-12-13 22:26:47,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:26:51,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:26:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 22:26:59,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:11,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:17,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:29,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:31,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:33,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:35,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:37,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:50,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:27:52,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:08,029 WARN L233 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 208 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:28:10,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:12,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:14,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:35,608 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 202 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:28:38,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:40,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:42,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:44,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:46,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:28:48,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:08,316 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 225 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:29:10,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:12,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:14,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:16,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:18,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:20,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:22,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:24,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:26,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:28,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:31,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:34,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:36,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:39,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:41,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:43,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:46,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:48,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:50,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:52,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:54,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:56,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:29:58,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:00,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:11,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:14,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:16,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:18,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:20,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:22,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:24,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:26,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:28,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:30,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:32,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:43,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:45,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:47,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:49,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:51,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:53,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:55,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:30:58,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:00,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:02,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:04,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:06,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:08,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:10,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:12,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:14,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:16,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:18,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:20,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:22,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:24,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:27,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:29,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:31,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:40,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:31:50,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:02,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:09,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:21,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:23,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:30,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:36,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:38,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:40,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 22:32:45,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|)) (.cse6 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_~q#1.offset|))) (let ((.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse6)) (.cse16 (select .cse7 1604)) (.cse9 (select .cse11 .cse12))) (and (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= (select .cse0 1608) 2147483647) (= |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 0) (= |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2378) (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 1600) v_ArrVal_2380)) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse1 .cse2))) (< .cse3 (+ v_ArrVal_2378 1)) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647)))) (<= (select .cse7 1608) 2147483647) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse8 .cse2))) (< (+ .cse9 1) v_ArrVal_2375) (< (select .cse8 .cse4) (+ v_ArrVal_2378 1)) (< (select (store (store (store .cse8 .cse4 v_ArrVal_2378) .cse10 v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= .cse9 401)) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse14 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset|))) (let ((.cse13 (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse0 .cse14 v_ArrVal_2378) (+ |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 1600) v_ArrVal_2380)) |c_~#queue~0.base|))) (or (< (select (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse13 .cse2))) (< (select .cse0 .cse14) (+ v_ArrVal_2378 1)))))) (let ((.cse15 (select .cse0 1604))) (or (<= 403 .cse15) (<= .cse15 401))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (<= 403 .cse16) (<= .cse16 401)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse7 .cse2))) (< (select (store (store (store .cse7 .cse4 v_ArrVal_2378) .cse10 v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (select .cse7 .cse4) (+ v_ArrVal_2378 1)))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= (select .cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) (<= .cse3 2147483647) (let ((.cse17 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) 1604))) (or (<= .cse17 400) (<= 402 .cse17))) (let ((.cse18 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse18 (let ((.cse19 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 1604))) (or (<= .cse19 400) (<= 402 .cse19))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604))) (and (or (<= 402 .cse16) (<= .cse16 400)) (not .cse18)))) (let ((.cse20 (select .cse5 1604))) (or (<= 403 .cse20) (<= .cse20 401))) (or (<= 401 .cse9) (<= .cse9 399)) (let ((.cse21 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1604))) (or (<= 402 .cse21) (<= .cse21 400))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse12)))))) is different from false [2022-12-13 22:32:48,900 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|)) (.cse6 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_~q#1.offset|)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (select .cse11 .cse12)) (.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse10 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse6)) (.cse16 (select .cse7 1604))) (and (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= (select .cse0 1608) 2147483647) (= |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 0) (= |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2378) (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 1600) v_ArrVal_2380)) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse1 .cse2))) (< .cse3 (+ v_ArrVal_2378 1)) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647)))) (<= (select .cse7 1608) 2147483647) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2375 Int) (v_ArrVal_2377 (Array Int Int)) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_2375)) |c_~#stored_elements~0.base| v_ArrVal_2377) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse8 .cse2))) (< (+ .cse9 1) v_ArrVal_2375) (< (select .cse8 .cse4) (+ v_ArrVal_2378 1)) (< (select (store (store (store .cse8 .cse4 v_ArrVal_2378) .cse10 v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647)))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= .cse9 401)) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse14 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset|))) (let ((.cse13 (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse0 .cse14 v_ArrVal_2378) (+ |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 1600) v_ArrVal_2380)) |c_~#queue~0.base|))) (or (< (select (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse13 .cse2))) (< (select .cse0 .cse14) (+ v_ArrVal_2378 1)))))) (let ((.cse15 (select .cse0 1604))) (or (<= 403 .cse15) (<= .cse15 401))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (<= 403 .cse16) (<= .cse16 401)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse7 .cse2))) (< (select (store (store (store .cse7 .cse4 v_ArrVal_2378) .cse10 v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (select .cse7 .cse4) (+ v_ArrVal_2378 1)))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= (select .cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) (<= .cse3 2147483647) (let ((.cse17 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) 1604))) (or (<= .cse17 400) (<= 402 .cse17))) (let ((.cse18 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse18 (let ((.cse19 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 1604))) (or (<= .cse19 400) (<= 402 .cse19))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604))) (and (or (<= 402 .cse16) (<= .cse16 400)) (not .cse18)))) (let ((.cse20 (select .cse5 1604))) (or (<= 403 .cse20) (<= .cse20 401))) (let ((.cse21 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1604))) (or (<= 402 .cse21) (<= .cse21 400))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse12)))))) is different from false [2022-12-13 22:32:51,268 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|)) (.cse6 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_~q#1.offset|))) (let ((.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse5 .cse6)) (.cse12 (select .cse7 1604)) (.cse8 (select .cse13 .cse19))) (and (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (<= (select .cse0 1608) 2147483647) (= |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 0) (= |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2378) (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 1600) v_ArrVal_2380)) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse1 .cse2))) (< .cse3 (+ v_ArrVal_2378 1)) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647)))) (<= (select .cse7 1608) 2147483647) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (not (= .cse8 401)) (= |c_t1Thread1of1ForFork1_empty_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (let ((.cse10 (+ 1608 |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset|))) (let ((.cse9 (select (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_#in~q#1.base| (store (store .cse0 .cse10 v_ArrVal_2378) (+ |c_t2Thread1of1ForFork0_dequeue_#in~q#1.offset| 1600) v_ArrVal_2380)) |c_~#queue~0.base|))) (or (< (select (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse9 .cse2))) (< (select .cse0 .cse10) (+ v_ArrVal_2378 1)))))) (let ((.cse11 (select .cse0 1604))) (or (<= 403 .cse11) (<= .cse11 401))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (or (<= 403 .cse12) (<= .cse12 401)) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (= |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 0) (forall ((v_ArrVal_2383 Int) (v_ArrVal_2378 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2380 Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse7 .cse2))) (< (select (store (store (store .cse7 .cse4 v_ArrVal_2378) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2380) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)) v_ArrVal_2383) .cse4) 2147483647) (< (select .cse7 .cse4) (+ v_ArrVal_2378 1)))) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (<= (select .cse13 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) (<= .cse3 2147483647) (let ((.cse14 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_empty_~q#1.base|) 1604))) (or (<= .cse14 400) (<= 402 .cse14))) (let ((.cse15 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and .cse15 (let ((.cse16 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 1604))) (or (<= .cse16 400) (<= 402 .cse16))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604))) (and (or (<= 402 .cse12) (<= .cse12 400)) (not .cse15)))) (let ((.cse17 (select .cse5 1604))) (or (<= 403 .cse17) (<= .cse17 401))) (or (<= 401 .cse8) (<= .cse8 399)) (let ((.cse18 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) 1604))) (or (<= 402 .cse18) (<= .cse18 400))) (or (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse19)))))) is different from false [2022-12-13 22:33:20,864 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:33:42,393 WARN L233 SmtUtils]: Spent 14.47s on a formula simplification. DAG size of input: 250 DAG size of output: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 22:33:44,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:33:46,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:33:57,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:33:59,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:34:01,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:34:03,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:34:05,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:34:07,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:34:09,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 22:34:11,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]