./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_longer.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 04:42:18,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 04:42:18,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 04:42:18,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 04:42:18,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 04:42:18,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 04:42:18,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 04:42:18,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 04:42:18,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 04:42:18,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 04:42:18,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 04:42:18,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 04:42:18,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 04:42:18,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 04:42:18,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 04:42:18,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 04:42:18,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 04:42:18,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 04:42:18,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 04:42:18,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 04:42:18,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 04:42:18,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 04:42:18,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 04:42:18,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 04:42:18,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 04:42:18,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 04:42:18,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 04:42:18,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 04:42:18,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 04:42:18,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 04:42:18,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 04:42:18,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 04:42:18,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 04:42:18,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 04:42:18,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 04:42:18,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 04:42:18,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 04:42:18,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 04:42:18,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 04:42:18,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 04:42:18,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 04:42:18,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-09-01 04:42:18,757 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 04:42:18,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 04:42:18,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 04:42:18,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 04:42:18,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 04:42:18,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 04:42:18,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 04:42:18,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 04:42:18,760 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 04:42:18,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 04:42:18,761 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 04:42:18,762 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 04:42:18,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 04:42:18,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 04:42:18,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 04:42:18,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 04:42:18,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 04:42:18,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 04:42:18,763 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-09-01 04:42:18,763 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 04:42:18,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 04:42:18,764 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 04:42:18,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 04:42:18,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 04:42:18,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 04:42:18,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 04:42:18,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:18,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 04:42:18,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 04:42:18,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 04:42:18,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 04:42:18,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 04:42:18,766 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 04:42:18,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 04:42:18,766 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 04:42:18,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 04:42:18,767 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 04:42:18,767 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 04:42:19,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 04:42:19,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 04:42:19,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 04:42:19,102 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 04:42:19,102 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 04:42:19,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2023-09-01 04:42:20,318 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 04:42:20,592 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 04:42:20,593 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-09-01 04:42:20,606 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c2985c9/98501ddc85a24e35b100f4af942b55ad/FLAG5eceacce8 [2023-09-01 04:42:20,620 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c2985c9/98501ddc85a24e35b100f4af942b55ad [2023-09-01 04:42:20,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 04:42:20,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 04:42:20,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:20,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 04:42:20,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 04:42:20,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f96a067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:20, skipping insertion in model container [2023-09-01 04:42:20,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:20" (1/1) ... [2023-09-01 04:42:20,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 04:42:20,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 04:42:21,103 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2023-09-01 04:42:21,109 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2023-09-01 04:42:21,114 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2023-09-01 04:42:21,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:21,136 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 04:42:21,198 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2023-09-01 04:42:21,207 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2023-09-01 04:42:21,210 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2023-09-01 04:42:21,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:21,285 INFO L208 MainTranslator]: Completed translation [2023-09-01 04:42:21,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21 WrapperNode [2023-09-01 04:42:21,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:21,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:21,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 04:42:21,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 04:42:21,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,372 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 261 [2023-09-01 04:42:21,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:21,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 04:42:21,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 04:42:21,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 04:42:21,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 04:42:21,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 04:42:21,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 04:42:21,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 04:42:21,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (1/1) ... [2023-09-01 04:42:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:21,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 04:42:21,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 04:42:21,543 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-01 04:42:21,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-01 04:42:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-01 04:42:21,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-01 04:42:21,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 04:42:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 04:42:21,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 04:42:21,547 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 04:42:21,749 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 04:42:21,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 04:42:22,203 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 04:42:22,213 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 04:42:22,213 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-01 04:42:22,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:22 BoogieIcfgContainer [2023-09-01 04:42:22,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 04:42:22,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 04:42:22,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 04:42:22,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 04:42:22,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 04:42:20" (1/3) ... [2023-09-01 04:42:22,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488adae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:22, skipping insertion in model container [2023-09-01 04:42:22,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:21" (2/3) ... [2023-09-01 04:42:22,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488adae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:22, skipping insertion in model container [2023-09-01 04:42:22,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:22" (3/3) ... [2023-09-01 04:42:22,223 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-09-01 04:42:22,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 04:42:22,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 04:42:22,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-09-01 04:42:22,236 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 04:42:22,334 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 04:42:22,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 283 places, 291 transitions, 598 flow [2023-09-01 04:42:22,520 INFO L130 PetriNetUnfolder]: 15/289 cut-off events. [2023-09-01 04:42:22,522 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:42:22,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 15/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 464 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2023-09-01 04:42:22,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 283 places, 291 transitions, 598 flow [2023-09-01 04:42:22,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 280 transitions, 569 flow [2023-09-01 04:42:22,545 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 04:42:22,552 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 272 places, 280 transitions, 569 flow [2023-09-01 04:42:22,554 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 272 places, 280 transitions, 569 flow [2023-09-01 04:42:22,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 280 transitions, 569 flow [2023-09-01 04:42:22,613 INFO L130 PetriNetUnfolder]: 15/280 cut-off events. [2023-09-01 04:42:22,614 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:22,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 280 events. 15/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 423 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2023-09-01 04:42:22,628 INFO L119 LiptonReduction]: Number of co-enabled transitions 22068 [2023-09-01 04:42:30,597 INFO L134 LiptonReduction]: Checked pairs total: 50861 [2023-09-01 04:42:30,597 INFO L136 LiptonReduction]: Total number of compositions: 267 [2023-09-01 04:42:30,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 04:42:30,625 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;@a27a7d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 04:42:30,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-09-01 04:42:30,636 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2023-09-01 04:42:30,636 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 04:42:30,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:30,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 04:42:30,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:30,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -471379928, now seen corresponding path program 1 times [2023-09-01 04:42:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:30,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754785462] [2023-09-01 04:42:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754785462] [2023-09-01 04:42:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754785462] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903895511] [2023-09-01 04:42:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:32,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:32,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 558 [2023-09-01 04:42:32,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 255.2) internal successors, (1276), 5 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:32,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:32,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 558 [2023-09-01 04:42:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:33,245 INFO L130 PetriNetUnfolder]: 3012/4951 cut-off events. [2023-09-01 04:42:33,246 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-09-01 04:42:33,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9773 conditions, 4951 events. 3012/4951 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 26092 event pairs, 2374 based on Foata normal form. 0/3452 useless extension candidates. Maximal degree in co-relation 9558. Up to 4712 conditions per place. [2023-09-01 04:42:33,273 INFO L137 encePairwiseOnDemand]: 548/558 looper letters, 70 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-09-01 04:42:33,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 85 transitions, 337 flow [2023-09-01 04:42:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2023-09-01 04:42:33,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47998805256869775 [2023-09-01 04:42:33,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1607 transitions. [2023-09-01 04:42:33,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1607 transitions. [2023-09-01 04:42:33,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:33,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1607 transitions. [2023-09-01 04:42:33,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.8333333333333) internal successors, (1607), 6 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,314 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,316 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 165 flow. Second operand 6 states and 1607 transitions. [2023-09-01 04:42:33,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 85 transitions, 337 flow [2023-09-01 04:42:33,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 332 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:33,323 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 216 flow [2023-09-01 04:42:33,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2023-09-01 04:42:33,328 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 6 predicate places. [2023-09-01 04:42:33,328 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 216 flow [2023-09-01 04:42:33,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 255.2) internal successors, (1276), 5 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:33,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:33,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:33,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 04:42:33,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:33,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1727417925, now seen corresponding path program 1 times [2023-09-01 04:42:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:33,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044032036] [2023-09-01 04:42:33,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:34,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044032036] [2023-09-01 04:42:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044032036] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:34,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044773112] [2023-09-01 04:42:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:34,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 558 [2023-09-01 04:42:34,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:34,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:34,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 558 [2023-09-01 04:42:34,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:35,740 INFO L130 PetriNetUnfolder]: 3238/5330 cut-off events. [2023-09-01 04:42:35,741 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2023-09-01 04:42:35,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10936 conditions, 5330 events. 3238/5330 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 28893 event pairs, 666 based on Foata normal form. 0/3769 useless extension candidates. Maximal degree in co-relation 9595. Up to 4756 conditions per place. [2023-09-01 04:42:35,771 INFO L137 encePairwiseOnDemand]: 549/558 looper letters, 127 selfloop transitions, 17 changer transitions 0/150 dead transitions. [2023-09-01 04:42:35,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 150 transitions, 654 flow [2023-09-01 04:42:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1648 transitions. [2023-09-01 04:42:35,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922341696535245 [2023-09-01 04:42:35,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1648 transitions. [2023-09-01 04:42:35,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1648 transitions. [2023-09-01 04:42:35,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:35,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1648 transitions. [2023-09-01 04:42:35,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 274.6666666666667) internal successors, (1648), 6 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,788 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 216 flow. Second operand 6 states and 1648 transitions. [2023-09-01 04:42:35,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 150 transitions, 654 flow [2023-09-01 04:42:35,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 150 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:35,796 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 310 flow [2023-09-01 04:42:35,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2023-09-01 04:42:35,798 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 14 predicate places. [2023-09-01 04:42:35,798 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 310 flow [2023-09-01 04:42:35,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:35,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:35,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:35,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 04:42:35,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:35,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1727873625, now seen corresponding path program 2 times [2023-09-01 04:42:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:35,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842805456] [2023-09-01 04:42:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:36,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842805456] [2023-09-01 04:42:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842805456] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:36,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:36,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479464310] [2023-09-01 04:42:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:36,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:36,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:36,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 558 [2023-09-01 04:42:36,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:36,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:36,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 558 [2023-09-01 04:42:36,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:37,153 INFO L130 PetriNetUnfolder]: 3284/5402 cut-off events. [2023-09-01 04:42:37,154 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2023-09-01 04:42:37,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11756 conditions, 5402 events. 3284/5402 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 29623 event pairs, 745 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 10590. Up to 4706 conditions per place. [2023-09-01 04:42:37,199 INFO L137 encePairwiseOnDemand]: 551/558 looper letters, 119 selfloop transitions, 16 changer transitions 0/141 dead transitions. [2023-09-01 04:42:37,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 141 transitions, 697 flow [2023-09-01 04:42:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:42:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:42:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1380 transitions. [2023-09-01 04:42:37,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2023-09-01 04:42:37,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1380 transitions. [2023-09-01 04:42:37,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1380 transitions. [2023-09-01 04:42:37,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:37,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1380 transitions. [2023-09-01 04:42:37,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 558.0) internal successors, (3348), 6 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 558.0) internal successors, (3348), 6 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,214 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 310 flow. Second operand 5 states and 1380 transitions. [2023-09-01 04:42:37,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 141 transitions, 697 flow [2023-09-01 04:42:37,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 141 transitions, 679 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:37,227 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 376 flow [2023-09-01 04:42:37,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2023-09-01 04:42:37,228 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 20 predicate places. [2023-09-01 04:42:37,229 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 376 flow [2023-09-01 04:42:37,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:37,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:37,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 04:42:37,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:37,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267153, now seen corresponding path program 1 times [2023-09-01 04:42:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:37,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798572479] [2023-09-01 04:42:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:37,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798572479] [2023-09-01 04:42:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798572479] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:37,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:37,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695885131] [2023-09-01 04:42:37,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:37,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:38,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 558 [2023-09-01 04:42:38,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 376 flow. Second operand has 5 states, 5 states have (on average 255.8) internal successors, (1279), 5 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:38,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 558 [2023-09-01 04:42:38,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:38,928 INFO L130 PetriNetUnfolder]: 3280/5405 cut-off events. [2023-09-01 04:42:38,928 INFO L131 PetriNetUnfolder]: For 1542/1542 co-relation queries the response was YES. [2023-09-01 04:42:38,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11936 conditions, 5405 events. 3280/5405 cut-off events. For 1542/1542 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 29264 event pairs, 2430 based on Foata normal form. 0/3849 useless extension candidates. Maximal degree in co-relation 10737. Up to 5147 conditions per place. [2023-09-01 04:42:38,959 INFO L137 encePairwiseOnDemand]: 549/558 looper letters, 87 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2023-09-01 04:42:38,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 103 transitions, 582 flow [2023-09-01 04:42:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1609 transitions. [2023-09-01 04:42:38,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805854241338112 [2023-09-01 04:42:38,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1609 transitions. [2023-09-01 04:42:38,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1609 transitions. [2023-09-01 04:42:38,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:38,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1609 transitions. [2023-09-01 04:42:38,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 268.1666666666667) internal successors, (1609), 6 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,980 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,980 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 376 flow. Second operand 6 states and 1609 transitions. [2023-09-01 04:42:38,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 103 transitions, 582 flow [2023-09-01 04:42:38,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 574 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:38,987 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 408 flow [2023-09-01 04:42:38,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2023-09-01 04:42:38,989 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 26 predicate places. [2023-09-01 04:42:38,989 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 408 flow [2023-09-01 04:42:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 255.8) internal successors, (1279), 5 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:38,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:38,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:38,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 04:42:38,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:38,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 133239830, now seen corresponding path program 1 times [2023-09-01 04:42:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:38,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41285328] [2023-09-01 04:42:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41285328] [2023-09-01 04:42:39,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41285328] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:39,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:39,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701602343] [2023-09-01 04:42:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:39,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:39,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 558 [2023-09-01 04:42:39,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:39,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 558 [2023-09-01 04:42:39,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:39,861 INFO L130 PetriNetUnfolder]: 5225/8793 cut-off events. [2023-09-01 04:42:39,862 INFO L131 PetriNetUnfolder]: For 2381/2418 co-relation queries the response was YES. [2023-09-01 04:42:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19046 conditions, 8793 events. 5225/8793 cut-off events. For 2381/2418 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 55682 event pairs, 2351 based on Foata normal form. 37/6603 useless extension candidates. Maximal degree in co-relation 17492. Up to 4846 conditions per place. [2023-09-01 04:42:39,917 INFO L137 encePairwiseOnDemand]: 553/558 looper letters, 159 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-09-01 04:42:39,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 172 transitions, 972 flow [2023-09-01 04:42:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 953 transitions. [2023-09-01 04:42:39,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5692951015531661 [2023-09-01 04:42:39,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 953 transitions. [2023-09-01 04:42:39,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 953 transitions. [2023-09-01 04:42:39,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:39,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 953 transitions. [2023-09-01 04:42:39,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,929 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 408 flow. Second operand 3 states and 953 transitions. [2023-09-01 04:42:39,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 172 transitions, 972 flow [2023-09-01 04:42:39,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 172 transitions, 956 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:42:39,937 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 408 flow [2023-09-01 04:42:39,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2023-09-01 04:42:39,939 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 25 predicate places. [2023-09-01 04:42:39,940 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 408 flow [2023-09-01 04:42:39,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:39,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:39,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 04:42:39,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:39,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 791606712, now seen corresponding path program 1 times [2023-09-01 04:42:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203784158] [2023-09-01 04:42:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:40,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203784158] [2023-09-01 04:42:40,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203784158] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:40,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88907977] [2023-09-01 04:42:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:40,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:41,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 558 [2023-09-01 04:42:41,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 252.66666666666666) internal successors, (1516), 6 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:41,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:41,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 558 [2023-09-01 04:42:41,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:43,543 INFO L130 PetriNetUnfolder]: 5786/9558 cut-off events. [2023-09-01 04:42:43,544 INFO L131 PetriNetUnfolder]: For 2413/2413 co-relation queries the response was YES. [2023-09-01 04:42:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22022 conditions, 9558 events. 5786/9558 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 58105 event pairs, 1166 based on Foata normal form. 82/7379 useless extension candidates. Maximal degree in co-relation 13503. Up to 8279 conditions per place. [2023-09-01 04:42:43,594 INFO L137 encePairwiseOnDemand]: 548/558 looper letters, 140 selfloop transitions, 20 changer transitions 0/166 dead transitions. [2023-09-01 04:42:43,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 928 flow [2023-09-01 04:42:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1652 transitions. [2023-09-01 04:42:43,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934289127837515 [2023-09-01 04:42:43,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1652 transitions. [2023-09-01 04:42:43,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1652 transitions. [2023-09-01 04:42:43,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:43,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1652 transitions. [2023-09-01 04:42:43,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:43,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:43,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:43,611 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 408 flow. Second operand 6 states and 1652 transitions. [2023-09-01 04:42:43,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 928 flow [2023-09-01 04:42:43,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 166 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:43,630 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 474 flow [2023-09-01 04:42:43,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2023-09-01 04:42:43,633 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 30 predicate places. [2023-09-01 04:42:43,633 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 474 flow [2023-09-01 04:42:43,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.66666666666666) internal successors, (1516), 6 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:43,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:43,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:43,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 04:42:43,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:43,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -926142348, now seen corresponding path program 2 times [2023-09-01 04:42:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140828320] [2023-09-01 04:42:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:44,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:44,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140828320] [2023-09-01 04:42:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140828320] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:44,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:44,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102857454] [2023-09-01 04:42:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:44,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:44,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:44,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 558 [2023-09-01 04:42:44,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 253.66666666666666) internal successors, (1522), 6 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:44,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:44,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 558 [2023-09-01 04:42:44,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:45,763 INFO L130 PetriNetUnfolder]: 6018/9970 cut-off events. [2023-09-01 04:42:45,763 INFO L131 PetriNetUnfolder]: For 4056/4056 co-relation queries the response was YES. [2023-09-01 04:42:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23656 conditions, 9970 events. 6018/9970 cut-off events. For 4056/4056 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 60785 event pairs, 3130 based on Foata normal form. 82/7767 useless extension candidates. Maximal degree in co-relation 12052. Up to 8136 conditions per place. [2023-09-01 04:42:45,845 INFO L137 encePairwiseOnDemand]: 548/558 looper letters, 141 selfloop transitions, 23 changer transitions 0/170 dead transitions. [2023-09-01 04:42:45,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 170 transitions, 1012 flow [2023-09-01 04:42:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1657 transitions. [2023-09-01 04:42:45,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49492234169653526 [2023-09-01 04:42:45,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1657 transitions. [2023-09-01 04:42:45,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1657 transitions. [2023-09-01 04:42:45,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:45,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1657 transitions. [2023-09-01 04:42:45,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 276.1666666666667) internal successors, (1657), 6 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,860 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,860 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 474 flow. Second operand 6 states and 1657 transitions. [2023-09-01 04:42:45,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 170 transitions, 1012 flow [2023-09-01 04:42:45,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 170 transitions, 980 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 04:42:45,881 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 533 flow [2023-09-01 04:42:45,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2023-09-01 04:42:45,883 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 32 predicate places. [2023-09-01 04:42:45,883 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 533 flow [2023-09-01 04:42:45,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.66666666666666) internal successors, (1522), 6 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:45,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:45,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:45,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 04:42:45,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:45,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 89131410, now seen corresponding path program 3 times [2023-09-01 04:42:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810375235] [2023-09-01 04:42:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:46,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810375235] [2023-09-01 04:42:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810375235] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:46,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967237284] [2023-09-01 04:42:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:46,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:46,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 558 [2023-09-01 04:42:46,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 533 flow. Second operand has 6 states, 6 states have (on average 253.66666666666666) internal successors, (1522), 6 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:46,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:46,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 558 [2023-09-01 04:42:46,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:47,870 INFO L130 PetriNetUnfolder]: 6012/9917 cut-off events. [2023-09-01 04:42:47,870 INFO L131 PetriNetUnfolder]: For 6455/6455 co-relation queries the response was YES. [2023-09-01 04:42:47,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24269 conditions, 9917 events. 6012/9917 cut-off events. For 6455/6455 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 60320 event pairs, 1447 based on Foata normal form. 82/7719 useless extension candidates. Maximal degree in co-relation 20101. Up to 7790 conditions per place. [2023-09-01 04:42:47,915 INFO L137 encePairwiseOnDemand]: 549/558 looper letters, 141 selfloop transitions, 24 changer transitions 0/171 dead transitions. [2023-09-01 04:42:47,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 171 transitions, 1063 flow [2023-09-01 04:42:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1657 transitions. [2023-09-01 04:42:47,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49492234169653526 [2023-09-01 04:42:47,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1657 transitions. [2023-09-01 04:42:47,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1657 transitions. [2023-09-01 04:42:47,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:47,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1657 transitions. [2023-09-01 04:42:47,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 276.1666666666667) internal successors, (1657), 6 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:47,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:47,943 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 558.0) internal successors, (3906), 7 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:47,943 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 533 flow. Second operand 6 states and 1657 transitions. [2023-09-01 04:42:47,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 171 transitions, 1063 flow [2023-09-01 04:42:47,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 171 transitions, 1021 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:47,975 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 580 flow [2023-09-01 04:42:47,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2023-09-01 04:42:47,977 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 35 predicate places. [2023-09-01 04:42:47,978 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 580 flow [2023-09-01 04:42:47,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.66666666666666) internal successors, (1522), 6 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:47,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:47,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:47,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 04:42:47,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:47,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -156159243, now seen corresponding path program 1 times [2023-09-01 04:42:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91047326] [2023-09-01 04:42:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91047326] [2023-09-01 04:42:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91047326] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:48,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453209094] [2023-09-01 04:42:48,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:48,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:48,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 558 [2023-09-01 04:42:48,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:48,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:48,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 558 [2023-09-01 04:42:48,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:48,659 INFO L130 PetriNetUnfolder]: 4278/7094 cut-off events. [2023-09-01 04:42:48,660 INFO L131 PetriNetUnfolder]: For 3356/3369 co-relation queries the response was YES. [2023-09-01 04:42:48,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16468 conditions, 7094 events. 4278/7094 cut-off events. For 3356/3369 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 39308 event pairs, 2135 based on Foata normal form. 185/5285 useless extension candidates. Maximal degree in co-relation 14635. Up to 4581 conditions per place. [2023-09-01 04:42:48,695 INFO L137 encePairwiseOnDemand]: 554/558 looper letters, 109 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-09-01 04:42:48,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 121 transitions, 712 flow [2023-09-01 04:42:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2023-09-01 04:42:48,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5477897252090801 [2023-09-01 04:42:48,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 917 transitions. [2023-09-01 04:42:48,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 917 transitions. [2023-09-01 04:42:48,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:48,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 917 transitions. [2023-09-01 04:42:48,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.6666666666667) internal successors, (917), 3 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:48,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:48,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:48,726 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 580 flow. Second operand 3 states and 917 transitions. [2023-09-01 04:42:48,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 121 transitions, 712 flow [2023-09-01 04:42:48,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 625 flow, removed 4 selfloop flow, removed 15 redundant places. [2023-09-01 04:42:48,733 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 327 flow [2023-09-01 04:42:48,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2023-09-01 04:42:48,736 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 18 predicate places. [2023-09-01 04:42:48,738 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 327 flow [2023-09-01 04:42:48,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:48,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:48,739 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:48,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 04:42:48,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:48,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash -917278505, now seen corresponding path program 1 times [2023-09-01 04:42:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688408720] [2023-09-01 04:42:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688408720] [2023-09-01 04:42:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688408720] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:42:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179987984] [2023-09-01 04:42:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:48,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:42:48,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:48,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:42:48,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 04:42:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:48,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 04:42:48,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:42:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:48,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 04:42:48,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179987984] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 04:42:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-09-01 04:42:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761151461] [2023-09-01 04:42:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:48,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 04:42:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 04:42:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:49,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 558 [2023-09-01 04:42:49,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 276.25) internal successors, (1105), 4 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:49,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:49,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 558 [2023-09-01 04:42:49,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:49,714 INFO L130 PetriNetUnfolder]: 3764/6736 cut-off events. [2023-09-01 04:42:49,714 INFO L131 PetriNetUnfolder]: For 1255/1270 co-relation queries the response was YES. [2023-09-01 04:42:49,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14255 conditions, 6736 events. 3764/6736 cut-off events. For 1255/1270 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 40457 event pairs, 119 based on Foata normal form. 13/5095 useless extension candidates. Maximal degree in co-relation 12791. Up to 3217 conditions per place. [2023-09-01 04:42:49,754 INFO L137 encePairwiseOnDemand]: 555/558 looper letters, 170 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2023-09-01 04:42:49,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 183 transitions, 948 flow [2023-09-01 04:42:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 04:42:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 04:42:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1248 transitions. [2023-09-01 04:42:49,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2023-09-01 04:42:49,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1248 transitions. [2023-09-01 04:42:49,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1248 transitions. [2023-09-01 04:42:49,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:49,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1248 transitions. [2023-09-01 04:42:49,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:49,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 558.0) internal successors, (2790), 5 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:49,766 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 558.0) internal successors, (2790), 5 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:49,766 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 327 flow. Second operand 4 states and 1248 transitions. [2023-09-01 04:42:49,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 183 transitions, 948 flow [2023-09-01 04:42:49,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 183 transitions, 944 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:49,773 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 324 flow [2023-09-01 04:42:49,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2023-09-01 04:42:49,774 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 19 predicate places. [2023-09-01 04:42:49,774 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 324 flow [2023-09-01 04:42:49,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 276.25) internal successors, (1105), 4 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:49,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:49,775 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:49,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 04:42:49,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-09-01 04:42:49,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:49,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -917278443, now seen corresponding path program 1 times [2023-09-01 04:42:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:49,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945332928] [2023-09-01 04:42:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 04:42:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945332928] [2023-09-01 04:42:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945332928] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827331838] [2023-09-01 04:42:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:50,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:50,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 558 [2023-09-01 04:42:50,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:50,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:50,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 558 [2023-09-01 04:42:50,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:50,536 INFO L130 PetriNetUnfolder]: 3554/6420 cut-off events. [2023-09-01 04:42:50,536 INFO L131 PetriNetUnfolder]: For 1676/1691 co-relation queries the response was YES. [2023-09-01 04:42:50,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13675 conditions, 6420 events. 3554/6420 cut-off events. For 1676/1691 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 37862 event pairs, 477 based on Foata normal form. 13/4961 useless extension candidates. Maximal degree in co-relation 12310. Up to 4534 conditions per place. [2023-09-01 04:42:50,569 INFO L137 encePairwiseOnDemand]: 554/558 looper letters, 111 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2023-09-01 04:42:50,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 126 transitions, 673 flow [2023-09-01 04:42:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2023-09-01 04:42:50,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5477897252090801 [2023-09-01 04:42:50,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 917 transitions. [2023-09-01 04:42:50,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 917 transitions. [2023-09-01 04:42:50,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:50,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 917 transitions. [2023-09-01 04:42:50,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.6666666666667) internal successors, (917), 3 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:50,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:50,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:50,578 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 324 flow. Second operand 3 states and 917 transitions. [2023-09-01 04:42:50,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 126 transitions, 673 flow [2023-09-01 04:42:50,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 126 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:50,583 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 333 flow [2023-09-01 04:42:50,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2023-09-01 04:42:50,584 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 19 predicate places. [2023-09-01 04:42:50,584 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 333 flow [2023-09-01 04:42:50,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:50,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:50,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:50,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 04:42:50,585 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:50,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1914224002, now seen corresponding path program 1 times [2023-09-01 04:42:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881663127] [2023-09-01 04:42:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881663127] [2023-09-01 04:42:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881663127] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:50,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926493380] [2023-09-01 04:42:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:50,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 558 [2023-09-01 04:42:50,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:50,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:50,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 558 [2023-09-01 04:42:50,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:51,231 INFO L130 PetriNetUnfolder]: 4137/7171 cut-off events. [2023-09-01 04:42:51,231 INFO L131 PetriNetUnfolder]: For 4724/4733 co-relation queries the response was YES. [2023-09-01 04:42:51,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17065 conditions, 7171 events. 4137/7171 cut-off events. For 4724/4733 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 42190 event pairs, 1699 based on Foata normal form. 9/5613 useless extension candidates. Maximal degree in co-relation 15486. Up to 5966 conditions per place. [2023-09-01 04:42:51,280 INFO L137 encePairwiseOnDemand]: 551/558 looper letters, 115 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2023-09-01 04:42:51,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 684 flow [2023-09-01 04:42:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2023-09-01 04:42:51,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5501792114695341 [2023-09-01 04:42:51,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 921 transitions. [2023-09-01 04:42:51,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 921 transitions. [2023-09-01 04:42:51,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:51,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 921 transitions. [2023-09-01 04:42:51,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:51,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:51,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:51,289 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 333 flow. Second operand 3 states and 921 transitions. [2023-09-01 04:42:51,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 684 flow [2023-09-01 04:42:51,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 128 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:51,296 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 349 flow [2023-09-01 04:42:51,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2023-09-01 04:42:51,297 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 21 predicate places. [2023-09-01 04:42:51,297 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 349 flow [2023-09-01 04:42:51,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:51,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:51,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:51,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 04:42:51,298 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:51,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -784742033, now seen corresponding path program 1 times [2023-09-01 04:42:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102575001] [2023-09-01 04:42:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:52,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:52,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102575001] [2023-09-01 04:42:52,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102575001] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:52,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:52,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-09-01 04:42:52,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112249915] [2023-09-01 04:42:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:52,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 04:42:52,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:52,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 04:42:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-09-01 04:42:54,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 558 [2023-09-01 04:42:54,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 349 flow. Second operand has 14 states, 14 states have (on average 234.35714285714286) internal successors, (3281), 14 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:54,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:54,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 558 [2023-09-01 04:42:54,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:55,152 INFO L130 PetriNetUnfolder]: 4284/7415 cut-off events. [2023-09-01 04:42:55,152 INFO L131 PetriNetUnfolder]: For 3660/3660 co-relation queries the response was YES. [2023-09-01 04:42:55,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18171 conditions, 7415 events. 4284/7415 cut-off events. For 3660/3660 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 41629 event pairs, 3472 based on Foata normal form. 0/6015 useless extension candidates. Maximal degree in co-relation 16520. Up to 6919 conditions per place. [2023-09-01 04:42:55,203 INFO L137 encePairwiseOnDemand]: 541/558 looper letters, 79 selfloop transitions, 28 changer transitions 1/115 dead transitions. [2023-09-01 04:42:55,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 115 transitions, 675 flow [2023-09-01 04:42:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 04:42:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 04:42:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3595 transitions. [2023-09-01 04:42:55,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295101553166069 [2023-09-01 04:42:55,213 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3595 transitions. [2023-09-01 04:42:55,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3595 transitions. [2023-09-01 04:42:55,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:55,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3595 transitions. [2023-09-01 04:42:55,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 239.66666666666666) internal successors, (3595), 15 states have internal predecessors, (3595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,233 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,233 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 349 flow. Second operand 15 states and 3595 transitions. [2023-09-01 04:42:55,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 115 transitions, 675 flow [2023-09-01 04:42:55,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:55,243 INFO L231 Difference]: Finished difference. Result has 118 places, 104 transitions, 525 flow [2023-09-01 04:42:55,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=525, PETRI_PLACES=118, PETRI_TRANSITIONS=104} [2023-09-01 04:42:55,245 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 42 predicate places. [2023-09-01 04:42:55,245 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 104 transitions, 525 flow [2023-09-01 04:42:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 234.35714285714286) internal successors, (3281), 14 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:55,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:55,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 04:42:55,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:55,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash -784742058, now seen corresponding path program 1 times [2023-09-01 04:42:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654004646] [2023-09-01 04:42:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:55,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654004646] [2023-09-01 04:42:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654004646] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:55,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:42:55,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343260755] [2023-09-01 04:42:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:55,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:42:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:55,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:42:55,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:42:56,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 558 [2023-09-01 04:42:56,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 104 transitions, 525 flow. Second operand has 13 states, 13 states have (on average 238.46153846153845) internal successors, (3100), 13 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:56,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:56,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 558 [2023-09-01 04:42:56,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:59,428 INFO L130 PetriNetUnfolder]: 13635/23372 cut-off events. [2023-09-01 04:42:59,428 INFO L131 PetriNetUnfolder]: For 9268/9268 co-relation queries the response was YES. [2023-09-01 04:42:59,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57303 conditions, 23372 events. 13635/23372 cut-off events. For 9268/9268 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 166983 event pairs, 4189 based on Foata normal form. 0/18556 useless extension candidates. Maximal degree in co-relation 40566. Up to 5784 conditions per place. [2023-09-01 04:42:59,778 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 363 selfloop transitions, 62 changer transitions 3/435 dead transitions. [2023-09-01 04:42:59,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 435 transitions, 2434 flow [2023-09-01 04:42:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:42:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:42:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4649 transitions. [2023-09-01 04:42:59,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46286340103544404 [2023-09-01 04:42:59,790 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4649 transitions. [2023-09-01 04:42:59,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4649 transitions. [2023-09-01 04:42:59,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:59,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4649 transitions. [2023-09-01 04:42:59,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 258.27777777777777) internal successors, (4649), 18 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:59,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:59,821 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:59,821 INFO L175 Difference]: Start difference. First operand has 118 places, 104 transitions, 525 flow. Second operand 18 states and 4649 transitions. [2023-09-01 04:42:59,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 435 transitions, 2434 flow [2023-09-01 04:42:59,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 435 transitions, 2372 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-09-01 04:42:59,855 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 748 flow [2023-09-01 04:42:59,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=748, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2023-09-01 04:42:59,856 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 60 predicate places. [2023-09-01 04:42:59,857 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 748 flow [2023-09-01 04:42:59,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 238.46153846153845) internal successors, (3100), 13 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:59,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:59,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:59,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 04:42:59,858 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:42:59,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2011241202, now seen corresponding path program 1 times [2023-09-01 04:42:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456847022] [2023-09-01 04:42:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:00,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456847022] [2023-09-01 04:43:00,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456847022] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:00,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:00,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-09-01 04:43:00,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433224756] [2023-09-01 04:43:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:00,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 04:43:00,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:00,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 04:43:00,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-09-01 04:43:01,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 558 [2023-09-01 04:43:01,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 748 flow. Second operand has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:01,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:01,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 558 [2023-09-01 04:43:01,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:04,515 INFO L130 PetriNetUnfolder]: 13754/23713 cut-off events. [2023-09-01 04:43:04,516 INFO L131 PetriNetUnfolder]: For 13625/13625 co-relation queries the response was YES. [2023-09-01 04:43:04,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62000 conditions, 23713 events. 13754/23713 cut-off events. For 13625/13625 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 171183 event pairs, 9021 based on Foata normal form. 0/19476 useless extension candidates. Maximal degree in co-relation 61842. Up to 20753 conditions per place. [2023-09-01 04:43:04,787 INFO L137 encePairwiseOnDemand]: 543/558 looper letters, 200 selfloop transitions, 38 changer transitions 3/248 dead transitions. [2023-09-01 04:43:04,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 248 transitions, 1749 flow [2023-09-01 04:43:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-01 04:43:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-09-01 04:43:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3387 transitions. [2023-09-01 04:43:04,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43356374807987713 [2023-09-01 04:43:04,796 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3387 transitions. [2023-09-01 04:43:04,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3387 transitions. [2023-09-01 04:43:04,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:04,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3387 transitions. [2023-09-01 04:43:04,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 241.92857142857142) internal successors, (3387), 14 states have internal predecessors, (3387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:04,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 558.0) internal successors, (8370), 15 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:04,815 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 558.0) internal successors, (8370), 15 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:04,815 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 748 flow. Second operand 14 states and 3387 transitions. [2023-09-01 04:43:04,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 248 transitions, 1749 flow [2023-09-01 04:43:04,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 248 transitions, 1698 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-09-01 04:43:04,869 INFO L231 Difference]: Finished difference. Result has 148 places, 140 transitions, 853 flow [2023-09-01 04:43:04,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=853, PETRI_PLACES=148, PETRI_TRANSITIONS=140} [2023-09-01 04:43:04,870 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 72 predicate places. [2023-09-01 04:43:04,870 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 140 transitions, 853 flow [2023-09-01 04:43:04,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:04,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:04,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:04,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 04:43:04,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:04,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 317311393, now seen corresponding path program 1 times [2023-09-01 04:43:04,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:04,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791349895] [2023-09-01 04:43:04,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:05,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791349895] [2023-09-01 04:43:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791349895] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:05,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:05,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-09-01 04:43:05,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766466219] [2023-09-01 04:43:05,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:05,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 04:43:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:05,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 04:43:05,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-09-01 04:43:06,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 558 [2023-09-01 04:43:06,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 140 transitions, 853 flow. Second operand has 14 states, 14 states have (on average 235.42857142857142) internal successors, (3296), 14 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:06,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:06,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 558 [2023-09-01 04:43:06,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:10,290 INFO L130 PetriNetUnfolder]: 18414/31350 cut-off events. [2023-09-01 04:43:10,290 INFO L131 PetriNetUnfolder]: For 17690/17690 co-relation queries the response was YES. [2023-09-01 04:43:10,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82558 conditions, 31350 events. 18414/31350 cut-off events. For 17690/17690 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 224909 event pairs, 6700 based on Foata normal form. 103/25666 useless extension candidates. Maximal degree in co-relation 82399. Up to 16871 conditions per place. [2023-09-01 04:43:10,484 INFO L137 encePairwiseOnDemand]: 542/558 looper letters, 361 selfloop transitions, 67 changer transitions 0/435 dead transitions. [2023-09-01 04:43:10,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 435 transitions, 2680 flow [2023-09-01 04:43:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 04:43:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 04:43:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3856 transitions. [2023-09-01 04:43:10,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46069295101553165 [2023-09-01 04:43:10,491 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3856 transitions. [2023-09-01 04:43:10,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3856 transitions. [2023-09-01 04:43:10,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:10,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3856 transitions. [2023-09-01 04:43:10,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 257.06666666666666) internal successors, (3856), 15 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:10,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:10,506 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:10,506 INFO L175 Difference]: Start difference. First operand has 148 places, 140 transitions, 853 flow. Second operand 15 states and 3856 transitions. [2023-09-01 04:43:10,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 435 transitions, 2680 flow [2023-09-01 04:43:10,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 435 transitions, 2629 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-09-01 04:43:10,588 INFO L231 Difference]: Finished difference. Result has 162 places, 162 transitions, 1130 flow [2023-09-01 04:43:10,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1130, PETRI_PLACES=162, PETRI_TRANSITIONS=162} [2023-09-01 04:43:10,589 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 86 predicate places. [2023-09-01 04:43:10,589 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 162 transitions, 1130 flow [2023-09-01 04:43:10,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 235.42857142857142) internal successors, (3296), 14 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:10,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:10,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:10,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 04:43:10,590 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:10,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash 317311418, now seen corresponding path program 2 times [2023-09-01 04:43:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:10,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923232565] [2023-09-01 04:43:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923232565] [2023-09-01 04:43:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923232565] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-09-01 04:43:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738514782] [2023-09-01 04:43:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 04:43:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 04:43:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-09-01 04:43:12,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 558 [2023-09-01 04:43:12,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 162 transitions, 1130 flow. Second operand has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:12,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:12,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 558 [2023-09-01 04:43:12,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:16,215 INFO L130 PetriNetUnfolder]: 18562/32039 cut-off events. [2023-09-01 04:43:16,215 INFO L131 PetriNetUnfolder]: For 25986/25986 co-relation queries the response was YES. [2023-09-01 04:43:16,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88642 conditions, 32039 events. 18562/32039 cut-off events. For 25986/25986 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 232967 event pairs, 9506 based on Foata normal form. 26/26414 useless extension candidates. Maximal degree in co-relation 60616. Up to 27692 conditions per place. [2023-09-01 04:43:16,407 INFO L137 encePairwiseOnDemand]: 543/558 looper letters, 222 selfloop transitions, 44 changer transitions 3/276 dead transitions. [2023-09-01 04:43:16,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 276 transitions, 2200 flow [2023-09-01 04:43:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-01 04:43:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-09-01 04:43:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3384 transitions. [2023-09-01 04:43:16,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43317972350230416 [2023-09-01 04:43:16,411 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3384 transitions. [2023-09-01 04:43:16,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3384 transitions. [2023-09-01 04:43:16,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:16,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3384 transitions. [2023-09-01 04:43:16,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 241.71428571428572) internal successors, (3384), 14 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:16,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 558.0) internal successors, (8370), 15 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:16,422 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 558.0) internal successors, (8370), 15 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:16,422 INFO L175 Difference]: Start difference. First operand has 162 places, 162 transitions, 1130 flow. Second operand 14 states and 3384 transitions. [2023-09-01 04:43:16,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 276 transitions, 2200 flow [2023-09-01 04:43:16,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 276 transitions, 2169 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-09-01 04:43:16,534 INFO L231 Difference]: Finished difference. Result has 176 places, 168 transitions, 1292 flow [2023-09-01 04:43:16,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1292, PETRI_PLACES=176, PETRI_TRANSITIONS=168} [2023-09-01 04:43:16,535 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 100 predicate places. [2023-09-01 04:43:16,535 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 168 transitions, 1292 flow [2023-09-01 04:43:16,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:16,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:16,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:16,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 04:43:16,537 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:16,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -643986808, now seen corresponding path program 3 times [2023-09-01 04:43:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369714012] [2023-09-01 04:43:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:17,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369714012] [2023-09-01 04:43:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369714012] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:17,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-09-01 04:43:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620564687] [2023-09-01 04:43:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 04:43:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:17,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 04:43:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-09-01 04:43:19,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 558 [2023-09-01 04:43:19,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 168 transitions, 1292 flow. Second operand has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:19,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:19,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 558 [2023-09-01 04:43:19,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:23,096 INFO L130 PetriNetUnfolder]: 18741/32472 cut-off events. [2023-09-01 04:43:23,096 INFO L131 PetriNetUnfolder]: For 29444/29452 co-relation queries the response was YES. [2023-09-01 04:43:23,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91148 conditions, 32472 events. 18741/32472 cut-off events. For 29444/29452 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 238400 event pairs, 9441 based on Foata normal form. 26/26826 useless extension candidates. Maximal degree in co-relation 90979. Up to 27242 conditions per place. [2023-09-01 04:43:23,331 INFO L137 encePairwiseOnDemand]: 542/558 looper letters, 233 selfloop transitions, 52 changer transitions 3/295 dead transitions. [2023-09-01 04:43:23,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 295 transitions, 2465 flow [2023-09-01 04:43:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 04:43:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 04:43:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3855 transitions. [2023-09-01 04:43:23,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43178763440860213 [2023-09-01 04:43:23,334 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3855 transitions. [2023-09-01 04:43:23,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3855 transitions. [2023-09-01 04:43:23,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:23,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3855 transitions. [2023-09-01 04:43:23,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 240.9375) internal successors, (3855), 16 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:23,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 558.0) internal successors, (9486), 17 states have internal predecessors, (9486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:23,346 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 558.0) internal successors, (9486), 17 states have internal predecessors, (9486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:23,346 INFO L175 Difference]: Start difference. First operand has 176 places, 168 transitions, 1292 flow. Second operand 16 states and 3855 transitions. [2023-09-01 04:43:23,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 295 transitions, 2465 flow [2023-09-01 04:43:23,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 295 transitions, 2407 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-09-01 04:43:23,454 INFO L231 Difference]: Finished difference. Result has 187 places, 173 transitions, 1420 flow [2023-09-01 04:43:23,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1420, PETRI_PLACES=187, PETRI_TRANSITIONS=173} [2023-09-01 04:43:23,455 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 111 predicate places. [2023-09-01 04:43:23,455 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 173 transitions, 1420 flow [2023-09-01 04:43:23,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:23,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:23,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:23,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 04:43:23,456 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:23,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1443120322, now seen corresponding path program 4 times [2023-09-01 04:43:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:23,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805879818] [2023-09-01 04:43:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:24,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805879818] [2023-09-01 04:43:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805879818] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:24,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:24,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-09-01 04:43:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613645084] [2023-09-01 04:43:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:24,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-09-01 04:43:24,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:24,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-09-01 04:43:24,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-09-01 04:43:25,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 558 [2023-09-01 04:43:25,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 173 transitions, 1420 flow. Second operand has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:25,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:25,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 558 [2023-09-01 04:43:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:29,688 INFO L130 PetriNetUnfolder]: 18751/32554 cut-off events. [2023-09-01 04:43:29,689 INFO L131 PetriNetUnfolder]: For 32951/32959 co-relation queries the response was YES. [2023-09-01 04:43:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92226 conditions, 32554 events. 18751/32554 cut-off events. For 32951/32959 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 239135 event pairs, 9187 based on Foata normal form. 26/26897 useless extension candidates. Maximal degree in co-relation 92054. Up to 27122 conditions per place. [2023-09-01 04:43:29,948 INFO L137 encePairwiseOnDemand]: 543/558 looper letters, 230 selfloop transitions, 49 changer transitions 3/289 dead transitions. [2023-09-01 04:43:29,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 289 transitions, 2526 flow [2023-09-01 04:43:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 04:43:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 04:43:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3617 transitions. [2023-09-01 04:43:29,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43213859020310635 [2023-09-01 04:43:29,952 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3617 transitions. [2023-09-01 04:43:29,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3617 transitions. [2023-09-01 04:43:29,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:29,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3617 transitions. [2023-09-01 04:43:29,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 241.13333333333333) internal successors, (3617), 15 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:29,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:29,962 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:29,962 INFO L175 Difference]: Start difference. First operand has 187 places, 173 transitions, 1420 flow. Second operand 15 states and 3617 transitions. [2023-09-01 04:43:29,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 289 transitions, 2526 flow [2023-09-01 04:43:30,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 289 transitions, 2429 flow, removed 11 selfloop flow, removed 11 redundant places. [2023-09-01 04:43:30,100 INFO L231 Difference]: Finished difference. Result has 192 places, 175 transitions, 1474 flow [2023-09-01 04:43:30,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1474, PETRI_PLACES=192, PETRI_TRANSITIONS=175} [2023-09-01 04:43:30,101 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 116 predicate places. [2023-09-01 04:43:30,101 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 175 transitions, 1474 flow [2023-09-01 04:43:30,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 231.33333333333334) internal successors, (3470), 15 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:30,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:30,102 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-09-01 04:43:30,102 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:30,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash 452925267, now seen corresponding path program 1 times [2023-09-01 04:43:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:30,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979172382] [2023-09-01 04:43:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 04:43:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979172382] [2023-09-01 04:43:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979172382] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:43:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836474494] [2023-09-01 04:43:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:30,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:43:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:43:30,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:43:30,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 558 [2023-09-01 04:43:30,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 175 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:30,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:30,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 558 [2023-09-01 04:43:30,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:33,337 INFO L130 PetriNetUnfolder]: 16594/28910 cut-off events. [2023-09-01 04:43:33,338 INFO L131 PetriNetUnfolder]: For 34433/34442 co-relation queries the response was YES. [2023-09-01 04:43:33,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83079 conditions, 28910 events. 16594/28910 cut-off events. For 34433/34442 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 208800 event pairs, 6894 based on Foata normal form. 9/24561 useless extension candidates. Maximal degree in co-relation 82905. Up to 21524 conditions per place. [2023-09-01 04:43:33,557 INFO L137 encePairwiseOnDemand]: 553/558 looper letters, 186 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2023-09-01 04:43:33,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 1985 flow [2023-09-01 04:43:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:43:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:43:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2023-09-01 04:43:33,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53584229390681 [2023-09-01 04:43:33,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 897 transitions. [2023-09-01 04:43:33,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 897 transitions. [2023-09-01 04:43:33,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:33,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 897 transitions. [2023-09-01 04:43:33,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:33,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:33,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:33,562 INFO L175 Difference]: Start difference. First operand has 192 places, 175 transitions, 1474 flow. Second operand 3 states and 897 transitions. [2023-09-01 04:43:33,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 1985 flow [2023-09-01 04:43:33,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 206 transitions, 1917 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-09-01 04:43:33,861 INFO L231 Difference]: Finished difference. Result has 183 places, 174 transitions, 1414 flow [2023-09-01 04:43:33,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=183, PETRI_TRANSITIONS=174} [2023-09-01 04:43:33,862 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 107 predicate places. [2023-09-01 04:43:33,862 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 174 transitions, 1414 flow [2023-09-01 04:43:33,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:33,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:33,863 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:33,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 04:43:33,863 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:33,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash 452925224, now seen corresponding path program 1 times [2023-09-01 04:43:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:33,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888358185] [2023-09-01 04:43:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:33,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888358185] [2023-09-01 04:43:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888358185] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:43:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8786573] [2023-09-01 04:43:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:33,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:43:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:43:33,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:43:33,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 558 [2023-09-01 04:43:33,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 174 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:33,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:33,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 558 [2023-09-01 04:43:33,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:36,679 INFO L130 PetriNetUnfolder]: 14864/26128 cut-off events. [2023-09-01 04:43:36,680 INFO L131 PetriNetUnfolder]: For 36364/36373 co-relation queries the response was YES. [2023-09-01 04:43:36,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76420 conditions, 26128 events. 14864/26128 cut-off events. For 36364/36373 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 186173 event pairs, 7692 based on Foata normal form. 1019/23566 useless extension candidates. Maximal degree in co-relation 76247. Up to 22832 conditions per place. [2023-09-01 04:43:36,900 INFO L137 encePairwiseOnDemand]: 555/558 looper letters, 164 selfloop transitions, 1 changer transitions 0/181 dead transitions. [2023-09-01 04:43:36,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 181 transitions, 1784 flow [2023-09-01 04:43:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:43:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:43:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2023-09-01 04:43:36,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526284348864994 [2023-09-01 04:43:36,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 881 transitions. [2023-09-01 04:43:36,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 881 transitions. [2023-09-01 04:43:36,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:36,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 881 transitions. [2023-09-01 04:43:36,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:36,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:36,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:36,905 INFO L175 Difference]: Start difference. First operand has 183 places, 174 transitions, 1414 flow. Second operand 3 states and 881 transitions. [2023-09-01 04:43:36,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 181 transitions, 1784 flow [2023-09-01 04:43:37,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 181 transitions, 1780 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:43:37,019 INFO L231 Difference]: Finished difference. Result has 182 places, 172 transitions, 1404 flow [2023-09-01 04:43:37,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1404, PETRI_PLACES=182, PETRI_TRANSITIONS=172} [2023-09-01 04:43:37,019 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 106 predicate places. [2023-09-01 04:43:37,020 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 172 transitions, 1404 flow [2023-09-01 04:43:37,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:37,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:37,020 INFO L208 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] [2023-09-01 04:43:37,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-09-01 04:43:37,020 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:37,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash -742070962, now seen corresponding path program 1 times [2023-09-01 04:43:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176873568] [2023-09-01 04:43:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176873568] [2023-09-01 04:43:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176873568] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:38,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:43:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916720212] [2023-09-01 04:43:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:38,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:43:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:43:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:43:39,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 558 [2023-09-01 04:43:39,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 172 transitions, 1404 flow. Second operand has 13 states, 13 states have (on average 230.69230769230768) internal successors, (2999), 13 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) [2023-09-01 04:43:39,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:39,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 558 [2023-09-01 04:43:39,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:43,764 INFO L130 PetriNetUnfolder]: 16172/28152 cut-off events. [2023-09-01 04:43:43,764 INFO L131 PetriNetUnfolder]: For 34145/34145 co-relation queries the response was YES. [2023-09-01 04:43:43,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82595 conditions, 28152 events. 16172/28152 cut-off events. For 34145/34145 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 199476 event pairs, 12434 based on Foata normal form. 0/24474 useless extension candidates. Maximal degree in co-relation 82421. Up to 24976 conditions per place. [2023-09-01 04:43:44,238 INFO L137 encePairwiseOnDemand]: 542/558 looper letters, 200 selfloop transitions, 36 changer transitions 3/246 dead transitions. [2023-09-01 04:43:44,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 246 transitions, 2294 flow [2023-09-01 04:43:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 04:43:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 04:43:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3111 transitions. [2023-09-01 04:43:44,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42886683209263854 [2023-09-01 04:43:44,242 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3111 transitions. [2023-09-01 04:43:44,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3111 transitions. [2023-09-01 04:43:44,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:44,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3111 transitions. [2023-09-01 04:43:44,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 239.30769230769232) internal successors, (3111), 13 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:44,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:44,251 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:44,252 INFO L175 Difference]: Start difference. First operand has 182 places, 172 transitions, 1404 flow. Second operand 13 states and 3111 transitions. [2023-09-01 04:43:44,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 246 transitions, 2294 flow [2023-09-01 04:43:44,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 246 transitions, 2292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:43:44,411 INFO L231 Difference]: Finished difference. Result has 199 places, 183 transitions, 1649 flow [2023-09-01 04:43:44,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1649, PETRI_PLACES=199, PETRI_TRANSITIONS=183} [2023-09-01 04:43:44,412 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 123 predicate places. [2023-09-01 04:43:44,412 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 183 transitions, 1649 flow [2023-09-01 04:43:44,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 230.69230769230768) internal successors, (2999), 13 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) [2023-09-01 04:43:44,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:44,413 INFO L208 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] [2023-09-01 04:43:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-09-01 04:43:44,413 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:44,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -742070961, now seen corresponding path program 1 times [2023-09-01 04:43:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368747929] [2023-09-01 04:43:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:44,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:44,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368747929] [2023-09-01 04:43:44,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368747929] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:44,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-09-01 04:43:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786453157] [2023-09-01 04:43:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:44,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 04:43:44,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 04:43:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-09-01 04:43:45,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 558 [2023-09-01 04:43:45,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 183 transitions, 1649 flow. Second operand has 12 states, 12 states have (on average 231.83333333333334) internal successors, (2782), 12 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:45,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:45,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 558 [2023-09-01 04:43:45,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:52,754 INFO L130 PetriNetUnfolder]: 30579/52828 cut-off events. [2023-09-01 04:43:52,755 INFO L131 PetriNetUnfolder]: For 60416/60426 co-relation queries the response was YES. [2023-09-01 04:43:53,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155550 conditions, 52828 events. 30579/52828 cut-off events. For 60416/60426 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 410874 event pairs, 6879 based on Foata normal form. 0/47245 useless extension candidates. Maximal degree in co-relation 155368. Up to 12053 conditions per place. [2023-09-01 04:43:53,503 INFO L137 encePairwiseOnDemand]: 534/558 looper letters, 415 selfloop transitions, 155 changer transitions 3/580 dead transitions. [2023-09-01 04:43:53,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 580 transitions, 4681 flow [2023-09-01 04:43:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:43:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:43:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4503 transitions. [2023-09-01 04:43:53,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4483273596176822 [2023-09-01 04:43:53,510 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4503 transitions. [2023-09-01 04:43:53,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4503 transitions. [2023-09-01 04:43:53,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:53,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4503 transitions. [2023-09-01 04:43:53,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 250.16666666666666) internal successors, (4503), 18 states have internal predecessors, (4503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:53,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:53,527 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:53,527 INFO L175 Difference]: Start difference. First operand has 199 places, 183 transitions, 1649 flow. Second operand 18 states and 4503 transitions. [2023-09-01 04:43:53,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 580 transitions, 4681 flow [2023-09-01 04:43:53,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 580 transitions, 4634 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-09-01 04:43:53,939 INFO L231 Difference]: Finished difference. Result has 217 places, 280 transitions, 2965 flow [2023-09-01 04:43:53,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2965, PETRI_PLACES=217, PETRI_TRANSITIONS=280} [2023-09-01 04:43:53,940 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 141 predicate places. [2023-09-01 04:43:53,940 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 280 transitions, 2965 flow [2023-09-01 04:43:53,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 231.83333333333334) internal successors, (2782), 12 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:53,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:53,940 INFO L208 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] [2023-09-01 04:43:53,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-09-01 04:43:53,941 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:43:53,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2108738361, now seen corresponding path program 1 times [2023-09-01 04:43:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848945844] [2023-09-01 04:43:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:53,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848945844] [2023-09-01 04:43:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848945844] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:43:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:43:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:43:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133770093] [2023-09-01 04:43:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:43:54,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:43:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:43:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:43:56,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 558 [2023-09-01 04:43:56,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 280 transitions, 2965 flow. Second operand has 13 states, 13 states have (on average 235.76923076923077) internal successors, (3065), 13 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:43:56,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:56,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 558 [2023-09-01 04:43:56,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:04,622 INFO L130 PetriNetUnfolder]: 31368/54385 cut-off events. [2023-09-01 04:44:04,623 INFO L131 PetriNetUnfolder]: For 110576/110576 co-relation queries the response was YES. [2023-09-01 04:44:05,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182710 conditions, 54385 events. 31368/54385 cut-off events. For 110576/110576 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 427019 event pairs, 22991 based on Foata normal form. 52/49693 useless extension candidates. Maximal degree in co-relation 182520. Up to 47751 conditions per place. [2023-09-01 04:44:05,240 INFO L137 encePairwiseOnDemand]: 544/558 looper letters, 343 selfloop transitions, 44 changer transitions 3/397 dead transitions. [2023-09-01 04:44:05,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 397 transitions, 4437 flow [2023-09-01 04:44:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 04:44:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 04:44:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3202 transitions. [2023-09-01 04:44:05,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44141163496002206 [2023-09-01 04:44:05,244 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3202 transitions. [2023-09-01 04:44:05,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3202 transitions. [2023-09-01 04:44:05,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:05,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3202 transitions. [2023-09-01 04:44:05,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 246.30769230769232) internal successors, (3202), 13 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:05,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:05,253 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:05,253 INFO L175 Difference]: Start difference. First operand has 217 places, 280 transitions, 2965 flow. Second operand 13 states and 3202 transitions. [2023-09-01 04:44:05,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 397 transitions, 4437 flow [2023-09-01 04:44:05,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 397 transitions, 4340 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-09-01 04:44:05,996 INFO L231 Difference]: Finished difference. Result has 227 places, 288 transitions, 3170 flow [2023-09-01 04:44:05,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2874, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3170, PETRI_PLACES=227, PETRI_TRANSITIONS=288} [2023-09-01 04:44:05,997 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 151 predicate places. [2023-09-01 04:44:05,997 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 288 transitions, 3170 flow [2023-09-01 04:44:05,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 235.76923076923077) internal successors, (3065), 13 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:05,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:05,998 INFO L208 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] [2023-09-01 04:44:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-09-01 04:44:05,998 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:44:05,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 426436787, now seen corresponding path program 2 times [2023-09-01 04:44:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155606640] [2023-09-01 04:44:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:06,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155606640] [2023-09-01 04:44:06,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155606640] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:06,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:06,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:44:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44014697] [2023-09-01 04:44:06,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:06,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:44:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:44:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:44:07,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 558 [2023-09-01 04:44:07,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 288 transitions, 3170 flow. Second operand has 13 states, 13 states have (on average 239.76923076923077) internal successors, (3117), 13 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:07,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:07,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 558 [2023-09-01 04:44:07,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:15,570 INFO L130 PetriNetUnfolder]: 31096/54039 cut-off events. [2023-09-01 04:44:15,571 INFO L131 PetriNetUnfolder]: For 107566/107566 co-relation queries the response was YES. [2023-09-01 04:44:16,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180047 conditions, 54039 events. 31096/54039 cut-off events. For 107566/107566 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 424022 event pairs, 18501 based on Foata normal form. 104/49043 useless extension candidates. Maximal degree in co-relation 179855. Up to 45395 conditions per place. [2023-09-01 04:44:16,242 INFO L137 encePairwiseOnDemand]: 545/558 looper letters, 314 selfloop transitions, 51 changer transitions 3/375 dead transitions. [2023-09-01 04:44:16,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 375 transitions, 4322 flow [2023-09-01 04:44:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 04:44:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 04:44:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2759 transitions. [2023-09-01 04:44:16,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2023-09-01 04:44:16,245 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2759 transitions. [2023-09-01 04:44:16,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2759 transitions. [2023-09-01 04:44:16,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:16,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2759 transitions. [2023-09-01 04:44:16,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 250.8181818181818) internal successors, (2759), 11 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:16,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 558.0) internal successors, (6696), 12 states have internal predecessors, (6696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:16,252 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 558.0) internal successors, (6696), 12 states have internal predecessors, (6696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:16,252 INFO L175 Difference]: Start difference. First operand has 227 places, 288 transitions, 3170 flow. Second operand 11 states and 2759 transitions. [2023-09-01 04:44:16,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 375 transitions, 4322 flow [2023-09-01 04:44:16,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 375 transitions, 4283 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-09-01 04:44:16,727 INFO L231 Difference]: Finished difference. Result has 234 places, 289 transitions, 3264 flow [2023-09-01 04:44:16,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=3133, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3264, PETRI_PLACES=234, PETRI_TRANSITIONS=289} [2023-09-01 04:44:16,727 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 158 predicate places. [2023-09-01 04:44:16,728 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 289 transitions, 3264 flow [2023-09-01 04:44:16,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 239.76923076923077) internal successors, (3117), 13 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:16,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:16,728 INFO L208 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] [2023-09-01 04:44:16,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-09-01 04:44:16,729 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:44:16,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1094065461, now seen corresponding path program 3 times [2023-09-01 04:44:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728394139] [2023-09-01 04:44:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:17,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728394139] [2023-09-01 04:44:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728394139] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:44:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50693951] [2023-09-01 04:44:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:17,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:44:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:44:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:44:18,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 558 [2023-09-01 04:44:18,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 289 transitions, 3264 flow. Second operand has 13 states, 13 states have (on average 235.76923076923077) internal successors, (3065), 13 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:18,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:18,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 558 [2023-09-01 04:44:18,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:27,442 INFO L130 PetriNetUnfolder]: 32375/56119 cut-off events. [2023-09-01 04:44:27,442 INFO L131 PetriNetUnfolder]: For 114671/114675 co-relation queries the response was YES. [2023-09-01 04:44:27,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187416 conditions, 56119 events. 32375/56119 cut-off events. For 114671/114675 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 441346 event pairs, 13081 based on Foata normal form. 100/51021 useless extension candidates. Maximal degree in co-relation 187223. Up to 44526 conditions per place. [2023-09-01 04:44:28,117 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 357 selfloop transitions, 68 changer transitions 0/432 dead transitions. [2023-09-01 04:44:28,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 432 transitions, 4815 flow [2023-09-01 04:44:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 04:44:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 04:44:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3227 transitions. [2023-09-01 04:44:28,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448580093741384 [2023-09-01 04:44:28,122 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3227 transitions. [2023-09-01 04:44:28,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3227 transitions. [2023-09-01 04:44:28,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:28,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3227 transitions. [2023-09-01 04:44:28,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 248.23076923076923) internal successors, (3227), 13 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:28,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:28,131 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:28,131 INFO L175 Difference]: Start difference. First operand has 234 places, 289 transitions, 3264 flow. Second operand 13 states and 3227 transitions. [2023-09-01 04:44:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 432 transitions, 4815 flow [2023-09-01 04:44:28,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 432 transitions, 4719 flow, removed 3 selfloop flow, removed 9 redundant places. [2023-09-01 04:44:28,640 INFO L231 Difference]: Finished difference. Result has 240 places, 301 transitions, 3488 flow [2023-09-01 04:44:28,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3488, PETRI_PLACES=240, PETRI_TRANSITIONS=301} [2023-09-01 04:44:28,641 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 164 predicate places. [2023-09-01 04:44:28,641 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 301 transitions, 3488 flow [2023-09-01 04:44:28,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 235.76923076923077) internal successors, (3065), 13 states have internal predecessors, (3065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:28,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:28,641 INFO L208 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] [2023-09-01 04:44:28,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-09-01 04:44:28,641 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:44:28,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 608756118, now seen corresponding path program 1 times [2023-09-01 04:44:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763984979] [2023-09-01 04:44:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763984979] [2023-09-01 04:44:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763984979] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:44:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690909652] [2023-09-01 04:44:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:29,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:44:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:44:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:44:30,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 558 [2023-09-01 04:44:30,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 301 transitions, 3488 flow. Second operand has 13 states, 13 states have (on average 230.76923076923077) internal successors, (3000), 13 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:30,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:30,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 558 [2023-09-01 04:44:30,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:39,683 INFO L130 PetriNetUnfolder]: 35270/60758 cut-off events. [2023-09-01 04:44:39,683 INFO L131 PetriNetUnfolder]: For 139632/139636 co-relation queries the response was YES. [2023-09-01 04:44:40,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207933 conditions, 60758 events. 35270/60758 cut-off events. For 139632/139636 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 476697 event pairs, 12296 based on Foata normal form. 234/55545 useless extension candidates. Maximal degree in co-relation 207737. Up to 27081 conditions per place. [2023-09-01 04:44:40,433 INFO L137 encePairwiseOnDemand]: 538/558 looper letters, 426 selfloop transitions, 178 changer transitions 0/611 dead transitions. [2023-09-01 04:44:40,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 611 transitions, 6309 flow [2023-09-01 04:44:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 04:44:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 04:44:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3747 transitions. [2023-09-01 04:44:40,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44767025089605733 [2023-09-01 04:44:40,437 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3747 transitions. [2023-09-01 04:44:40,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3747 transitions. [2023-09-01 04:44:40,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:40,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3747 transitions. [2023-09-01 04:44:40,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 249.8) internal successors, (3747), 15 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,446 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 558.0) internal successors, (8928), 16 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:40,446 INFO L175 Difference]: Start difference. First operand has 240 places, 301 transitions, 3488 flow. Second operand 15 states and 3747 transitions. [2023-09-01 04:44:40,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 611 transitions, 6309 flow [2023-09-01 04:44:41,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 611 transitions, 6232 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-09-01 04:44:41,067 INFO L231 Difference]: Finished difference. Result has 251 places, 349 transitions, 4466 flow [2023-09-01 04:44:41,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=3415, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4466, PETRI_PLACES=251, PETRI_TRANSITIONS=349} [2023-09-01 04:44:41,068 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 175 predicate places. [2023-09-01 04:44:41,068 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 349 transitions, 4466 flow [2023-09-01 04:44:41,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 230.76923076923077) internal successors, (3000), 13 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:41,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:41,069 INFO L208 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] [2023-09-01 04:44:41,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-09-01 04:44:41,069 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:44:41,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1509669113, now seen corresponding path program 4 times [2023-09-01 04:44:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:41,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365388246] [2023-09-01 04:44:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365388246] [2023-09-01 04:44:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365388246] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:42,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:42,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-09-01 04:44:42,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218994660] [2023-09-01 04:44:42,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:42,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 04:44:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 04:44:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-09-01 04:44:43,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 558 [2023-09-01 04:44:43,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 349 transitions, 4466 flow. Second operand has 13 states, 13 states have (on average 236.76923076923077) internal successors, (3078), 13 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:43,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:43,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 558 [2023-09-01 04:44:43,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:53,878 INFO L130 PetriNetUnfolder]: 34045/59247 cut-off events. [2023-09-01 04:44:53,878 INFO L131 PetriNetUnfolder]: For 171754/171754 co-relation queries the response was YES. [2023-09-01 04:44:54,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214365 conditions, 59247 events. 34045/59247 cut-off events. For 171754/171754 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 469841 event pairs, 14726 based on Foata normal form. 104/54130 useless extension candidates. Maximal degree in co-relation 167123. Up to 48451 conditions per place. [2023-09-01 04:44:54,615 INFO L137 encePairwiseOnDemand]: 545/558 looper letters, 372 selfloop transitions, 53 changer transitions 3/435 dead transitions. [2023-09-01 04:44:54,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 435 transitions, 5681 flow [2023-09-01 04:44:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 04:44:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 04:44:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2964 transitions. [2023-09-01 04:44:54,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44265232974910396 [2023-09-01 04:44:54,618 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2964 transitions. [2023-09-01 04:44:54,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2964 transitions. [2023-09-01 04:44:54,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:54,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2964 transitions. [2023-09-01 04:44:54,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 247.0) internal successors, (2964), 12 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:54,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 558.0) internal successors, (7254), 13 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:54,631 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 558.0) internal successors, (7254), 13 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:54,631 INFO L175 Difference]: Start difference. First operand has 251 places, 349 transitions, 4466 flow. Second operand 12 states and 2964 transitions. [2023-09-01 04:44:54,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 435 transitions, 5681 flow [2023-09-01 04:44:55,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 435 transitions, 5599 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-09-01 04:44:55,816 INFO L231 Difference]: Finished difference. Result has 257 places, 342 transitions, 4425 flow [2023-09-01 04:44:55,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=4286, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4425, PETRI_PLACES=257, PETRI_TRANSITIONS=342} [2023-09-01 04:44:55,817 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 181 predicate places. [2023-09-01 04:44:55,817 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 342 transitions, 4425 flow [2023-09-01 04:44:55,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 236.76923076923077) internal successors, (3078), 13 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:55,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:55,818 INFO L208 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] [2023-09-01 04:44:55,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-09-01 04:44:55,818 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:44:55,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1649093189, now seen corresponding path program 1 times [2023-09-01 04:44:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118782597] [2023-09-01 04:44:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118782597] [2023-09-01 04:44:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118782597] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:44:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141781838] [2023-09-01 04:44:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:55,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:44:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:55,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:44:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:44:55,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 558 [2023-09-01 04:44:55,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 342 transitions, 4425 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:55,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:55,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 558 [2023-09-01 04:44:55,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:58,653 INFO L130 PetriNetUnfolder]: 10486/18617 cut-off events. [2023-09-01 04:44:58,654 INFO L131 PetriNetUnfolder]: For 70065/70138 co-relation queries the response was YES. [2023-09-01 04:44:58,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67691 conditions, 18617 events. 10486/18617 cut-off events. For 70065/70138 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 122242 event pairs, 6164 based on Foata normal form. 657/18331 useless extension candidates. Maximal degree in co-relation 67489. Up to 9326 conditions per place. [2023-09-01 04:44:58,828 INFO L137 encePairwiseOnDemand]: 555/558 looper letters, 206 selfloop transitions, 2 changer transitions 1/225 dead transitions. [2023-09-01 04:44:58,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 225 transitions, 3267 flow [2023-09-01 04:44:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:44:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:44:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2023-09-01 04:44:58,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2023-09-01 04:44:58,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2023-09-01 04:44:58,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2023-09-01 04:44:58,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:58,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2023-09-01 04:44:58,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:58,832 INFO L175 Difference]: Start difference. First operand has 257 places, 342 transitions, 4425 flow. Second operand 3 states and 891 transitions. [2023-09-01 04:44:58,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 225 transitions, 3267 flow [2023-09-01 04:44:59,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 225 transitions, 3055 flow, removed 16 selfloop flow, removed 17 redundant places. [2023-09-01 04:44:59,125 INFO L231 Difference]: Finished difference. Result has 242 places, 209 transitions, 2577 flow [2023-09-01 04:44:59,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2561, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2577, PETRI_PLACES=242, PETRI_TRANSITIONS=209} [2023-09-01 04:44:59,126 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 166 predicate places. [2023-09-01 04:44:59,126 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 209 transitions, 2577 flow [2023-09-01 04:44:59,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:59,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:59,127 INFO L208 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] [2023-09-01 04:44:59,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-09-01 04:44:59,127 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:44:59,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 782403557, now seen corresponding path program 1 times [2023-09-01 04:44:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:59,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624726061] [2023-09-01 04:44:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:59,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:59,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624726061] [2023-09-01 04:44:59,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624726061] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:44:59,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:44:59,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:44:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916913892] [2023-09-01 04:44:59,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:44:59,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:44:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:44:59,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:44:59,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 558 [2023-09-01 04:44:59,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 209 transitions, 2577 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:44:59,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:59,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 558 [2023-09-01 04:44:59,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:01,267 INFO L130 PetriNetUnfolder]: 8171/15375 cut-off events. [2023-09-01 04:45:01,268 INFO L131 PetriNetUnfolder]: For 44305/44326 co-relation queries the response was YES. [2023-09-01 04:45:01,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54065 conditions, 15375 events. 8171/15375 cut-off events. For 44305/44326 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 100428 event pairs, 1779 based on Foata normal form. 1351/15970 useless extension candidates. Maximal degree in co-relation 52877. Up to 11290 conditions per place. [2023-09-01 04:45:01,377 INFO L137 encePairwiseOnDemand]: 552/558 looper letters, 197 selfloop transitions, 9 changer transitions 0/222 dead transitions. [2023-09-01 04:45:01,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 222 transitions, 3070 flow [2023-09-01 04:45:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:45:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:45:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2023-09-01 04:45:01,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526284348864994 [2023-09-01 04:45:01,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 881 transitions. [2023-09-01 04:45:01,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 881 transitions. [2023-09-01 04:45:01,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:01,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 881 transitions. [2023-09-01 04:45:01,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:01,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:01,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 558.0) internal successors, (2232), 4 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:01,381 INFO L175 Difference]: Start difference. First operand has 242 places, 209 transitions, 2577 flow. Second operand 3 states and 881 transitions. [2023-09-01 04:45:01,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 222 transitions, 3070 flow [2023-09-01 04:45:01,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 222 transitions, 3022 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 04:45:01,583 INFO L231 Difference]: Finished difference. Result has 240 places, 209 transitions, 2549 flow [2023-09-01 04:45:01,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2549, PETRI_PLACES=240, PETRI_TRANSITIONS=209} [2023-09-01 04:45:01,584 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 164 predicate places. [2023-09-01 04:45:01,584 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 209 transitions, 2549 flow [2023-09-01 04:45:01,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:01,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:01,585 INFO L208 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] [2023-09-01 04:45:01,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-09-01 04:45:01,585 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:01,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1229417445, now seen corresponding path program 1 times [2023-09-01 04:45:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110686329] [2023-09-01 04:45:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110686329] [2023-09-01 04:45:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110686329] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 04:45:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947071498] [2023-09-01 04:45:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:01,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 04:45:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:01,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 04:45:01,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-09-01 04:45:02,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 558 [2023-09-01 04:45:02,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 209 transitions, 2549 flow. Second operand has 9 states, 9 states have (on average 250.55555555555554) internal successors, (2255), 9 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:02,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:02,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 558 [2023-09-01 04:45:02,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:04,501 INFO L130 PetriNetUnfolder]: 7862/14976 cut-off events. [2023-09-01 04:45:04,501 INFO L131 PetriNetUnfolder]: For 41110/41188 co-relation queries the response was YES. [2023-09-01 04:45:04,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53808 conditions, 14976 events. 7862/14976 cut-off events. For 41110/41188 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 99029 event pairs, 1945 based on Foata normal form. 26/14315 useless extension candidates. Maximal degree in co-relation 47673. Up to 4400 conditions per place. [2023-09-01 04:45:04,608 INFO L137 encePairwiseOnDemand]: 543/558 looper letters, 209 selfloop transitions, 63 changer transitions 1/279 dead transitions. [2023-09-01 04:45:04,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 279 transitions, 3413 flow [2023-09-01 04:45:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 04:45:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 04:45:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2358 transitions. [2023-09-01 04:45:04,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46953405017921146 [2023-09-01 04:45:04,612 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2358 transitions. [2023-09-01 04:45:04,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2358 transitions. [2023-09-01 04:45:04,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:04,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2358 transitions. [2023-09-01 04:45:04,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 262.0) internal successors, (2358), 9 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:04,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 558.0) internal successors, (5580), 10 states have internal predecessors, (5580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:04,618 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 558.0) internal successors, (5580), 10 states have internal predecessors, (5580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:04,618 INFO L175 Difference]: Start difference. First operand has 240 places, 209 transitions, 2549 flow. Second operand 9 states and 2358 transitions. [2023-09-01 04:45:04,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 279 transitions, 3413 flow [2023-09-01 04:45:04,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 279 transitions, 3395 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:45:04,833 INFO L231 Difference]: Finished difference. Result has 250 places, 213 transitions, 2740 flow [2023-09-01 04:45:04,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2740, PETRI_PLACES=250, PETRI_TRANSITIONS=213} [2023-09-01 04:45:04,834 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 174 predicate places. [2023-09-01 04:45:04,834 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 213 transitions, 2740 flow [2023-09-01 04:45:04,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 250.55555555555554) internal successors, (2255), 9 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:04,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:04,834 INFO L208 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] [2023-09-01 04:45:04,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-09-01 04:45:04,835 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:04,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash -420185818, now seen corresponding path program 1 times [2023-09-01 04:45:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:04,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508771780] [2023-09-01 04:45:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:04,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508771780] [2023-09-01 04:45:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508771780] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:05,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:05,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-09-01 04:45:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980384788] [2023-09-01 04:45:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:05,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 04:45:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 04:45:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-09-01 04:45:07,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 558 [2023-09-01 04:45:07,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 213 transitions, 2740 flow. Second operand has 16 states, 16 states have (on average 237.0) internal successors, (3792), 16 states have internal predecessors, (3792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:07,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:07,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 558 [2023-09-01 04:45:07,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:10,529 INFO L130 PetriNetUnfolder]: 8368/16004 cut-off events. [2023-09-01 04:45:10,529 INFO L131 PetriNetUnfolder]: For 47766/47820 co-relation queries the response was YES. [2023-09-01 04:45:10,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57905 conditions, 16004 events. 8368/16004 cut-off events. For 47766/47820 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 108441 event pairs, 2491 based on Foata normal form. 18/15457 useless extension candidates. Maximal degree in co-relation 51680. Up to 4475 conditions per place. [2023-09-01 04:45:10,624 INFO L137 encePairwiseOnDemand]: 536/558 looper letters, 369 selfloop transitions, 118 changer transitions 6/499 dead transitions. [2023-09-01 04:45:10,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 499 transitions, 5116 flow [2023-09-01 04:45:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-01 04:45:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-09-01 04:45:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 7877 transitions. [2023-09-01 04:45:10,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411402329749104 [2023-09-01 04:45:10,631 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 7877 transitions. [2023-09-01 04:45:10,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 7877 transitions. [2023-09-01 04:45:10,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:10,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 7877 transitions. [2023-09-01 04:45:10,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 246.15625) internal successors, (7877), 32 states have internal predecessors, (7877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:10,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 558.0) internal successors, (18414), 33 states have internal predecessors, (18414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:10,658 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 558.0) internal successors, (18414), 33 states have internal predecessors, (18414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:10,658 INFO L175 Difference]: Start difference. First operand has 250 places, 213 transitions, 2740 flow. Second operand 32 states and 7877 transitions. [2023-09-01 04:45:10,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 499 transitions, 5116 flow [2023-09-01 04:45:10,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 499 transitions, 5057 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-09-01 04:45:10,929 INFO L231 Difference]: Finished difference. Result has 281 places, 228 transitions, 3109 flow [2023-09-01 04:45:10,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2685, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=3109, PETRI_PLACES=281, PETRI_TRANSITIONS=228} [2023-09-01 04:45:10,929 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 205 predicate places. [2023-09-01 04:45:10,930 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 228 transitions, 3109 flow [2023-09-01 04:45:10,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 237.0) internal successors, (3792), 16 states have internal predecessors, (3792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:10,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:10,931 INFO L208 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] [2023-09-01 04:45:10,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-09-01 04:45:10,931 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:10,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 578401396, now seen corresponding path program 2 times [2023-09-01 04:45:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311521131] [2023-09-01 04:45:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:12,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311521131] [2023-09-01 04:45:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311521131] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:12,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:12,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-09-01 04:45:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176522122] [2023-09-01 04:45:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:12,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-01 04:45:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-01 04:45:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-09-01 04:45:14,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 558 [2023-09-01 04:45:14,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 228 transitions, 3109 flow. Second operand has 19 states, 19 states have (on average 225.68421052631578) internal successors, (4288), 19 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:14,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:14,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 558 [2023-09-01 04:45:14,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:17,538 INFO L130 PetriNetUnfolder]: 8364/16052 cut-off events. [2023-09-01 04:45:17,538 INFO L131 PetriNetUnfolder]: For 53802/53870 co-relation queries the response was YES. [2023-09-01 04:45:17,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59929 conditions, 16052 events. 8364/16052 cut-off events. For 53802/53870 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 109124 event pairs, 3869 based on Foata normal form. 42/15588 useless extension candidates. Maximal degree in co-relation 58626. Up to 9300 conditions per place. [2023-09-01 04:45:17,651 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 266 selfloop transitions, 79 changer transitions 7/358 dead transitions. [2023-09-01 04:45:17,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 358 transitions, 4457 flow [2023-09-01 04:45:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:45:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:45:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4217 transitions. [2023-09-01 04:45:17,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.419852648347272 [2023-09-01 04:45:17,654 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4217 transitions. [2023-09-01 04:45:17,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4217 transitions. [2023-09-01 04:45:17,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:17,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4217 transitions. [2023-09-01 04:45:17,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 234.27777777777777) internal successors, (4217), 18 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:17,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:17,662 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:17,662 INFO L175 Difference]: Start difference. First operand has 281 places, 228 transitions, 3109 flow. Second operand 18 states and 4217 transitions. [2023-09-01 04:45:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 358 transitions, 4457 flow [2023-09-01 04:45:17,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 358 transitions, 4215 flow, removed 9 selfloop flow, removed 21 redundant places. [2023-09-01 04:45:17,892 INFO L231 Difference]: Finished difference. Result has 280 places, 234 transitions, 3117 flow [2023-09-01 04:45:17,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2871, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3117, PETRI_PLACES=280, PETRI_TRANSITIONS=234} [2023-09-01 04:45:17,893 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 204 predicate places. [2023-09-01 04:45:17,893 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 234 transitions, 3117 flow [2023-09-01 04:45:17,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 225.68421052631578) internal successors, (4288), 19 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:17,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:17,894 INFO L208 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] [2023-09-01 04:45:17,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-09-01 04:45:17,894 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:17,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash -46020788, now seen corresponding path program 3 times [2023-09-01 04:45:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651523071] [2023-09-01 04:45:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:19,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651523071] [2023-09-01 04:45:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651523071] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:19,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:19,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-09-01 04:45:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148944158] [2023-09-01 04:45:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:19,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-01 04:45:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-01 04:45:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-09-01 04:45:22,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 558 [2023-09-01 04:45:22,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 234 transitions, 3117 flow. Second operand has 20 states, 20 states have (on average 225.6) internal successors, (4512), 20 states have internal predecessors, (4512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:22,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:22,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 558 [2023-09-01 04:45:22,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:26,621 INFO L130 PetriNetUnfolder]: 8472/16312 cut-off events. [2023-09-01 04:45:26,621 INFO L131 PetriNetUnfolder]: For 51520/51552 co-relation queries the response was YES. [2023-09-01 04:45:26,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60470 conditions, 16312 events. 8472/16312 cut-off events. For 51520/51552 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 111056 event pairs, 2763 based on Foata normal form. 50/15853 useless extension candidates. Maximal degree in co-relation 59315. Up to 7575 conditions per place. [2023-09-01 04:45:26,737 INFO L137 encePairwiseOnDemand]: 539/558 looper letters, 257 selfloop transitions, 87 changer transitions 13/363 dead transitions. [2023-09-01 04:45:26,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 363 transitions, 4452 flow [2023-09-01 04:45:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:45:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:45:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4215 transitions. [2023-09-01 04:45:26,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41965352449223414 [2023-09-01 04:45:26,740 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4215 transitions. [2023-09-01 04:45:26,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4215 transitions. [2023-09-01 04:45:26,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:26,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4215 transitions. [2023-09-01 04:45:26,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 234.16666666666666) internal successors, (4215), 18 states have internal predecessors, (4215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:26,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:26,748 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:26,748 INFO L175 Difference]: Start difference. First operand has 280 places, 234 transitions, 3117 flow. Second operand 18 states and 4215 transitions. [2023-09-01 04:45:26,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 363 transitions, 4452 flow [2023-09-01 04:45:26,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 363 transitions, 4296 flow, removed 3 selfloop flow, removed 15 redundant places. [2023-09-01 04:45:26,999 INFO L231 Difference]: Finished difference. Result has 285 places, 239 transitions, 3223 flow [2023-09-01 04:45:26,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2961, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3223, PETRI_PLACES=285, PETRI_TRANSITIONS=239} [2023-09-01 04:45:27,000 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 209 predicate places. [2023-09-01 04:45:27,000 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 239 transitions, 3223 flow [2023-09-01 04:45:27,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 225.6) internal successors, (4512), 20 states have internal predecessors, (4512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:27,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:27,001 INFO L208 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] [2023-09-01 04:45:27,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-09-01 04:45:27,001 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:27,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -618680647, now seen corresponding path program 2 times [2023-09-01 04:45:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573716396] [2023-09-01 04:45:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573716396] [2023-09-01 04:45:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573716396] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:28,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-09-01 04:45:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583869769] [2023-09-01 04:45:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-01 04:45:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-01 04:45:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-09-01 04:45:30,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 558 [2023-09-01 04:45:30,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 239 transitions, 3223 flow. Second operand has 19 states, 19 states have (on average 229.68421052631578) internal successors, (4364), 19 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:30,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:30,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 558 [2023-09-01 04:45:30,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:33,837 INFO L130 PetriNetUnfolder]: 8454/16240 cut-off events. [2023-09-01 04:45:33,837 INFO L131 PetriNetUnfolder]: For 56842/56878 co-relation queries the response was YES. [2023-09-01 04:45:33,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61246 conditions, 16240 events. 8454/16240 cut-off events. For 56842/56878 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 110351 event pairs, 1671 based on Foata normal form. 50/15777 useless extension candidates. Maximal degree in co-relation 57936. Up to 7082 conditions per place. [2023-09-01 04:45:33,987 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 252 selfloop transitions, 88 changer transitions 13/359 dead transitions. [2023-09-01 04:45:33,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 359 transitions, 4496 flow [2023-09-01 04:45:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 04:45:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 04:45:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4284 transitions. [2023-09-01 04:45:33,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2023-09-01 04:45:33,990 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 4284 transitions. [2023-09-01 04:45:33,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 4284 transitions. [2023-09-01 04:45:33,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:33,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 4284 transitions. [2023-09-01 04:45:33,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 238.0) internal successors, (4284), 18 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:33,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:33,998 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 558.0) internal successors, (10602), 19 states have internal predecessors, (10602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:33,998 INFO L175 Difference]: Start difference. First operand has 285 places, 239 transitions, 3223 flow. Second operand 18 states and 4284 transitions. [2023-09-01 04:45:33,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 359 transitions, 4496 flow [2023-09-01 04:45:34,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 359 transitions, 4367 flow, removed 1 selfloop flow, removed 13 redundant places. [2023-09-01 04:45:34,261 INFO L231 Difference]: Finished difference. Result has 288 places, 238 transitions, 3266 flow [2023-09-01 04:45:34,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=3090, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3266, PETRI_PLACES=288, PETRI_TRANSITIONS=238} [2023-09-01 04:45:34,262 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 212 predicate places. [2023-09-01 04:45:34,262 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 238 transitions, 3266 flow [2023-09-01 04:45:34,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 229.68421052631578) internal successors, (4364), 19 states have internal predecessors, (4364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:34,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:34,263 INFO L208 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] [2023-09-01 04:45:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-09-01 04:45:34,263 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:34,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1673998194, now seen corresponding path program 4 times [2023-09-01 04:45:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:34,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615662170] [2023-09-01 04:45:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615662170] [2023-09-01 04:45:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615662170] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-09-01 04:45:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873897115] [2023-09-01 04:45:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:35,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-01 04:45:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-01 04:45:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-09-01 04:45:37,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 558 [2023-09-01 04:45:37,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 238 transitions, 3266 flow. Second operand has 19 states, 19 states have (on average 225.68421052631578) internal successors, (4288), 19 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:37,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:37,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 558 [2023-09-01 04:45:37,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:40,683 INFO L130 PetriNetUnfolder]: 8429/16233 cut-off events. [2023-09-01 04:45:40,683 INFO L131 PetriNetUnfolder]: For 55586/55616 co-relation queries the response was YES. [2023-09-01 04:45:40,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61710 conditions, 16233 events. 8429/16233 cut-off events. For 55586/55616 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 110484 event pairs, 1841 based on Foata normal form. 30/15757 useless extension candidates. Maximal degree in co-relation 58588. Up to 7082 conditions per place. [2023-09-01 04:45:40,787 INFO L137 encePairwiseOnDemand]: 541/558 looper letters, 249 selfloop transitions, 85 changer transitions 12/352 dead transitions. [2023-09-01 04:45:40,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 352 transitions, 4490 flow [2023-09-01 04:45:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-01 04:45:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-09-01 04:45:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3981 transitions. [2023-09-01 04:45:40,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4196710942441493 [2023-09-01 04:45:40,791 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3981 transitions. [2023-09-01 04:45:40,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3981 transitions. [2023-09-01 04:45:40,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:40,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3981 transitions. [2023-09-01 04:45:40,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 234.1764705882353) internal successors, (3981), 17 states have internal predecessors, (3981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:40,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 558.0) internal successors, (10044), 18 states have internal predecessors, (10044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:40,798 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 558.0) internal successors, (10044), 18 states have internal predecessors, (10044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:40,798 INFO L175 Difference]: Start difference. First operand has 288 places, 238 transitions, 3266 flow. Second operand 17 states and 3981 transitions. [2023-09-01 04:45:40,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 352 transitions, 4490 flow [2023-09-01 04:45:41,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 352 transitions, 4337 flow, removed 0 selfloop flow, removed 15 redundant places. [2023-09-01 04:45:41,092 INFO L231 Difference]: Finished difference. Result has 290 places, 238 transitions, 3297 flow [2023-09-01 04:45:41,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3297, PETRI_PLACES=290, PETRI_TRANSITIONS=238} [2023-09-01 04:45:41,093 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 214 predicate places. [2023-09-01 04:45:41,093 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 238 transitions, 3297 flow [2023-09-01 04:45:41,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 225.68421052631578) internal successors, (4288), 19 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:41,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:41,094 INFO L208 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] [2023-09-01 04:45:41,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-09-01 04:45:41,094 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:41,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2072442387, now seen corresponding path program 1 times [2023-09-01 04:45:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:41,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984356586] [2023-09-01 04:45:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984356586] [2023-09-01 04:45:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984356586] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:42,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-09-01 04:45:42,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618725190] [2023-09-01 04:45:42,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:42,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-09-01 04:45:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:42,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-09-01 04:45:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-09-01 04:45:43,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 558 [2023-09-01 04:45:43,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 238 transitions, 3297 flow. Second operand has 17 states, 17 states have (on average 236.05882352941177) internal successors, (4013), 17 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:43,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:43,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 558 [2023-09-01 04:45:43,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:45,541 INFO L130 PetriNetUnfolder]: 7320/14098 cut-off events. [2023-09-01 04:45:45,541 INFO L131 PetriNetUnfolder]: For 56588/56656 co-relation queries the response was YES. [2023-09-01 04:45:45,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55932 conditions, 14098 events. 7320/14098 cut-off events. For 56588/56656 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 93492 event pairs, 3483 based on Foata normal form. 22/13767 useless extension candidates. Maximal degree in co-relation 53727. Up to 7736 conditions per place. [2023-09-01 04:45:45,654 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 240 selfloop transitions, 63 changer transitions 17/326 dead transitions. [2023-09-01 04:45:45,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 326 transitions, 4233 flow [2023-09-01 04:45:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-09-01 04:45:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-09-01 04:45:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3441 transitions. [2023-09-01 04:45:45,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2023-09-01 04:45:45,658 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3441 transitions. [2023-09-01 04:45:45,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3441 transitions. [2023-09-01 04:45:45,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:45,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3441 transitions. [2023-09-01 04:45:45,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 245.78571428571428) internal successors, (3441), 14 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 558.0) internal successors, (8370), 15 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,665 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 558.0) internal successors, (8370), 15 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,665 INFO L175 Difference]: Start difference. First operand has 290 places, 238 transitions, 3297 flow. Second operand 14 states and 3441 transitions. [2023-09-01 04:45:45,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 326 transitions, 4233 flow [2023-09-01 04:45:45,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 326 transitions, 3965 flow, removed 6 selfloop flow, removed 26 redundant places. [2023-09-01 04:45:45,930 INFO L231 Difference]: Finished difference. Result has 279 places, 226 transitions, 3012 flow [2023-09-01 04:45:45,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2864, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3012, PETRI_PLACES=279, PETRI_TRANSITIONS=226} [2023-09-01 04:45:45,930 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 203 predicate places. [2023-09-01 04:45:45,931 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 226 transitions, 3012 flow [2023-09-01 04:45:45,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 236.05882352941177) internal successors, (4013), 17 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:45,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:45,931 INFO L208 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] [2023-09-01 04:45:45,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-09-01 04:45:45,931 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:45,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash -929083495, now seen corresponding path program 2 times [2023-09-01 04:45:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547473054] [2023-09-01 04:45:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547473054] [2023-09-01 04:45:47,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547473054] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:47,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:47,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-09-01 04:45:47,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523760005] [2023-09-01 04:45:47,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:47,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-09-01 04:45:47,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-09-01 04:45:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-09-01 04:45:48,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 558 [2023-09-01 04:45:48,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 226 transitions, 3012 flow. Second operand has 18 states, 18 states have (on average 235.94444444444446) internal successors, (4247), 18 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:48,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:48,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 558 [2023-09-01 04:45:48,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:50,506 INFO L130 PetriNetUnfolder]: 6601/12787 cut-off events. [2023-09-01 04:45:50,506 INFO L131 PetriNetUnfolder]: For 48473/48505 co-relation queries the response was YES. [2023-09-01 04:45:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50875 conditions, 12787 events. 6601/12787 cut-off events. For 48473/48505 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 83249 event pairs, 2116 based on Foata normal form. 90/12772 useless extension candidates. Maximal degree in co-relation 48706. Up to 3914 conditions per place. [2023-09-01 04:45:50,593 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 226 selfloop transitions, 67 changer transitions 15/314 dead transitions. [2023-09-01 04:45:50,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 314 transitions, 3974 flow [2023-09-01 04:45:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 04:45:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 04:45:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3197 transitions. [2023-09-01 04:45:50,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4407223600771988 [2023-09-01 04:45:50,597 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3197 transitions. [2023-09-01 04:45:50,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3197 transitions. [2023-09-01 04:45:50,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:50,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3197 transitions. [2023-09-01 04:45:50,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 245.92307692307693) internal successors, (3197), 13 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:50,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:50,605 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 558.0) internal successors, (7812), 14 states have internal predecessors, (7812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:50,605 INFO L175 Difference]: Start difference. First operand has 279 places, 226 transitions, 3012 flow. Second operand 13 states and 3197 transitions. [2023-09-01 04:45:50,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 314 transitions, 3974 flow [2023-09-01 04:45:50,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 314 transitions, 3816 flow, removed 3 selfloop flow, removed 12 redundant places. [2023-09-01 04:45:50,838 INFO L231 Difference]: Finished difference. Result has 281 places, 222 transitions, 2945 flow [2023-09-01 04:45:50,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2945, PETRI_PLACES=281, PETRI_TRANSITIONS=222} [2023-09-01 04:45:50,839 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 205 predicate places. [2023-09-01 04:45:50,839 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 222 transitions, 2945 flow [2023-09-01 04:45:50,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 235.94444444444446) internal successors, (4247), 18 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:50,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:50,840 INFO L208 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] [2023-09-01 04:45:50,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-09-01 04:45:50,840 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:50,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1448900109, now seen corresponding path program 3 times [2023-09-01 04:45:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423388469] [2023-09-01 04:45:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423388469] [2023-09-01 04:45:52,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423388469] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:52,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:52,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-09-01 04:45:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862972776] [2023-09-01 04:45:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:52,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-09-01 04:45:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-09-01 04:45:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-09-01 04:45:52,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 558 [2023-09-01 04:45:52,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 222 transitions, 2945 flow. Second operand has 17 states, 17 states have (on average 236.05882352941177) internal successors, (4013), 17 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:52,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:52,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 558 [2023-09-01 04:45:52,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:54,801 INFO L130 PetriNetUnfolder]: 5692/11078 cut-off events. [2023-09-01 04:45:54,802 INFO L131 PetriNetUnfolder]: For 49427/49457 co-relation queries the response was YES. [2023-09-01 04:45:54,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46215 conditions, 11078 events. 5692/11078 cut-off events. For 49427/49457 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 73080 event pairs, 1181 based on Foata normal form. 50/11082 useless extension candidates. Maximal degree in co-relation 45059. Up to 2972 conditions per place. [2023-09-01 04:45:54,898 INFO L137 encePairwiseOnDemand]: 540/558 looper letters, 206 selfloop transitions, 77 changer transitions 19/308 dead transitions. [2023-09-01 04:45:54,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 308 transitions, 3779 flow [2023-09-01 04:45:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 04:45:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 04:45:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3913 transitions. [2023-09-01 04:45:54,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43828405017921146 [2023-09-01 04:45:54,901 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3913 transitions. [2023-09-01 04:45:54,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3913 transitions. [2023-09-01 04:45:54,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:54,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3913 transitions. [2023-09-01 04:45:54,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 244.5625) internal successors, (3913), 16 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:54,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 558.0) internal successors, (9486), 17 states have internal predecessors, (9486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:54,908 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 558.0) internal successors, (9486), 17 states have internal predecessors, (9486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:54,908 INFO L175 Difference]: Start difference. First operand has 281 places, 222 transitions, 2945 flow. Second operand 16 states and 3913 transitions. [2023-09-01 04:45:54,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 308 transitions, 3779 flow [2023-09-01 04:45:55,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 308 transitions, 3419 flow, removed 7 selfloop flow, removed 28 redundant places. [2023-09-01 04:45:55,162 INFO L231 Difference]: Finished difference. Result has 271 places, 203 transitions, 2547 flow [2023-09-01 04:45:55,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2547, PETRI_PLACES=271, PETRI_TRANSITIONS=203} [2023-09-01 04:45:55,163 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 195 predicate places. [2023-09-01 04:45:55,163 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 203 transitions, 2547 flow [2023-09-01 04:45:55,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 236.05882352941177) internal successors, (4013), 17 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:45:55,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:55,164 INFO L208 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] [2023-09-01 04:45:55,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-09-01 04:45:55,165 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:45:55,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:55,165 INFO L85 PathProgramCache]: Analyzing trace with hash 400375076, now seen corresponding path program 1 times [2023-09-01 04:45:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:55,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097339906] [2023-09-01 04:45:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:56,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:56,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097339906] [2023-09-01 04:45:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097339906] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:56,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466325900] [2023-09-01 04:45:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:56,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:56,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:56,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:45:56,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 04:45:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:57,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 80 conjunts are in the unsatisfiable core [2023-09-01 04:45:57,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:57,356 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 26 treesize of output 14 [2023-09-01 04:45:57,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:57,393 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 15 treesize of output 17 [2023-09-01 04:45:57,501 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-09-01 04:45:57,501 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2023-09-01 04:45:57,599 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 20 treesize of output 19 [2023-09-01 04:45:57,728 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 33 treesize of output 24 [2023-09-01 04:45:57,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:57,774 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 22 treesize of output 22 [2023-09-01 04:45:57,959 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 36 treesize of output 27 [2023-09-01 04:45:58,027 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 27 treesize of output 29 [2023-09-01 04:45:58,194 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-09-01 04:45:58,194 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2023-09-01 04:45:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:58,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:58,822 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1853 Int) (v_ArrVal_1852 Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1848) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1849 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1849) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1852) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1853) .cse1) 2147483647)))) is different from false [2023-09-01 04:45:58,838 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1853 Int) (v_ArrVal_1852 Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1848) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1849) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1852) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1853) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1849 1))))) is different from false [2023-09-01 04:45:58,853 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1853 Int) (v_ArrVal_1852 Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1848) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1849 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1849) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1852) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1853) .cse1) 2147483647)))) is different from false [2023-09-01 04:45:58,884 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1853 Int) (v_ArrVal_1852 Int) (v_ArrVal_1844 Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1844) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1848) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1849) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1852) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1853) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1844) (< (select .cse0 .cse1) (+ v_ArrVal_1849 1))))) is different from false [2023-09-01 04:45:58,906 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1853 Int) (v_ArrVal_1852 Int) (v_ArrVal_1844 Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1844) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1848) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1844) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1849) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1852) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1853) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1849 1))))) is different from false [2023-09-01 04:45:58,930 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1842 Int) (v_ArrVal_1853 Int) (v_ArrVal_1852 Int) (v_ArrVal_1844 Int) (v_ArrVal_1848 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1842)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1844) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1848) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1844) (< (select .cse0 .cse1) (+ v_ArrVal_1849 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1849) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1852) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1853) .cse1) 2147483647)))) is different from false [2023-09-01 04:46:00,163 INFO L321 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2023-09-01 04:46:00,164 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 449 [2023-09-01 04:46:00,252 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-09-01 04:46:00,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 434 treesize of output 418 [2023-09-01 04:46:00,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:00,298 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 267 treesize of output 253 [2023-09-01 04:46:00,333 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 215 treesize of output 191 [2023-09-01 04:46:00,413 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 [2023-09-01 04:46:00,467 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 [2023-09-01 04:46:00,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 04:46:00,510 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 57 treesize of output 45 [2023-09-01 04:46:00,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 04:46:00,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:00,820 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 349 treesize of output 355 [2023-09-01 04:46:01,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:01,129 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 477 treesize of output 437 [2023-09-01 04:46:01,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:01,847 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 242 treesize of output 188 [2023-09-01 04:46:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:46:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466325900] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:46:02,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:46:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 18] total 59 [2023-09-01 04:46:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277351047] [2023-09-01 04:46:02,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:46:02,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-09-01 04:46:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:46:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-09-01 04:46:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2600, Unknown=6, NotChecked=666, Total=3660 [2023-09-01 04:46:02,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 558 [2023-09-01 04:46:02,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 203 transitions, 2547 flow. Second operand has 61 states, 61 states have (on average 181.1639344262295) internal successors, (11051), 61 states have internal predecessors, (11051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:02,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:46:02,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 558 [2023-09-01 04:46:02,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:46:25,316 INFO L130 PetriNetUnfolder]: 8610/16667 cut-off events. [2023-09-01 04:46:25,316 INFO L131 PetriNetUnfolder]: For 57210/57296 co-relation queries the response was YES. [2023-09-01 04:46:25,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64326 conditions, 16667 events. 8610/16667 cut-off events. For 57210/57296 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 112792 event pairs, 2544 based on Foata normal form. 36/16635 useless extension candidates. Maximal degree in co-relation 60692. Up to 3842 conditions per place. [2023-09-01 04:46:25,450 INFO L137 encePairwiseOnDemand]: 530/558 looper letters, 487 selfloop transitions, 164 changer transitions 38/695 dead transitions. [2023-09-01 04:46:25,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 695 transitions, 6603 flow [2023-09-01 04:46:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-09-01 04:46:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-09-01 04:46:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 10697 transitions. [2023-09-01 04:46:25,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3363201911589008 [2023-09-01 04:46:25,458 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 10697 transitions. [2023-09-01 04:46:25,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 10697 transitions. [2023-09-01 04:46:25,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:46:25,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 10697 transitions. [2023-09-01 04:46:25,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 187.66666666666666) internal successors, (10697), 57 states have internal predecessors, (10697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:25,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 558.0) internal successors, (32364), 58 states have internal predecessors, (32364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:25,498 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 558.0) internal successors, (32364), 58 states have internal predecessors, (32364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:25,498 INFO L175 Difference]: Start difference. First operand has 271 places, 203 transitions, 2547 flow. Second operand 57 states and 10697 transitions. [2023-09-01 04:46:25,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 695 transitions, 6603 flow [2023-09-01 04:46:25,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 695 transitions, 6424 flow, removed 4 selfloop flow, removed 12 redundant places. [2023-09-01 04:46:25,786 INFO L231 Difference]: Finished difference. Result has 325 places, 267 transitions, 3383 flow [2023-09-01 04:46:25,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=3383, PETRI_PLACES=325, PETRI_TRANSITIONS=267} [2023-09-01 04:46:25,787 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 249 predicate places. [2023-09-01 04:46:25,787 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 267 transitions, 3383 flow [2023-09-01 04:46:25,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 181.1639344262295) internal successors, (11051), 61 states have internal predecessors, (11051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:25,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:46:25,789 INFO L208 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] [2023-09-01 04:46:25,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 04:46:25,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-09-01 04:46:25,989 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:46:25,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:46:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 400375051, now seen corresponding path program 1 times [2023-09-01 04:46:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:46:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404422387] [2023-09-01 04:46:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:46:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:46:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404422387] [2023-09-01 04:46:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404422387] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:46:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143530215] [2023-09-01 04:46:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:46:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:46:26,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:46:26,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 04:46:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:26,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 52 conjunts are in the unsatisfiable core [2023-09-01 04:46:26,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:46:26,816 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 11 treesize of output 7 [2023-09-01 04:46:26,879 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 21 treesize of output 20 [2023-09-01 04:46:26,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:26,908 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 16 treesize of output 18 [2023-09-01 04:46:27,070 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 30 treesize of output 18 [2023-09-01 04:46:27,118 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 21 treesize of output 20 [2023-09-01 04:46:27,235 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-09-01 04:46:27,236 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 23 treesize of output 26 [2023-09-01 04:46:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:27,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:46:27,758 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1985) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_1987) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1989) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1990) .cse1) 2147483650)) (< (+ v_ArrVal_1990 2147483648) 0) (< (+ v_ArrVal_1987 1) (select .cse0 .cse1))))) is different from false [2023-09-01 04:46:27,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:27,867 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 [2023-09-01 04:46:27,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:27,882 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 104 treesize of output 106 [2023-09-01 04:46:27,889 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 38 treesize of output 34 [2023-09-01 04:46:27,901 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 9 treesize of output 5 [2023-09-01 04:46:27,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:46:27,915 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 53 treesize of output 53 [2023-09-01 04:46:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143530215] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:46:28,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:46:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 33 [2023-09-01 04:46:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383085100] [2023-09-01 04:46:28,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:46:28,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-09-01 04:46:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:46:28,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-09-01 04:46:28,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=951, Unknown=1, NotChecked=64, Total=1190 [2023-09-01 04:46:28,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 558 [2023-09-01 04:46:28,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 267 transitions, 3383 flow. Second operand has 35 states, 35 states have (on average 195.77142857142857) internal successors, (6852), 35 states have internal predecessors, (6852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:28,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:46:28,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 558 [2023-09-01 04:46:28,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:46:32,217 INFO L130 PetriNetUnfolder]: 8842/17091 cut-off events. [2023-09-01 04:46:32,217 INFO L131 PetriNetUnfolder]: For 55861/55951 co-relation queries the response was YES. [2023-09-01 04:46:32,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67531 conditions, 17091 events. 8842/17091 cut-off events. For 55861/55951 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 115620 event pairs, 2561 based on Foata normal form. 60/17107 useless extension candidates. Maximal degree in co-relation 65328. Up to 4128 conditions per place. [2023-09-01 04:46:32,482 INFO L137 encePairwiseOnDemand]: 537/558 looper letters, 272 selfloop transitions, 109 changer transitions 18/405 dead transitions. [2023-09-01 04:46:32,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 405 transitions, 4834 flow [2023-09-01 04:46:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-09-01 04:46:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-09-01 04:46:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4057 transitions. [2023-09-01 04:46:32,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3635304659498208 [2023-09-01 04:46:32,485 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4057 transitions. [2023-09-01 04:46:32,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4057 transitions. [2023-09-01 04:46:32,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:46:32,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4057 transitions. [2023-09-01 04:46:32,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 202.85) internal successors, (4057), 20 states have internal predecessors, (4057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:32,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 558.0) internal successors, (11718), 21 states have internal predecessors, (11718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:32,499 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 558.0) internal successors, (11718), 21 states have internal predecessors, (11718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:32,499 INFO L175 Difference]: Start difference. First operand has 325 places, 267 transitions, 3383 flow. Second operand 20 states and 4057 transitions. [2023-09-01 04:46:32,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 405 transitions, 4834 flow [2023-09-01 04:46:32,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 405 transitions, 4619 flow, removed 33 selfloop flow, removed 17 redundant places. [2023-09-01 04:46:32,918 INFO L231 Difference]: Finished difference. Result has 325 places, 271 transitions, 3415 flow [2023-09-01 04:46:32,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=558, PETRI_DIFFERENCE_MINUEND_FLOW=3121, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3415, PETRI_PLACES=325, PETRI_TRANSITIONS=271} [2023-09-01 04:46:32,919 INFO L281 CegarLoopForPetriNet]: 76 programPoint places, 249 predicate places. [2023-09-01 04:46:32,919 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 271 transitions, 3415 flow [2023-09-01 04:46:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 195.77142857142857) internal successors, (6852), 35 states have internal predecessors, (6852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:46:32,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:46:32,920 INFO L208 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] [2023-09-01 04:46:32,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 04:46:33,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:46:33,121 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2023-09-01 04:46:33,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:46:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash -233317708, now seen corresponding path program 2 times [2023-09-01 04:46:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:46:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030398244] [2023-09-01 04:46:33,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:46:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:46:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:46:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:46:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:46:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030398244] [2023-09-01 04:46:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030398244] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:46:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621867034] [2023-09-01 04:46:34,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:46:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:46:34,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:46:34,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 04:46:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 04:46:35,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 04:46:35,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:46:35,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 113 conjunts are in the unsatisfiable core [2023-09-01 04:46:35,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:46:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:35,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:35,174 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:46:35,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-09-01 04:46:35,190 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:46:35,190 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 20 treesize of output 22 [2023-09-01 04:46:35,312 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 36 treesize of output 29 [2023-09-01 04:46:35,393 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 27 [2023-09-01 04:46:35,553 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 41 treesize of output 34 [2023-09-01 04:46:35,625 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 30 treesize of output 32 [2023-09-01 04:46:35,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:35,713 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 30 treesize of output 32 [2023-09-01 04:46:35,954 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 44 treesize of output 37 [2023-09-01 04:46:36,186 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 40 treesize of output 35 [2023-09-01 04:46:36,497 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 52 treesize of output 45 [2023-09-01 04:46:36,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:46:36,764 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 41 treesize of output 43 [2023-09-01 04:46:37,369 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 55 treesize of output 48 [2023-09-01 04:46:40,550 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 49 treesize of output 44 [2023-09-01 04:47:01,041 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 61 treesize of output 54 [2023-09-01 04:47:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:47:13,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:47:18,855 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2152 Int) (v_ArrVal_2144 Int) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2148 Int) (v_ArrVal_2149 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_2144) (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select .cse0 .cse1) (+ v_ArrVal_2148 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse1) 2147483647)))) is different from false [2023-09-01 04:47:18,878 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2152 Int) (v_ArrVal_2144 Int) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2148 Int) (v_ArrVal_2149 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2144) (< (select .cse0 .cse3) (+ v_ArrVal_2148 1)) (< (select (store (store (store .cse0 .cse3 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse3) 2147483647))))) is different from false [2023-09-01 04:47:18,925 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2152 Int) (v_ArrVal_2144 Int) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2148 Int) (v_ArrVal_2149 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2142) .cse3 v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2148 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2144) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_2142))))) is different from false [2023-09-01 04:47:18,951 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2152 Int) (v_ArrVal_2144 Int) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2148 Int) (v_ArrVal_2149 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2142) .cse3 v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< 2147483647 v_ArrVal_2142) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2148 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2144))))) is different from false [2023-09-01 04:47:18,979 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2140 Int) (v_ArrVal_2142 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2152 Int) (v_ArrVal_2144 Int) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2148 Int) (v_ArrVal_2149 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2140)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2142) .cse1 v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2144) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse3) 2147483647) (< 2147483647 v_ArrVal_2142) (< (select .cse2 .cse3) (+ v_ArrVal_2148 1)) (< (select .cse2 (+ |c_~#queue~0.offset| 1604)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|))))) is different from false [2023-09-01 04:47:21,690 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2140 Int) (v_ArrVal_2142 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2152 Int) (v_ArrVal_2139 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_2144 Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2148 Int) (v_ArrVal_2149 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2138) |c_~#stored_elements~0.base| v_ArrVal_2139))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_2140)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2142) .cse1 v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2144) (< 2147483647 v_ArrVal_2142) (< (select (store (store (store .cse3 .cse4 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse4) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select .cse3 .cse4) (+ v_ArrVal_2148 1)))))))) is different from false [2023-09-01 04:47:22,385 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_2139 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2140 Int) (v_ArrVal_2142 Int) (v_ArrVal_2152 Int) (v_ArrVal_2144 Int) (v_ArrVal_2134 Int) (v_ArrVal_2148 Int) (v_ArrVal_2136 Int) (v_ArrVal_2149 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2134) .cse6 v_ArrVal_2136)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2138) |c_~#stored_elements~0.base| v_ArrVal_2139))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_2140)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_2142) .cse2 v_ArrVal_2144)) |c_~#stored_elements~0.base| v_ArrVal_2146) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2148 1)) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2148) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_2149) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_2152) .cse1) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_2144) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2136) (< 2147483647 v_ArrVal_2142)))))))) is different from false [2023-09-01 04:47:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-09-01 04:47:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621867034] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:47:29,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:47:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 21] total 65 [2023-09-01 04:47:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141646936] [2023-09-01 04:47:29,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:47:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-09-01 04:47:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:47:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-09-01 04:47:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3048, Unknown=98, NotChecked=854, Total=4422 [2023-09-01 04:47:29,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 558 [2023-09-01 04:47:29,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 271 transitions, 3415 flow. Second operand has 67 states, 67 states have (on average 180.97014925373134) internal successors, (12125), 67 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:47:29,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:47:29,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 558 [2023-09-01 04:47:29,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:47:37,449 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] [2023-09-01 04:47:39,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 04:48:05,702 WARN L222 SmtUtils]: Spent 15.51s on a formula simplification. DAG size of input: 142 DAG size of output: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:48:07,949 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] [2023-09-01 04:48:10,182 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] [2023-09-01 04:48:12,751 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] [2023-09-01 04:48:15,193 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] [2023-09-01 04:48:38,098 WARN L222 SmtUtils]: Spent 15.71s on a formula simplification. DAG size of input: 158 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:48:57,051 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, 1] [2023-09-01 04:48:58,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:49:00,838 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] [2023-09-01 04:49:02,845 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, 1] [2023-09-01 04:49:13,634 WARN L222 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 191 DAG size of output: 145 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:49:15,899 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] [2023-09-01 04:49:18,101 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] [2023-09-01 04:49:20,107 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, 1] [2023-09-01 04:49:22,136 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] [2023-09-01 04:49:24,144 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, 1] [2023-09-01 04:49:27,037 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] [2023-09-01 04:49:29,048 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, 1] [2023-09-01 04:49:31,055 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, 1] [2023-09-01 04:49:33,063 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, 1] [2023-09-01 04:49:35,070 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, 1] [2023-09-01 04:49:37,079 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, 1] [2023-09-01 04:49:39,094 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] [2023-09-01 04:49:41,102 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, 1] [2023-09-01 04:49:43,107 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] [2023-09-01 04:49:45,114 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, 1] [2023-09-01 04:49:47,120 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, 1] [2023-09-01 04:49:49,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, 1] [2023-09-01 04:49:51,544 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] [2023-09-01 04:49:53,969 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] [2023-09-01 04:49:55,975 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, 1] [2023-09-01 04:49:57,982 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, 1] [2023-09-01 04:49:59,988 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, 1] [2023-09-01 04:50:01,996 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, 1] [2023-09-01 04:50:04,005 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, 1] [2023-09-01 04:50:07,404 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] [2023-09-01 04:50:10,048 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] [2023-09-01 04:50:12,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, 1] [2023-09-01 04:50:28,550 WARN L222 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 189 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:50:43,513 WARN L222 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 108 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:50:50,340 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] [2023-09-01 04:50:52,461 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] [2023-09-01 04:50:54,502 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] [2023-09-01 04:50:56,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, 1] [2023-09-01 04:50:58,605 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, 1] [2023-09-01 04:51:00,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, 1] [2023-09-01 04:51:02,814 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] [2023-09-01 04:51:04,822 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, 1] [2023-09-01 04:51:06,877 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] [2023-09-01 04:51:08,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, 1] [2023-09-01 04:51:10,912 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, 1] [2023-09-01 04:51:12,920 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, 1] [2023-09-01 04:51:15,206 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] [2023-09-01 04:51:17,212 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, 1] [2023-09-01 04:51:19,217 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] [2023-09-01 04:51:21,351 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, 1] [2023-09-01 04:51:23,357 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, 1] [2023-09-01 04:51:25,363 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] [2023-09-01 04:51:33,847 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] [2023-09-01 04:51:35,854 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, 1] [2023-09-01 04:51:39,257 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] [2023-09-01 04:51:41,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:51:43,453 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] [2023-09-01 04:51:45,460 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, 1] [2023-09-01 04:51:48,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, 1] [2023-09-01 04:51:50,558 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, 1] [2023-09-01 04:51:53,461 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] [2023-09-01 04:51:55,467 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, 1] [2023-09-01 04:51:57,561 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] [2023-09-01 04:51:59,571 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, 1] [2023-09-01 04:52:01,585 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, 1] [2023-09-01 04:52:03,595 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, 1] [2023-09-01 04:52:05,606 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, 1] [2023-09-01 04:52:07,612 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, 1] [2023-09-01 04:52:19,548 WARN L222 SmtUtils]: Spent 9.33s on a formula simplification. DAG size of input: 110 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:52:23,281 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] [2023-09-01 04:52:25,287 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] [2023-09-01 04:52:27,762 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] [2023-09-01 04:52:30,390 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] [2023-09-01 04:52:32,396 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] [2023-09-01 04:52:35,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:37,381 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] [2023-09-01 04:52:39,390 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, 1] [2023-09-01 04:52:43,360 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] [2023-09-01 04:52:45,367 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, 1] [2023-09-01 04:52:49,651 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] [2023-09-01 04:52:51,657 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, 1] [2023-09-01 04:52:54,432 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] [2023-09-01 04:52:56,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:59,158 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] [2023-09-01 04:53:01,163 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] [2023-09-01 04:53:03,275 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] [2023-09-01 04:53:12,166 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] [2023-09-01 04:53:14,266 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] [2023-09-01 04:53:16,819 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] [2023-09-01 04:53:18,934 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] [2023-09-01 04:53:20,941 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] [2023-09-01 04:53:38,539 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] [2023-09-01 04:53:40,960 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] [2023-09-01 04:53:43,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, 1] [2023-09-01 04:53:45,422 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] [2023-09-01 04:53:47,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] [2023-09-01 04:54:16,407 WARN L222 SmtUtils]: Spent 10.58s on a formula simplification. DAG size of input: 189 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:54:18,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:20,856 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] [2023-09-01 04:54:22,862 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, 1] [2023-09-01 04:54:37,753 WARN L222 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 151 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:54:39,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:54:41,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, 1] [2023-09-01 04:54:43,740 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] [2023-09-01 04:55:01,073 WARN L222 SmtUtils]: Spent 14.10s on a formula simplification. DAG size of input: 232 DAG size of output: 133 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:55:03,307 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] [2023-09-01 04:55:05,320 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] [2023-09-01 04:55:07,328 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, 1] [2023-09-01 04:55:09,335 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, 1] [2023-09-01 04:55:11,360 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] [2023-09-01 04:55:13,367 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, 1] [2023-09-01 04:55:15,380 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] [2023-09-01 04:55:17,389 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, 1] [2023-09-01 04:55:19,397 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, 1] [2023-09-01 04:55:21,406 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, 1] [2023-09-01 04:55:23,413 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, 1] [2023-09-01 04:55:25,421 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, 1] [2023-09-01 04:55:27,428 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, 1] [2023-09-01 04:55:29,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15