./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok_longest.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_ok_longest.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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --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:24,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 04:42:24,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 04:42:24,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 04:42:24,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 04:42:24,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 04:42:24,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 04:42:24,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 04:42:24,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 04:42:24,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 04:42:24,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 04:42:24,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 04:42:24,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 04:42:24,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 04:42:24,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 04:42:24,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 04:42:24,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 04:42:24,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 04:42:24,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 04:42:24,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 04:42:24,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 04:42:24,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 04:42:24,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 04:42:24,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 04:42:24,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 04:42:24,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 04:42:24,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 04:42:24,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 04:42:24,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 04:42:24,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 04:42:24,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 04:42:24,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 04:42:24,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 04:42:24,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 04:42:24,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 04:42:24,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 04:42:24,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 04:42:24,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 04:42:24,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 04:42:24,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 04:42:24,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 04:42:24,102 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:24,134 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 04:42:24,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 04:42:24,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 04:42:24,136 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 04:42:24,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 04:42:24,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 04:42:24,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 04:42:24,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 04:42:24,138 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 04:42:24,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 04:42:24,139 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 04:42:24,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 04:42:24,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 04:42:24,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 04:42:24,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 04:42:24,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 04:42:24,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 04:42:24,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 04:42:24,140 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-09-01 04:42:24,140 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 04:42:24,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 04:42:24,141 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 04:42:24,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 04:42:24,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 04:42:24,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 04:42:24,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 04:42:24,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:24,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 04:42:24,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 04:42:24,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 04:42:24,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 04:42:24,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 04:42:24,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 04:42:24,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 04:42:24,143 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 04:42:24,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 04:42:24,144 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 04:42:24,144 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d 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:24,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 04:42:24,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 04:42:24,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 04:42:24,478 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 04:42:24,480 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 04:42:24,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-09-01 04:42:25,582 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 04:42:25,860 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 04:42:25,860 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-09-01 04:42:25,886 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e5cee07/f346b72bd3484e049c874cdd8be76a6d/FLAG4479e6d73 [2023-09-01 04:42:25,911 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e5cee07/f346b72bd3484e049c874cdd8be76a6d [2023-09-01 04:42:25,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 04:42:25,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 04:42:25,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:25,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 04:42:25,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 04:42:25,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:25" (1/1) ... [2023-09-01 04:42:25,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbd06ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:25, skipping insertion in model container [2023-09-01 04:42:25,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 04:42:25" (1/1) ... [2023-09-01 04:42:25,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 04:42:25,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 04:42:26,307 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_ok_longest.i[43280,43293] [2023-09-01 04:42:26,312 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_ok_longest.i[43553,43566] [2023-09-01 04:42:26,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:26,324 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 04:42:26,373 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_ok_longest.i[43280,43293] [2023-09-01 04:42:26,375 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_ok_longest.i[43553,43566] [2023-09-01 04:42:26,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 04:42:26,467 INFO L208 MainTranslator]: Completed translation [2023-09-01 04:42:26,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26 WrapperNode [2023-09-01 04:42:26,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 04:42:26,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:26,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 04:42:26,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 04:42:26,474 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:26" (1/1) ... [2023-09-01 04:42:26,506 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:26" (1/1) ... [2023-09-01 04:42:26,542 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2023-09-01 04:42:26,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 04:42:26,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 04:42:26,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 04:42:26,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 04:42:26,552 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:26" (1/1) ... [2023-09-01 04:42:26,554 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:26" (1/1) ... [2023-09-01 04:42:26,571 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:26" (1/1) ... [2023-09-01 04:42:26,575 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:26" (1/1) ... [2023-09-01 04:42:26,583 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:26" (1/1) ... [2023-09-01 04:42:26,599 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:26" (1/1) ... [2023-09-01 04:42:26,601 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:26" (1/1) ... [2023-09-01 04:42:26,602 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:26" (1/1) ... [2023-09-01 04:42:26,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 04:42:26,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 04:42:26,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 04:42:26,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 04:42:26,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (1/1) ... [2023-09-01 04:42:26,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 04:42:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:26,673 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:26,689 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:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-09-01 04:42:26,700 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-09-01 04:42:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-09-01 04:42:26,700 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-09-01 04:42:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 04:42:26,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 04:42:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 04:42:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 04:42:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 04:42:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 04:42:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 04:42:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 04:42:26,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 04:42:26,703 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:26,881 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 04:42:26,883 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 04:42:27,160 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 04:42:27,169 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 04:42:27,169 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-01 04:42:27,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:27 BoogieIcfgContainer [2023-09-01 04:42:27,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 04:42:27,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 04:42:27,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 04:42:27,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 04:42:27,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 04:42:25" (1/3) ... [2023-09-01 04:42:27,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee3bbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:27, skipping insertion in model container [2023-09-01 04:42:27,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 04:42:26" (2/3) ... [2023-09-01 04:42:27,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee3bbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 04:42:27, skipping insertion in model container [2023-09-01 04:42:27,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 04:42:27" (3/3) ... [2023-09-01 04:42:27,179 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-09-01 04:42:27,185 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 04:42:27,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 04:42:27,193 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-09-01 04:42:27,193 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 04:42:27,271 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 04:42:27,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 238 transitions, 492 flow [2023-09-01 04:42:27,419 INFO L130 PetriNetUnfolder]: 13/236 cut-off events. [2023-09-01 04:42:27,419 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 04:42:27,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 236 events. 13/236 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-09-01 04:42:27,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 238 transitions, 492 flow [2023-09-01 04:42:27,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,440 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 04:42:27,458 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,465 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 463 flow [2023-09-01 04:42:27,524 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2023-09-01 04:42:27,525 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:27,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 227 events. 13/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 164. Up to 3 conditions per place. [2023-09-01 04:42:27,536 INFO L119 LiptonReduction]: Number of co-enabled transitions 13612 [2023-09-01 04:42:35,361 INFO L134 LiptonReduction]: Checked pairs total: 27777 [2023-09-01 04:42:35,361 INFO L136 LiptonReduction]: Total number of compositions: 211 [2023-09-01 04:42:35,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 04:42:35,379 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;@5c3fc171, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 04:42:35,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-09-01 04:42:35,388 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2023-09-01 04:42:35,390 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 04:42:35,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:35,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:35,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:35,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1508825301, now seen corresponding path program 1 times [2023-09-01 04:42:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279935498] [2023-09-01 04:42:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:36,740 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,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279935498] [2023-09-01 04:42:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279935498] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:36,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10161177] [2023-09-01 04:42:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:36,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 04:42:36,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:36,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 04:42:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 04:42:37,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-09-01 04:42:37,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 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,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:37,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-09-01 04:42:37,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:37,887 INFO L130 PetriNetUnfolder]: 1447/2384 cut-off events. [2023-09-01 04:42:37,888 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-09-01 04:42:37,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2384 events. 1447/2384 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11890 event pairs, 1050 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 4563. Up to 2313 conditions per place. [2023-09-01 04:42:37,901 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-09-01 04:42:37,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 271 flow [2023-09-01 04:42:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1336 transitions. [2023-09-01 04:42:37,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495916852264291 [2023-09-01 04:42:37,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1336 transitions. [2023-09-01 04:42:37,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1336 transitions. [2023-09-01 04:42:37,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:37,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1336 transitions. [2023-09-01 04:42:37,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 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,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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,939 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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,940 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 6 states and 1336 transitions. [2023-09-01 04:42:37,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 271 flow [2023-09-01 04:42:37,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:37,946 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 178 flow [2023-09-01 04:42:37,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-09-01 04:42:37,950 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-09-01 04:42:37,950 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 178 flow [2023-09-01 04:42:37,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.4) internal successors, (1067), 5 states have internal predecessors, (1067), 0 states have call successors, (0), 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,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:37,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 04:42:37,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:37,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -471342727, now seen corresponding path program 1 times [2023-09-01 04:42:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:37,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188551895] [2023-09-01 04:42:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:38,775 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:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188551895] [2023-09-01 04:42:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188551895] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88510534] [2023-09-01 04:42:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:38,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:39,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:39,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:39,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:39,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:39,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:40,159 INFO L130 PetriNetUnfolder]: 1909/3185 cut-off events. [2023-09-01 04:42:40,160 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2023-09-01 04:42:40,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 3185 events. 1909/3185 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17548 event pairs, 356 based on Foata normal form. 0/2452 useless extension candidates. Maximal degree in co-relation 4972. Up to 2371 conditions per place. [2023-09-01 04:42:40,177 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2023-09-01 04:42:40,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 629 flow [2023-09-01 04:42:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-09-01 04:42:40,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155902004454342 [2023-09-01 04:42:40,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-09-01 04:42:40,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-09-01 04:42:40,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:40,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-09-01 04:42:40,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 0 states have call successors, (0), 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:40,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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:40,191 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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:40,191 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 178 flow. Second operand 6 states and 1389 transitions. [2023-09-01 04:42:40,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 629 flow [2023-09-01 04:42:40,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:40,200 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 272 flow [2023-09-01 04:42:40,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-09-01 04:42:40,201 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-09-01 04:42:40,201 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 272 flow [2023-09-01 04:42:40,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:40,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:40,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:40,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 04:42:40,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:40,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -470766127, now seen corresponding path program 2 times [2023-09-01 04:42:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352926560] [2023-09-01 04:42:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:40,650 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,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352926560] [2023-09-01 04:42:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352926560] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:40,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541759098] [2023-09-01 04:42:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:40,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:40,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:40,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-09-01 04:42:40,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 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:40,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:40,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-09-01 04:42:40,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:41,345 INFO L130 PetriNetUnfolder]: 2048/3425 cut-off events. [2023-09-01 04:42:41,346 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2023-09-01 04:42:41,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 3425 events. 2048/3425 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19054 event pairs, 410 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 6211. Up to 2404 conditions per place. [2023-09-01 04:42:41,367 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 109 selfloop transitions, 19 changer transitions 0/135 dead transitions. [2023-09-01 04:42:41,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 678 flow [2023-09-01 04:42:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 04:42:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 04:42:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-09-01 04:42:41,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198218262806236 [2023-09-01 04:42:41,371 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-09-01 04:42:41,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-09-01 04:42:41,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:41,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-09-01 04:42:41,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 0 states have call successors, (0), 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,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 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,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 449.0) internal successors, (2694), 6 states have internal predecessors, (2694), 0 states have call successors, (0), 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,380 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 272 flow. Second operand 5 states and 1167 transitions. [2023-09-01 04:42:41,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 678 flow [2023-09-01 04:42:41,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 658 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:41,391 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 344 flow [2023-09-01 04:42:41,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2023-09-01 04:42:41,393 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2023-09-01 04:42:41,393 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 344 flow [2023-09-01 04:42:41,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 0 states have call successors, (0), 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,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:41,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:41,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 04:42:41,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:41,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1218367487, now seen corresponding path program 1 times [2023-09-01 04:42:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785334641] [2023-09-01 04:42:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:41,453 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:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785334641] [2023-09-01 04:42:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785334641] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:41,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:42:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347771584] [2023-09-01 04:42:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:41,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 04:42:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:41,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 04:42:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 04:42:41,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 449 [2023-09-01 04:42:41,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 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,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:41,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 449 [2023-09-01 04:42:41,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:42,023 INFO L130 PetriNetUnfolder]: 3360/5521 cut-off events. [2023-09-01 04:42:42,023 INFO L131 PetriNetUnfolder]: For 2431/2471 co-relation queries the response was YES. [2023-09-01 04:42:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13038 conditions, 5521 events. 3360/5521 cut-off events. For 2431/2471 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33384 event pairs, 1505 based on Foata normal form. 40/4211 useless extension candidates. Maximal degree in co-relation 10283. Up to 3250 conditions per place. [2023-09-01 04:42:42,060 INFO L137 encePairwiseOnDemand]: 442/449 looper letters, 149 selfloop transitions, 4 changer transitions 0/163 dead transitions. [2023-09-01 04:42:42,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 163 transitions, 970 flow [2023-09-01 04:42:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 04:42:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 04:42:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-09-01 04:42:42,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517817371937639 [2023-09-01 04:42:42,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-09-01 04:42:42,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-09-01 04:42:42,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:42,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-09-01 04:42:42,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:42:42,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 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:42,076 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 449.0) internal successors, (2245), 5 states have internal predecessors, (2245), 0 states have call successors, (0), 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:42,076 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 344 flow. Second operand 4 states and 991 transitions. [2023-09-01 04:42:42,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 163 transitions, 970 flow [2023-09-01 04:42:42,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 163 transitions, 940 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-09-01 04:42:42,086 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 366 flow [2023-09-01 04:42:42,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2023-09-01 04:42:42,088 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-09-01 04:42:42,088 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 366 flow [2023-09-01 04:42:42,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 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:42,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:42,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 04:42:42,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:42,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1711980127, now seen corresponding path program 1 times [2023-09-01 04:42:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768524690] [2023-09-01 04:42:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:42,680 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:42,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:42,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768524690] [2023-09-01 04:42:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768524690] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:42,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 04:42:42,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92387980] [2023-09-01 04:42:42,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:42,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 04:42:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 04:42:42,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 04:42:43,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 449 [2023-09-01 04:42:43,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 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,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:43,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 449 [2023-09-01 04:42:43,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:44,028 INFO L130 PetriNetUnfolder]: 3845/6364 cut-off events. [2023-09-01 04:42:44,029 INFO L131 PetriNetUnfolder]: For 2574/2584 co-relation queries the response was YES. [2023-09-01 04:42:44,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 6364 events. 3845/6364 cut-off events. For 2574/2584 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 38002 event pairs, 2036 based on Foata normal form. 0/5037 useless extension candidates. Maximal degree in co-relation 9951. Up to 5400 conditions per place. [2023-09-01 04:42:44,072 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 99 selfloop transitions, 19 changer transitions 0/125 dead transitions. [2023-09-01 04:42:44,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 718 flow [2023-09-01 04:42:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 04:42:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 04:42:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1582 transitions. [2023-09-01 04:42:44,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033407572383074 [2023-09-01 04:42:44,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1582 transitions. [2023-09-01 04:42:44,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1582 transitions. [2023-09-01 04:42:44,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:44,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1582 transitions. [2023-09-01 04:42:44,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 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,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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,088 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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,088 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 366 flow. Second operand 7 states and 1582 transitions. [2023-09-01 04:42:44,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 718 flow [2023-09-01 04:42:44,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:42:44,098 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 465 flow [2023-09-01 04:42:44,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2023-09-01 04:42:44,101 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2023-09-01 04:42:44,101 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 465 flow [2023-09-01 04:42:44,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 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,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:44,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:44,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 04:42:44,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:44,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1521891715, now seen corresponding path program 1 times [2023-09-01 04:42:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:44,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288823172] [2023-09-01 04:42:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:44,988 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,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288823172] [2023-09-01 04:42:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288823172] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:44,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 04:42:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122984050] [2023-09-01 04:42:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:44,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:42:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:44,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:42:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:42:45,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:45,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 465 flow. Second operand has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:45,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:45,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:47,130 INFO L130 PetriNetUnfolder]: 5335/8653 cut-off events. [2023-09-01 04:42:47,130 INFO L131 PetriNetUnfolder]: For 3350/3382 co-relation queries the response was YES. [2023-09-01 04:42:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22979 conditions, 8653 events. 5335/8653 cut-off events. For 3350/3382 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 53337 event pairs, 1036 based on Foata normal form. 195/7266 useless extension candidates. Maximal degree in co-relation 20634. Up to 5366 conditions per place. [2023-09-01 04:42:47,291 INFO L137 encePairwiseOnDemand]: 435/449 looper letters, 184 selfloop transitions, 27 changer transitions 0/218 dead transitions. [2023-09-01 04:42:47,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 218 transitions, 1296 flow [2023-09-01 04:42:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 04:42:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 04:42:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1643 transitions. [2023-09-01 04:42:47,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227489659560929 [2023-09-01 04:42:47,296 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1643 transitions. [2023-09-01 04:42:47,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1643 transitions. [2023-09-01 04:42:47,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:47,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1643 transitions. [2023-09-01 04:42:47,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 234.71428571428572) internal successors, (1643), 7 states have internal predecessors, (1643), 0 states have call successors, (0), 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,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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,306 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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,306 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 465 flow. Second operand 7 states and 1643 transitions. [2023-09-01 04:42:47,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 218 transitions, 1296 flow [2023-09-01 04:42:47,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 218 transitions, 1281 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:47,336 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 603 flow [2023-09-01 04:42:47,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2023-09-01 04:42:47,340 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-09-01 04:42:47,341 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 603 flow [2023-09-01 04:42:47,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:47,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:47,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 04:42:47,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:47,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1524270299, now seen corresponding path program 2 times [2023-09-01 04:42:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687399890] [2023-09-01 04:42:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:48,037 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,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687399890] [2023-09-01 04:42:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687399890] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 04:42:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869417437] [2023-09-01 04:42:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:48,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:42:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:42:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:42:48,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 449 [2023-09-01 04:42:48,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 0 states have call successors, (0), 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,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:48,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 449 [2023-09-01 04:42:48,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:49,681 INFO L130 PetriNetUnfolder]: 5577/9060 cut-off events. [2023-09-01 04:42:49,681 INFO L131 PetriNetUnfolder]: For 7400/7418 co-relation queries the response was YES. [2023-09-01 04:42:49,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26065 conditions, 9060 events. 5577/9060 cut-off events. For 7400/7418 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 56308 event pairs, 1904 based on Foata normal form. 141/7581 useless extension candidates. Maximal degree in co-relation 18924. Up to 6711 conditions per place. [2023-09-01 04:42:49,738 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 153 selfloop transitions, 23 changer transitions 0/183 dead transitions. [2023-09-01 04:42:49,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 183 transitions, 1204 flow [2023-09-01 04:42:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:42:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:42:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2023-09-01 04:42:49,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189309576837416 [2023-09-01 04:42:49,744 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1398 transitions. [2023-09-01 04:42:49,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1398 transitions. [2023-09-01 04:42:49,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:49,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1398 transitions. [2023-09-01 04:42:49,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 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,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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,752 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 603 flow. Second operand 6 states and 1398 transitions. [2023-09-01 04:42:49,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 183 transitions, 1204 flow [2023-09-01 04:42:49,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 183 transitions, 1165 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-09-01 04:42:49,803 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 648 flow [2023-09-01 04:42:49,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=648, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2023-09-01 04:42:49,804 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2023-09-01 04:42:49,804 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 648 flow [2023-09-01 04:42:49,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 0 states have call successors, (0), 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,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:49,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:49,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 04:42:49,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:49,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1531774647, now seen corresponding path program 3 times [2023-09-01 04:42:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:49,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325122749] [2023-09-01 04:42:49,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:50,382 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,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325122749] [2023-09-01 04:42:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325122749] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 04:42:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545911837] [2023-09-01 04:42:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:50,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:42:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:50,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:42:50,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:42:50,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 449 [2023-09-01 04:42:50,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 648 flow. Second operand has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:50,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 449 [2023-09-01 04:42:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:51,987 INFO L130 PetriNetUnfolder]: 6471/10435 cut-off events. [2023-09-01 04:42:51,987 INFO L131 PetriNetUnfolder]: For 10856/10894 co-relation queries the response was YES. [2023-09-01 04:42:52,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31089 conditions, 10435 events. 6471/10435 cut-off events. For 10856/10894 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 63561 event pairs, 1216 based on Foata normal form. 141/8570 useless extension candidates. Maximal degree in co-relation 23328. Up to 6497 conditions per place. [2023-09-01 04:42:52,077 INFO L137 encePairwiseOnDemand]: 434/449 looper letters, 177 selfloop transitions, 38 changer transitions 0/222 dead transitions. [2023-09-01 04:42:52,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 222 transitions, 1493 flow [2023-09-01 04:42:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 04:42:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 04:42:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1631 transitions. [2023-09-01 04:42:52,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189309576837416 [2023-09-01 04:42:52,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1631 transitions. [2023-09-01 04:42:52,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1631 transitions. [2023-09-01 04:42:52,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:52,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1631 transitions. [2023-09-01 04:42:52,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 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:52,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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:52,093 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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:52,094 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 648 flow. Second operand 7 states and 1631 transitions. [2023-09-01 04:42:52,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 222 transitions, 1493 flow [2023-09-01 04:42:52,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 222 transitions, 1453 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:52,183 INFO L231 Difference]: Finished difference. Result has 102 places, 116 transitions, 873 flow [2023-09-01 04:42:52,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=873, PETRI_PLACES=102, PETRI_TRANSITIONS=116} [2023-09-01 04:42:52,185 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-09-01 04:42:52,185 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 116 transitions, 873 flow [2023-09-01 04:42:52,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.57142857142858) internal successors, (1474), 7 states have internal predecessors, (1474), 0 states have call successors, (0), 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:52,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:52,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:52,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 04:42:52,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:52,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1674976288, now seen corresponding path program 1 times [2023-09-01 04:42:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74719487] [2023-09-01 04:42:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:52,293 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,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:52,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74719487] [2023-09-01 04:42:52,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74719487] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458626504] [2023-09-01 04:42:52,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:52,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:52,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:42:52,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 116 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 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:52,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:52,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:42:52,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:52,489 INFO L130 PetriNetUnfolder]: 823/1615 cut-off events. [2023-09-01 04:42:52,489 INFO L131 PetriNetUnfolder]: For 1531/1531 co-relation queries the response was YES. [2023-09-01 04:42:52,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1615 events. 823/1615 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9227 event pairs, 501 based on Foata normal form. 82/1510 useless extension candidates. Maximal degree in co-relation 3437. Up to 761 conditions per place. [2023-09-01 04:42:52,494 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 87 selfloop transitions, 2 changer transitions 6/104 dead transitions. [2023-09-01 04:42:52,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 104 transitions, 850 flow [2023-09-01 04:42:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2023-09-01 04:42:52,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382331106161841 [2023-09-01 04:42:52,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2023-09-01 04:42:52,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2023-09-01 04:42:52,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:52,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2023-09-01 04:42:52,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 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:52,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:52,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:52,503 INFO L175 Difference]: Start difference. First operand has 102 places, 116 transitions, 873 flow. Second operand 3 states and 725 transitions. [2023-09-01 04:42:52,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 104 transitions, 850 flow [2023-09-01 04:42:52,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 811 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-09-01 04:42:52,511 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 597 flow [2023-09-01 04:42:52,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2023-09-01 04:42:52,513 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-09-01 04:42:52,513 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 597 flow [2023-09-01 04:42:52,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 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:52,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:52,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:52,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 04:42:52,515 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:52,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 902890166, now seen corresponding path program 1 times [2023-09-01 04:42:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014190176] [2023-09-01 04:42:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:52,551 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,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:52,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014190176] [2023-09-01 04:42:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014190176] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:42:52,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:42:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:42:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229718824] [2023-09-01 04:42:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:42:52,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:42:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:42:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:42:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:42:52,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-09-01 04:42:52,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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:52,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:42:52,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-09-01 04:42:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:42:52,718 INFO L130 PetriNetUnfolder]: 624/1238 cut-off events. [2023-09-01 04:42:52,719 INFO L131 PetriNetUnfolder]: For 1141/1141 co-relation queries the response was YES. [2023-09-01 04:42:52,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1238 events. 624/1238 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6313 event pairs, 434 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 2950. Up to 879 conditions per place. [2023-09-01 04:42:52,724 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 85 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-09-01 04:42:52,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 99 transitions, 784 flow [2023-09-01 04:42:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:42:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:42:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2023-09-01 04:42:52,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434298440979956 [2023-09-01 04:42:52,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 732 transitions. [2023-09-01 04:42:52,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 732 transitions. [2023-09-01 04:42:52,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:42:52,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 732 transitions. [2023-09-01 04:42:52,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 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:52,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:52,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:52,730 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 597 flow. Second operand 3 states and 732 transitions. [2023-09-01 04:42:52,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 99 transitions, 784 flow [2023-09-01 04:42:52,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 774 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 04:42:52,738 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 601 flow [2023-09-01 04:42:52,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-09-01 04:42:52,740 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2023-09-01 04:42:52,740 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 601 flow [2023-09-01 04:42:52,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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:52,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:42:52,741 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:42:52,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 04:42:52,741 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:42:52,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:42:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1852895279, now seen corresponding path program 1 times [2023-09-01 04:42:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:42:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383520231] [2023-09-01 04:42:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:42:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:53,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:42:53,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383520231] [2023-09-01 04:42:53,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383520231] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:42:53,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420223504] [2023-09-01 04:42:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:42:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:42:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:42:53,140 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:53,142 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:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:42:53,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2023-09-01 04:42:53,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:42:53,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:53,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:53,406 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:42:53,407 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:42:53,419 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-01 04:42:53,419 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 11 treesize of output 11 [2023-09-01 04:42:53,549 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:42:53,688 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:42:53,860 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:42:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:42:53,923 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 33 treesize of output 35 [2023-09-01 04:42:54,035 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 47 treesize of output 40 [2023-09-01 04:42:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:42:54,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:42:56,458 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_408 Int) (v_ArrVal_406 Int) (v_ArrVal_410 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_406) .cse1 v_ArrVal_408)) |c_~#stored_elements~0.base| v_ArrVal_410) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_408) (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) (< v_ArrVal_406 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< 0 (+ 2147483650 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_~#queue~0.offset|) v_ArrVal_411) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2023-09-01 04:43:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420223504] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:01,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-09-01 04:43:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502576358] [2023-09-01 04:43:01,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:01,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 04:43:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 04:43:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=593, Unknown=41, NotChecked=54, Total=870 [2023-09-01 04:43:01,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 449 [2023-09-01 04:43:01,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 601 flow. Second operand has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 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,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:01,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 449 [2023-09-01 04:43:01,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:20,645 INFO L130 PetriNetUnfolder]: 1765/3484 cut-off events. [2023-09-01 04:43:20,645 INFO L131 PetriNetUnfolder]: For 2061/2061 co-relation queries the response was YES. [2023-09-01 04:43:20,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9225 conditions, 3484 events. 1765/3484 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22102 event pairs, 714 based on Foata normal form. 10/3119 useless extension candidates. Maximal degree in co-relation 7099. Up to 866 conditions per place. [2023-09-01 04:43:20,665 INFO L137 encePairwiseOnDemand]: 425/449 looper letters, 222 selfloop transitions, 96 changer transitions 4/328 dead transitions. [2023-09-01 04:43:20,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 328 transitions, 2147 flow [2023-09-01 04:43:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-01 04:43:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-09-01 04:43:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6074 transitions. [2023-09-01 04:43:20,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978776365780165 [2023-09-01 04:43:20,681 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 6074 transitions. [2023-09-01 04:43:20,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 6074 transitions. [2023-09-01 04:43:20,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:20,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 6074 transitions. [2023-09-01 04:43:20,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 178.64705882352942) internal successors, (6074), 34 states have internal predecessors, (6074), 0 states have call successors, (0), 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:20,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 449.0) internal successors, (15715), 35 states have internal predecessors, (15715), 0 states have call successors, (0), 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:20,713 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 449.0) internal successors, (15715), 35 states have internal predecessors, (15715), 0 states have call successors, (0), 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:20,714 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 601 flow. Second operand 34 states and 6074 transitions. [2023-09-01 04:43:20,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 328 transitions, 2147 flow [2023-09-01 04:43:20,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 328 transitions, 2136 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 04:43:20,731 INFO L231 Difference]: Finished difference. Result has 148 places, 164 transitions, 1252 flow [2023-09-01 04:43:20,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1252, PETRI_PLACES=148, PETRI_TRANSITIONS=164} [2023-09-01 04:43:20,732 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 91 predicate places. [2023-09-01 04:43:20,732 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 164 transitions, 1252 flow [2023-09-01 04:43:20,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 171.5) internal successors, (5145), 30 states have internal predecessors, (5145), 0 states have call successors, (0), 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:20,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:20,734 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:20,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-09-01 04:43:20,941 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,SelfDestructingSolverStorable10 [2023-09-01 04:43:20,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:43:20,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1450758440, now seen corresponding path program 1 times [2023-09-01 04:43:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133826557] [2023-09-01 04:43:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133826557] [2023-09-01 04:43:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133826557] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:43:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448612009] [2023-09-01 04:43:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:21,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:43:21,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:43:21,853 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:43:21,854 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:43:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:21,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-09-01 04:43:21,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:43:22,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:22,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:22,025 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:43:22,025 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:43:22,044 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:43:22,044 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:43:22,154 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:43:22,266 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:43:22,348 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:43:22,502 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:43:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:22,568 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 33 treesize of output 35 [2023-09-01 04:43:22,698 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 47 treesize of output 40 [2023-09-01 04:43:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:22,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:43:22,971 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_511) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|)))) is different from false [2023-09-01 04:43:22,987 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511))))) is different from false [2023-09-01 04:43:23,026 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511)))))) is different from false [2023-09-01 04:43:23,055 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_508) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511)))))) is different from false [2023-09-01 04:43:23,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511) (< (+ (select .cse3 .cse4) 1) v_ArrVal_508))))))) is different from false [2023-09-01 04:43:23,120 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (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_507)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_511) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_508) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|))))))) is different from false [2023-09-01 04:43:23,153 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 Int) (v_ArrVal_513 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41| Int) (v_ArrVal_508 Int) (v_ArrVal_507 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_514 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) |c_~#queue~0.offset|) v_ArrVal_507)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_510))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_511)) |c_~#stored_elements~0.base| v_ArrVal_513) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) (< (+ (select .cse2 .cse1) 1) v_ArrVal_511) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_41|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_508) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_514) .cse5) 2147483647)))))))) is different from false [2023-09-01 04:43:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-09-01 04:43:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448612009] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:23,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:23,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-09-01 04:43:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126184054] [2023-09-01 04:43:23,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-01 04:43:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-01 04:43:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=590, Unknown=11, NotChecked=420, Total=1260 [2023-09-01 04:43:23,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:43:23,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 164 transitions, 1252 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:23,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:43:23,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:25,889 INFO L130 PetriNetUnfolder]: 2218/4322 cut-off events. [2023-09-01 04:43:25,889 INFO L131 PetriNetUnfolder]: For 4908/4956 co-relation queries the response was YES. [2023-09-01 04:43:25,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13795 conditions, 4322 events. 2218/4322 cut-off events. For 4908/4956 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 28576 event pairs, 931 based on Foata normal form. 1/3903 useless extension candidates. Maximal degree in co-relation 13291. Up to 2791 conditions per place. [2023-09-01 04:43:25,928 INFO L137 encePairwiseOnDemand]: 433/449 looper letters, 182 selfloop transitions, 74 changer transitions 3/265 dead transitions. [2023-09-01 04:43:25,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 265 transitions, 2247 flow [2023-09-01 04:43:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-09-01 04:43:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-09-01 04:43:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2997 transitions. [2023-09-01 04:43:25,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39263723306694615 [2023-09-01 04:43:25,936 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2997 transitions. [2023-09-01 04:43:25,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2997 transitions. [2023-09-01 04:43:25,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:25,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2997 transitions. [2023-09-01 04:43:25,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.2941176470588) internal successors, (2997), 17 states have internal predecessors, (2997), 0 states have call successors, (0), 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,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 449.0) internal successors, (8082), 18 states have internal predecessors, (8082), 0 states have call successors, (0), 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,953 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 449.0) internal successors, (8082), 18 states have internal predecessors, (8082), 0 states have call successors, (0), 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,953 INFO L175 Difference]: Start difference. First operand has 148 places, 164 transitions, 1252 flow. Second operand 17 states and 2997 transitions. [2023-09-01 04:43:25,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 265 transitions, 2247 flow [2023-09-01 04:43:25,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 265 transitions, 2094 flow, removed 58 selfloop flow, removed 11 redundant places. [2023-09-01 04:43:25,992 INFO L231 Difference]: Finished difference. Result has 161 places, 197 transitions, 1571 flow [2023-09-01 04:43:25,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1571, PETRI_PLACES=161, PETRI_TRANSITIONS=197} [2023-09-01 04:43:25,993 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 104 predicate places. [2023-09-01 04:43:25,993 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 197 transitions, 1571 flow [2023-09-01 04:43:25,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:25,995 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:26,013 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:43:26,205 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,SelfDestructingSolverStorable11 [2023-09-01 04:43:26,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:43:26,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1450758455, now seen corresponding path program 1 times [2023-09-01 04:43:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891129924] [2023-09-01 04:43:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891129924] [2023-09-01 04:43:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891129924] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:43:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636274027] [2023-09-01 04:43:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:26,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:43:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:43:26,684 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:43:26,707 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:43:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:26,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjunts are in the unsatisfiable core [2023-09-01 04:43:26,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:43:26,837 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:43:26,837 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:43:26,985 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:43:27,027 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:43:27,090 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:43:27,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:27,121 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:43:27,190 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-09-01 04:43:27,191 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:43:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:27,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:43:27,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_602 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_601) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_602) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_602 2147483648) 0))) is different from false [2023-09-01 04:43:27,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:43:27,459 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 1 case distinctions, treesize of input 57 treesize of output 48 [2023-09-01 04:43:27,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:43:27,473 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 889 treesize of output 879 [2023-09-01 04:43:27,514 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 516 treesize of output 500 [2023-09-01 04:43:27,562 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 498 treesize of output 466 [2023-09-01 04:43:28,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 04:43:28,152 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:43:28,163 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 24 treesize of output 20 [2023-09-01 04:43:28,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:43:28,193 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 313 treesize of output 297 [2023-09-01 04:43:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636274027] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:28,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-09-01 04:43:28,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183610194] [2023-09-01 04:43:28,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:28,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-09-01 04:43:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:28,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-09-01 04:43:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=606, Unknown=10, NotChecked=52, Total=812 [2023-09-01 04:43:28,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 449 [2023-09-01 04:43:28,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 197 transitions, 1571 flow. Second operand has 29 states, 29 states have (on average 169.6551724137931) internal successors, (4920), 29 states have internal predecessors, (4920), 0 states have call successors, (0), 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:28,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:28,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 449 [2023-09-01 04:43:28,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:43:29,387 INFO L130 PetriNetUnfolder]: 2320/4589 cut-off events. [2023-09-01 04:43:29,388 INFO L131 PetriNetUnfolder]: For 15420/15450 co-relation queries the response was YES. [2023-09-01 04:43:29,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18516 conditions, 4589 events. 2320/4589 cut-off events. For 15420/15450 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 30931 event pairs, 1095 based on Foata normal form. 28/4201 useless extension candidates. Maximal degree in co-relation 18161. Up to 3622 conditions per place. [2023-09-01 04:43:29,422 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 189 selfloop transitions, 32 changer transitions 3/230 dead transitions. [2023-09-01 04:43:29,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 230 transitions, 2147 flow [2023-09-01 04:43:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:43:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:43:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2023-09-01 04:43:29,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4060876020786934 [2023-09-01 04:43:29,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2023-09-01 04:43:29,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2023-09-01 04:43:29,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:43:29,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2023-09-01 04:43:29,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 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,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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,430 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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,430 INFO L175 Difference]: Start difference. First operand has 161 places, 197 transitions, 1571 flow. Second operand 6 states and 1094 transitions. [2023-09-01 04:43:29,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 230 transitions, 2147 flow [2023-09-01 04:43:29,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 230 transitions, 2065 flow, removed 19 selfloop flow, removed 9 redundant places. [2023-09-01 04:43:29,467 INFO L231 Difference]: Finished difference. Result has 157 places, 195 transitions, 1548 flow [2023-09-01 04:43:29,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1548, PETRI_PLACES=157, PETRI_TRANSITIONS=195} [2023-09-01 04:43:29,467 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 100 predicate places. [2023-09-01 04:43:29,468 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 195 transitions, 1548 flow [2023-09-01 04:43:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 169.6551724137931) internal successors, (4920), 29 states have internal predecessors, (4920), 0 states have call successors, (0), 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,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:43:29,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:43:29,477 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:43:29,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:43:29,678 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:43:29,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:43:29,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1605465588, now seen corresponding path program 2 times [2023-09-01 04:43:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:43:29,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081020836] [2023-09-01 04:43:29,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:43:29,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:43:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:43:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:30,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:43:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081020836] [2023-09-01 04:43:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081020836] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:43:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927265647] [2023-09-01 04:43:30,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 04:43:30,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:43:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:43:30,553 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:43:30,556 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:43:30,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 04:43:30,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:43:30,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 77 conjunts are in the unsatisfiable core [2023-09-01 04:43:30,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:43:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:30,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:30,766 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:43:30,767 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:43:30,792 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-09-01 04:43:30,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2023-09-01 04:43:30,927 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:43:31,055 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:43:31,243 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:43:31,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:43:31,316 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 33 treesize of output 35 [2023-09-01 04:43:31,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-09-01 04:43:31,522 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 47 treesize of output 40 [2023-09-01 04:43:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:43:31,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:43:31,965 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))) is different from false [2023-09-01 04:43:32,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_699) .cse2 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_701) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_699))))) is different from false [2023-09-01 04:43:32,353 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_699) .cse2 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_701) (< (+ (select .cse1 .cse3) 1) v_ArrVal_699) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:43:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 04:43:40,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927265647] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:43:40,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:43:40,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-09-01 04:43:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728344614] [2023-09-01 04:43:40,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:43:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-01 04:43:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:43:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-01 04:43:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=776, Unknown=24, NotChecked=192, Total=1260 [2023-09-01 04:43:40,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:43:40,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 195 transitions, 1548 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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:40,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:43:40,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:43:40,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:00,971 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:44:02,980 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:44:05,413 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 [1] [2023-09-01 04:44:06,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:10,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:44:19,482 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_701 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_701)) |c_~#stored_elements~0.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_701))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_705 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) .cse2) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))))) is different from false [2023-09-01 04:44:20,412 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_705 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|)))))) is different from false [2023-09-01 04:44:20,447 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_704) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_705) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-09-01 04:44:21,619 INFO L130 PetriNetUnfolder]: 2885/5714 cut-off events. [2023-09-01 04:44:21,619 INFO L131 PetriNetUnfolder]: For 19641/19661 co-relation queries the response was YES. [2023-09-01 04:44:21,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23231 conditions, 5714 events. 2885/5714 cut-off events. For 19641/19661 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 40547 event pairs, 1001 based on Foata normal form. 38/5274 useless extension candidates. Maximal degree in co-relation 20577. Up to 3134 conditions per place. [2023-09-01 04:44:21,662 INFO L137 encePairwiseOnDemand]: 426/449 looper letters, 247 selfloop transitions, 131 changer transitions 3/387 dead transitions. [2023-09-01 04:44:21,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 387 transitions, 3974 flow [2023-09-01 04:44:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-09-01 04:44:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-09-01 04:44:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5094 transitions. [2023-09-01 04:44:21,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39121419245833655 [2023-09-01 04:44:21,670 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5094 transitions. [2023-09-01 04:44:21,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5094 transitions. [2023-09-01 04:44:21,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:44:21,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5094 transitions. [2023-09-01 04:44:21,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 175.6551724137931) internal successors, (5094), 29 states have internal predecessors, (5094), 0 states have call successors, (0), 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:21,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 449.0) internal successors, (13470), 30 states have internal predecessors, (13470), 0 states have call successors, (0), 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:21,701 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 449.0) internal successors, (13470), 30 states have internal predecessors, (13470), 0 states have call successors, (0), 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:21,701 INFO L175 Difference]: Start difference. First operand has 157 places, 195 transitions, 1548 flow. Second operand 29 states and 5094 transitions. [2023-09-01 04:44:21,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 387 transitions, 3974 flow [2023-09-01 04:44:21,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 387 transitions, 3934 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 04:44:21,759 INFO L231 Difference]: Finished difference. Result has 195 places, 266 transitions, 2649 flow [2023-09-01 04:44:21,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2649, PETRI_PLACES=195, PETRI_TRANSITIONS=266} [2023-09-01 04:44:21,760 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places. [2023-09-01 04:44:21,760 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 266 transitions, 2649 flow [2023-09-01 04:44:21,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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:21,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:44:21,762 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:44:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-01 04:44:21,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:21,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:44:21,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:44:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1605177288, now seen corresponding path program 3 times [2023-09-01 04:44:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:44:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484478102] [2023-09-01 04:44:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:44:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:44:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:44:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:44:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484478102] [2023-09-01 04:44:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484478102] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:44:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071210397] [2023-09-01 04:44:22,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 04:44:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:44:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:44:22,889 INFO L229 MonitoredProcess]: Starting monitored process 6 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:44:22,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 04:44:23,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 04:44:23,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:44:23,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 75 conjunts are in the unsatisfiable core [2023-09-01 04:44:23,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:44:23,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:23,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:23,101 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:44:23,102 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:44:23,117 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:44:23,117 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:44:23,234 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:44:23,340 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:44:23,484 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:44:23,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:44:23,563 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 33 treesize of output 35 [2023-09-01 04:44:23,683 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 47 treesize of output 40 [2023-09-01 04:44:23,839 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 38 treesize of output 40 [2023-09-01 04:44:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:44:24,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:44:24,198 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_805) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))) is different from false [2023-09-01 04:44:24,216 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_805) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))))) is different from false [2023-09-01 04:44:24,256 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_802 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_802) .cse3 v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_802) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_805)))))) is different from false [2023-09-01 04:44:26,384 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_805 Int) (v_ArrVal_806 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_800 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_800)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_802) .cse1 v_ArrVal_805)) |c_~#stored_elements~0.base| v_ArrVal_806))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_805) (< (+ (select .cse0 .cse2) 1) v_ArrVal_802) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse4 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))))) is different from false [2023-09-01 04:44:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 04:44:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071210397] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:44:32,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:44:32,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-09-01 04:44:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639164183] [2023-09-01 04:44:32,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:44:32,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-01 04:44:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:44:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-01 04:44:32,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=708, Unknown=23, NotChecked=252, Total=1260 [2023-09-01 04:44:32,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:44:32,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 266 transitions, 2649 flow. Second operand has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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:32,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:44:32,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:44:32,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:44:49,950 WARN L222 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 87 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:44:52,102 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:44:54,119 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:44:56,128 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:44:58,133 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:45:00,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:45:00,693 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 Int) (v_ArrVal_809 (Array Int Int))) (< (select (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_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 Int) (v_ArrVal_809 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_807)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_809) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-09-01 04:45:02,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:45:04,080 INFO L130 PetriNetUnfolder]: 3303/6414 cut-off events. [2023-09-01 04:45:04,080 INFO L131 PetriNetUnfolder]: For 101267/102192 co-relation queries the response was YES. [2023-09-01 04:45:04,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40534 conditions, 6414 events. 3303/6414 cut-off events. For 101267/102192 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 45720 event pairs, 1077 based on Foata normal form. 34/5916 useless extension candidates. Maximal degree in co-relation 39930. Up to 3702 conditions per place. [2023-09-01 04:45:04,135 INFO L137 encePairwiseOnDemand]: 428/449 looper letters, 265 selfloop transitions, 169 changer transitions 3/443 dead transitions. [2023-09-01 04:45:04,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 443 transitions, 6355 flow [2023-09-01 04:45:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-01 04:45:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-09-01 04:45:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4404 transitions. [2023-09-01 04:45:04,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923385300668151 [2023-09-01 04:45:04,140 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4404 transitions. [2023-09-01 04:45:04,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4404 transitions. [2023-09-01 04:45:04,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:04,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4404 transitions. [2023-09-01 04:45:04,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 176.16) internal successors, (4404), 25 states have internal predecessors, (4404), 0 states have call successors, (0), 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,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 449.0) internal successors, (11674), 26 states have internal predecessors, (11674), 0 states have call successors, (0), 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,153 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 449.0) internal successors, (11674), 26 states have internal predecessors, (11674), 0 states have call successors, (0), 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,153 INFO L175 Difference]: Start difference. First operand has 195 places, 266 transitions, 2649 flow. Second operand 25 states and 4404 transitions. [2023-09-01 04:45:04,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 443 transitions, 6355 flow [2023-09-01 04:45:04,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 443 transitions, 5862 flow, removed 210 selfloop flow, removed 9 redundant places. [2023-09-01 04:45:04,249 INFO L231 Difference]: Finished difference. Result has 222 places, 333 transitions, 4034 flow [2023-09-01 04:45:04,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4034, PETRI_PLACES=222, PETRI_TRANSITIONS=333} [2023-09-01 04:45:04,250 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 165 predicate places. [2023-09-01 04:45:04,250 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 333 transitions, 4034 flow [2023-09-01 04:45:04,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.33333333333334) internal successors, (6060), 36 states have internal predecessors, (6060), 0 states have call successors, (0), 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,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:04,251 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:04,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-09-01 04:45:04,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-09-01 04:45:04,457 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:04,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -682370779, now seen corresponding path program 1 times [2023-09-01 04:45:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233064495] [2023-09-01 04:45:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233064495] [2023-09-01 04:45:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233064495] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680067468] [2023-09-01 04:45:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:04,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:04,773 INFO L229 MonitoredProcess]: Starting monitored process 7 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:04,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 04:45:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:04,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjunts are in the unsatisfiable core [2023-09-01 04:45:04,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:04,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-09-01 04:45:04,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:04,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-09-01 04:45:05,042 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-09-01 04:45:05,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-09-01 04:45:05,079 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 25 treesize of output 24 [2023-09-01 04:45:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:05,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:05,165 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_891 Int) (v_ArrVal_890 (Array Int Int))) (or (< (+ v_ArrVal_891 2147483648) 0) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_890) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_891) (+ |c_~#queue~0.offset| 3204)))))) is different from false [2023-09-01 04:45:05,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:45:05,177 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 1 case distinctions, treesize of input 31 treesize of output 32 [2023-09-01 04:45:05,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:45:05,186 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 55 treesize of output 59 [2023-09-01 04:45:05,193 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 28 treesize of output 24 [2023-09-01 04:45:05,207 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:45:05,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 04:45:05,217 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 43 treesize of output 43 [2023-09-01 04:45:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680067468] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:05,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-09-01 04:45:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373468907] [2023-09-01 04:45:05,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-01 04:45:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-01 04:45:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2023-09-01 04:45:05,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 449 [2023-09-01 04:45:05,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 333 transitions, 4034 flow. Second operand has 20 states, 20 states have (on average 180.65) internal successors, (3613), 20 states have internal predecessors, (3613), 0 states have call successors, (0), 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:05,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:05,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 449 [2023-09-01 04:45:05,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:07,240 INFO L130 PetriNetUnfolder]: 4452/8730 cut-off events. [2023-09-01 04:45:07,240 INFO L131 PetriNetUnfolder]: For 330251/330340 co-relation queries the response was YES. [2023-09-01 04:45:07,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68857 conditions, 8730 events. 4452/8730 cut-off events. For 330251/330340 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 67154 event pairs, 1690 based on Foata normal form. 32/8034 useless extension candidates. Maximal degree in co-relation 67587. Up to 3322 conditions per place. [2023-09-01 04:45:07,328 INFO L137 encePairwiseOnDemand]: 440/449 looper letters, 388 selfloop transitions, 78 changer transitions 4/476 dead transitions. [2023-09-01 04:45:07,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 476 transitions, 6598 flow [2023-09-01 04:45:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 04:45:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 04:45:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1383 transitions. [2023-09-01 04:45:07,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44002545338848237 [2023-09-01 04:45:07,330 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1383 transitions. [2023-09-01 04:45:07,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1383 transitions. [2023-09-01 04:45:07,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:07,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1383 transitions. [2023-09-01 04:45:07,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.57142857142858) internal successors, (1383), 7 states have internal predecessors, (1383), 0 states have call successors, (0), 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,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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,334 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 449.0) internal successors, (3592), 8 states have internal predecessors, (3592), 0 states have call successors, (0), 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,334 INFO L175 Difference]: Start difference. First operand has 222 places, 333 transitions, 4034 flow. Second operand 7 states and 1383 transitions. [2023-09-01 04:45:07,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 476 transitions, 6598 flow [2023-09-01 04:45:07,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 476 transitions, 5705 flow, removed 408 selfloop flow, removed 9 redundant places. [2023-09-01 04:45:07,486 INFO L231 Difference]: Finished difference. Result has 222 places, 348 transitions, 3901 flow [2023-09-01 04:45:07,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3319, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3901, PETRI_PLACES=222, PETRI_TRANSITIONS=348} [2023-09-01 04:45:07,487 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 165 predicate places. [2023-09-01 04:45:07,487 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 348 transitions, 3901 flow [2023-09-01 04:45:07,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 180.65) internal successors, (3613), 20 states have internal predecessors, (3613), 0 states have call successors, (0), 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,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:07,488 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:07,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-01 04:45:07,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-09-01 04:45:07,697 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:07,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash 330037709, now seen corresponding path program 1 times [2023-09-01 04:45:07,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:07,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675610239] [2023-09-01 04:45:07,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:07,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675610239] [2023-09-01 04:45:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675610239] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137557395] [2023-09-01 04:45:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:08,565 INFO L229 MonitoredProcess]: Starting monitored process 8 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:08,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 04:45:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:08,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 76 conjunts are in the unsatisfiable core [2023-09-01 04:45:08,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:08,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:08,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:08,737 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:45:08,737 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:45:08,754 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:45:08,754 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:45:08,845 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:45:08,903 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:45:09,029 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:45:09,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:09,077 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 52 treesize of output 54 [2023-09-01 04:45:09,183 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 66 treesize of output 59 [2023-09-01 04:45:09,247 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 57 treesize of output 59 [2023-09-01 04:45:09,329 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 62 treesize of output 57 [2023-09-01 04:45:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:09,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:09,513 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse1) 2147483650)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)))) is different from false [2023-09-01 04:45:09,524 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_998))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< 0 (+ (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse1) 2147483650)))))) is different from false [2023-09-01 04:45:09,539 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_998))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse2))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|))))) is different from false [2023-09-01 04:45:09,553 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_998))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse2))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|))))) is different from false [2023-09-01 04:45:09,575 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_998 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_995) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_998))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< 0 (+ (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse1) 2147483650)))))) is different from false [2023-09-01 04:45:09,607 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_993 Int) (v_ArrVal_998 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (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_993)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_995) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_998))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse2))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|))))) is different from false [2023-09-01 04:45:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-09-01 04:45:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137557395] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:09,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:09,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-09-01 04:45:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775813089] [2023-09-01 04:45:09,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:09,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 04:45:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 04:45:09,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=525, Unknown=15, NotChecked=330, Total=1056 [2023-09-01 04:45:09,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 449 [2023-09-01 04:45:09,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 348 transitions, 3901 flow. Second operand has 33 states, 33 states have (on average 174.72727272727272) internal successors, (5766), 33 states have internal predecessors, (5766), 0 states have call successors, (0), 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:09,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:09,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 449 [2023-09-01 04:45:09,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:17,932 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_998 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_998))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (< 0 (+ (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_~#queue~0.base|) .cse1) 2147483650)))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (<= 0 (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) 3204) 2147483648))) is different from false [2023-09-01 04:45:18,233 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1001 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0)))) (forall ((v_ArrVal_1001 (Array Int Int)) (v_ArrVal_999 Int)) (< 0 (+ 2147483650 (select (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_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_999)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1001) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0)))))) is different from false [2023-09-01 04:45:20,229 INFO L130 PetriNetUnfolder]: 5561/10795 cut-off events. [2023-09-01 04:45:20,229 INFO L131 PetriNetUnfolder]: For 420141/420364 co-relation queries the response was YES. [2023-09-01 04:45:20,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85877 conditions, 10795 events. 5561/10795 cut-off events. For 420141/420364 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 82792 event pairs, 1732 based on Foata normal form. 233/10045 useless extension candidates. Maximal degree in co-relation 84378. Up to 6022 conditions per place. [2023-09-01 04:45:20,320 INFO L137 encePairwiseOnDemand]: 426/449 looper letters, 355 selfloop transitions, 212 changer transitions 3/576 dead transitions. [2023-09-01 04:45:20,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 576 transitions, 9634 flow [2023-09-01 04:45:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-09-01 04:45:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-09-01 04:45:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5130 transitions. [2023-09-01 04:45:20,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4080496341075406 [2023-09-01 04:45:20,325 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5130 transitions. [2023-09-01 04:45:20,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5130 transitions. [2023-09-01 04:45:20,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:20,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5130 transitions. [2023-09-01 04:45:20,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 183.21428571428572) internal successors, (5130), 28 states have internal predecessors, (5130), 0 states have call successors, (0), 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:20,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 449.0) internal successors, (13021), 29 states have internal predecessors, (13021), 0 states have call successors, (0), 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:20,340 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 449.0) internal successors, (13021), 29 states have internal predecessors, (13021), 0 states have call successors, (0), 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:20,340 INFO L175 Difference]: Start difference. First operand has 222 places, 348 transitions, 3901 flow. Second operand 28 states and 5130 transitions. [2023-09-01 04:45:20,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 576 transitions, 9634 flow [2023-09-01 04:45:20,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 576 transitions, 9249 flow, removed 188 selfloop flow, removed 5 redundant places. [2023-09-01 04:45:20,511 INFO L231 Difference]: Finished difference. Result has 259 places, 442 transitions, 6430 flow [2023-09-01 04:45:20,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=3671, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6430, PETRI_PLACES=259, PETRI_TRANSITIONS=442} [2023-09-01 04:45:20,512 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 202 predicate places. [2023-09-01 04:45:20,512 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 442 transitions, 6430 flow [2023-09-01 04:45:20,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 174.72727272727272) internal successors, (5766), 33 states have internal predecessors, (5766), 0 states have call successors, (0), 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:20,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:20,514 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:20,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-09-01 04:45:20,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:20,720 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:20,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -660856951, now seen corresponding path program 1 times [2023-09-01 04:45:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425210909] [2023-09-01 04:45:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 04:45:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425210909] [2023-09-01 04:45:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425210909] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:20,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:45:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186474394] [2023-09-01 04:45:20,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:20,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:45:20,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:45:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:45:20,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:45:20,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 442 transitions, 6430 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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:20,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:20,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:45:20,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:23,117 INFO L130 PetriNetUnfolder]: 5369/10556 cut-off events. [2023-09-01 04:45:23,118 INFO L131 PetriNetUnfolder]: For 593560/593901 co-relation queries the response was YES. [2023-09-01 04:45:23,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95847 conditions, 10556 events. 5369/10556 cut-off events. For 593560/593901 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 82160 event pairs, 3124 based on Foata normal form. 156/9771 useless extension candidates. Maximal degree in co-relation 93023. Up to 6505 conditions per place. [2023-09-01 04:45:23,239 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 368 selfloop transitions, 47 changer transitions 0/442 dead transitions. [2023-09-01 04:45:23,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 442 transitions, 7317 flow [2023-09-01 04:45:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:45:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:45:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-09-01 04:45:23,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5337787676317743 [2023-09-01 04:45:23,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-09-01 04:45:23,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-09-01 04:45:23,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:23,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-09-01 04:45:23,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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:23,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:23,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:23,242 INFO L175 Difference]: Start difference. First operand has 259 places, 442 transitions, 6430 flow. Second operand 3 states and 719 transitions. [2023-09-01 04:45:23,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 442 transitions, 7317 flow [2023-09-01 04:45:23,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 442 transitions, 6415 flow, removed 414 selfloop flow, removed 9 redundant places. [2023-09-01 04:45:23,634 INFO L231 Difference]: Finished difference. Result has 251 places, 430 transitions, 5430 flow [2023-09-01 04:45:23,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5336, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5430, PETRI_PLACES=251, PETRI_TRANSITIONS=430} [2023-09-01 04:45:23,635 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 194 predicate places. [2023-09-01 04:45:23,635 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 430 transitions, 5430 flow [2023-09-01 04:45:23,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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:23,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:23,635 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:23,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 04:45:23,636 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:23,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1371567626, now seen corresponding path program 1 times [2023-09-01 04:45:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576681523] [2023-09-01 04:45:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:23,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576681523] [2023-09-01 04:45:23,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576681523] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:23,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 04:45:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284798144] [2023-09-01 04:45:23,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:45:23,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:45:23,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:45:23,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 449 [2023-09-01 04:45:23,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 430 transitions, 5430 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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:23,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:23,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 449 [2023-09-01 04:45:23,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:25,672 INFO L130 PetriNetUnfolder]: 5192/10253 cut-off events. [2023-09-01 04:45:25,673 INFO L131 PetriNetUnfolder]: For 573507/573652 co-relation queries the response was YES. [2023-09-01 04:45:25,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89827 conditions, 10253 events. 5192/10253 cut-off events. For 573507/573652 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 79603 event pairs, 2943 based on Foata normal form. 182/9628 useless extension candidates. Maximal degree in co-relation 87903. Up to 9451 conditions per place. [2023-09-01 04:45:25,785 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 392 selfloop transitions, 1 changer transitions 3/423 dead transitions. [2023-09-01 04:45:25,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 423 transitions, 6195 flow [2023-09-01 04:45:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:45:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:45:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2023-09-01 04:45:25,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367483296213809 [2023-09-01 04:45:25,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2023-09-01 04:45:25,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2023-09-01 04:45:25,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:25,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2023-09-01 04:45:25,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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:25,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:25,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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:25,788 INFO L175 Difference]: Start difference. First operand has 251 places, 430 transitions, 5430 flow. Second operand 3 states and 723 transitions. [2023-09-01 04:45:25,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 423 transitions, 6195 flow [2023-09-01 04:45:26,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 423 transitions, 6148 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 04:45:26,120 INFO L231 Difference]: Finished difference. Result has 251 places, 415 transitions, 5163 flow [2023-09-01 04:45:26,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=5161, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5163, PETRI_PLACES=251, PETRI_TRANSITIONS=415} [2023-09-01 04:45:26,121 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 194 predicate places. [2023-09-01 04:45:26,121 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 415 transitions, 5163 flow [2023-09-01 04:45:26,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:26,121 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:45:26,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-09-01 04:45:26,122 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:26,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1622923071, now seen corresponding path program 1 times [2023-09-01 04:45:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935348038] [2023-09-01 04:45:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 04:45:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935348038] [2023-09-01 04:45:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935348038] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 04:45:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 04:45:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 04:45:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192654301] [2023-09-01 04:45:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 04:45:26,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 04:45:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 04:45:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 04:45:26,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 449 [2023-09-01 04:45:26,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 415 transitions, 5163 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:26,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 449 [2023-09-01 04:45:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:45:27,908 INFO L130 PetriNetUnfolder]: 4115/8402 cut-off events. [2023-09-01 04:45:27,908 INFO L131 PetriNetUnfolder]: For 456653/456655 co-relation queries the response was YES. [2023-09-01 04:45:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64543 conditions, 8402 events. 4115/8402 cut-off events. For 456653/456655 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 60486 event pairs, 376 based on Foata normal form. 499/8138 useless extension candidates. Maximal degree in co-relation 63702. Up to 7370 conditions per place. [2023-09-01 04:45:27,986 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 364 selfloop transitions, 5 changer transitions 1/395 dead transitions. [2023-09-01 04:45:27,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 395 transitions, 5826 flow [2023-09-01 04:45:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 04:45:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 04:45:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-09-01 04:45:27,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5337787676317743 [2023-09-01 04:45:27,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-09-01 04:45:27,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-09-01 04:45:27,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:45:27,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-09-01 04:45:27,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 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,990 INFO L175 Difference]: Start difference. First operand has 251 places, 415 transitions, 5163 flow. Second operand 3 states and 719 transitions. [2023-09-01 04:45:27,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 395 transitions, 5826 flow [2023-09-01 04:45:28,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 395 transitions, 5813 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 04:45:28,132 INFO L231 Difference]: Finished difference. Result has 252 places, 380 transitions, 4849 flow [2023-09-01 04:45:28,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4839, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4849, PETRI_PLACES=252, PETRI_TRANSITIONS=380} [2023-09-01 04:45:28,133 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 195 predicate places. [2023-09-01 04:45:28,133 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 380 transitions, 4849 flow [2023-09-01 04:45:28,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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:28,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:45:28,133 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:45:28,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-09-01 04:45:28,133 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:45:28,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:45:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash -66120868, now seen corresponding path program 4 times [2023-09-01 04:45:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:45:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004757978] [2023-09-01 04:45:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:45:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:45:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:45:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:45:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004757978] [2023-09-01 04:45:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004757978] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:45:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669605090] [2023-09-01 04:45:29,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 04:45:29,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:45:29,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:45:29,746 INFO L229 MonitoredProcess]: Starting monitored process 9 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:29,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-09-01 04:45:29,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 04:45:29,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:45:29,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 99 conjunts are in the unsatisfiable core [2023-09-01 04:45:29,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:45:29,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:29,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:29,916 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:45:29,916 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:45:29,930 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:45:29,931 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:45:30,077 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:45:30,192 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:45:30,346 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:45:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:30,418 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 33 treesize of output 35 [2023-09-01 04:45:30,536 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 47 treesize of output 40 [2023-09-01 04:45:30,908 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:45:31,121 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:45:31,605 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:45:33,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:45:33,943 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 44 treesize of output 46 [2023-09-01 04:45:35,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-09-01 04:45:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:45:42,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:45:43,046 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1253) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-09-01 04:45:43,267 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1253) (= .cse0 800) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)))))) is different from false [2023-09-01 04:45:43,335 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (select (store (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (= .cse0 800) (< (+ .cse0 1) v_ArrVal_1253) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1250) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)))))) is different from false [2023-09-01 04:45:43,372 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (= .cse0 800) (< (+ .cse0 1) v_ArrVal_1253) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1250))))))) is different from false [2023-09-01 04:45:43,403 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (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_1248)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse5 .cse6)) (.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ .cse1 1) v_ArrVal_1253) (= 800 .cse1) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1250))))))) is different from false [2023-09-01 04:45:43,450 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse3 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1250) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse1) 2147483647) (< (+ .cse5 1) v_ArrVal_1253) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (= 800 .cse5)))))))) is different from false [2023-09-01 04:45:43,493 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse4 (select .cse6 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse3) 2147483647) (< (+ .cse4 1) v_ArrVal_1253) (= 800 .cse4) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1250))))))))) is different from false [2023-09-01 04:45:43,534 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1244 Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1244)) |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 .cse2 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse0 (select .cse6 .cse2))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1244) (< (+ .cse0 1) v_ArrVal_1253) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse3) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1250) (= 800 .cse0))))))))) is different from false [2023-09-01 04:45:43,578 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1244 Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1244)) |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse7 .cse3 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse2 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse0 (select .cse8 .cse2))) (or (< (+ .cse0 1) v_ArrVal_1253) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse3) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1244) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1250) (= 800 .cse0)))))))))) is different from false [2023-09-01 04:45:43,673 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1244 Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1243 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1243) .cse7 v_ArrVal_1244)) |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse4 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse5 (select .cse8 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1250) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1243) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ .cse5 1) v_ArrVal_1253) (= 800 .cse5) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1244)))))))))) is different from false [2023-09-01 04:45:43,734 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1244 Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1243 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1243) .cse8 v_ArrVal_1244)) |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store .cse9 .cse6 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse7 (select .cse9 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1250) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1243) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse2 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ .cse7 1) v_ArrVal_1253) (= 800 .cse7) (< (+ (select .cse3 .cse8) 1) v_ArrVal_1244)))))))))) is different from false [2023-09-01 04:45:43,799 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1251 (Array Int Int)) (v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1241 Int) (v_ArrVal_1244 Int) (v_ArrVal_1243 Int) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int)) (let ((.cse1 (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_1241)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1243) .cse3 v_ArrVal_1244)) |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248)) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse7 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse10 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse10 .cse5)) (.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store .cse10 .cse5 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1243) (< (+ .cse0 1) v_ArrVal_1253) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1244) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse7) 2147483647) (< (+ (select .cse8 .cse7) 1) v_ArrVal_1250)))))))))) is different from false [2023-09-01 04:45:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-09-01 04:45:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669605090] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:45:52,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:45:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2023-09-01 04:45:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191263506] [2023-09-01 04:45:52,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:45:52,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-09-01 04:45:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:45:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-09-01 04:45:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=1390, Unknown=30, NotChecked=1140, Total=3080 [2023-09-01 04:45:52,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:45:52,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 380 transitions, 4849 flow. Second operand has 56 states, 56 states have (on average 168.28571428571428) internal successors, (9424), 56 states have internal predecessors, (9424), 0 states have call successors, (0), 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,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:45:52,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:45:52,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:46:03,619 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:46:05,634 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:46:09,575 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:46:11,582 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:46:13,593 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:46:15,603 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:46:17,613 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:46:19,621 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:46:21,629 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:46:23,838 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:46:26,006 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:46:28,025 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:46:32,545 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:46:36,626 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:46:38,641 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:46:44,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:46:56,687 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:00,812 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:03,583 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:08,099 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:16,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:47:18,861 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:47:20,872 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:47:22,880 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:47:24,888 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:47:26,896 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:47:28,905 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:47:30,913 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:47:32,926 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:47:34,936 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:47:41,615 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:47:51,892 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:47:53,902 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:47:55,915 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:47:57,924 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:47:59,935 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:01,944 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:03,953 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:05,961 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:07,971 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:16,733 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:29,284 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:31,294 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:33,303 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:35,313 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:37,319 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:39,336 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:41,344 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:43,353 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:45,517 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:47,530 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:49,542 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:51,723 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:53,730 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:55,738 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:57,747 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:59,758 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:01,765 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:03,771 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:05,779 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:07,786 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:09,794 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:11,800 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,808 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:15,815 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:17,863 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:34,631 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,712 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:50:00,587 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:11,108 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:13,138 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:15,155 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:06,272 WARN L222 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 168 DAG size of output: 166 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 04:51:08,277 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,295 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:51:11,302 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse4 .cse5) 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1253) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse3) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_1253 Int) (v_ArrVal_1244 Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1248 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1244)) |c_~#stored_elements~0.base| v_ArrVal_1246))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_1248))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store .cse9 .cse3 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse11 |c_~#queue~0.base| (store .cse10 .cse2 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|)) (.cse6 (select .cse10 .cse2))) (or (< (+ .cse6 1) v_ArrVal_1253) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse3) 2147483647) (< .cse0 v_ArrVal_1244) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (+ (select .cse9 .cse3) 1) v_ArrVal_1250) (= 800 .cse6))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse16 (select .cse15 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse13 (select .cse16 .cse5)) (.cse14 (select (store (store .cse15 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse5 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< (+ .cse13 1) v_ArrVal_1253) (= .cse13 800) (< (select (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse3) 2147483647) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|))))))))) is different from false [2023-09-01 04:51:54,237 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:56,246 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:58,337 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:00,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 04:52:04,774 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,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:07,386 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse5 .cse6)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_1253) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse4) 2147483647)))))) (and .cse0 (or .cse0 (= 800 .cse1)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1253) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) .cse4) 2147483647)))))))) is different from false [2023-09-01 04:52:09,476 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:11,489 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:13,497 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:52:15,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:52:16,309 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74| Int) (v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1256 Int) (v_ArrVal_1251 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1250)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1251))) (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1253)) |c_~#stored_elements~0.base| v_ArrVal_1254) |c_~#queue~0.base|))) (or (= .cse2 800) (< (+ .cse2 1) v_ArrVal_1253) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1250) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)) v_ArrVal_1256) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_74|)))))))) is different from false [2023-09-01 04:52:17,946 INFO L130 PetriNetUnfolder]: 5382/11163 cut-off events. [2023-09-01 04:52:17,946 INFO L131 PetriNetUnfolder]: For 518240/518399 co-relation queries the response was YES. [2023-09-01 04:52:18,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84829 conditions, 11163 events. 5382/11163 cut-off events. For 518240/518399 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 87334 event pairs, 2165 based on Foata normal form. 38/10166 useless extension candidates. Maximal degree in co-relation 83472. Up to 5522 conditions per place. [2023-09-01 04:52:18,050 INFO L137 encePairwiseOnDemand]: 430/449 looper letters, 333 selfloop transitions, 366 changer transitions 5/710 dead transitions. [2023-09-01 04:52:18,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 710 transitions, 14316 flow [2023-09-01 04:52:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-09-01 04:52:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-09-01 04:52:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 9888 transitions. [2023-09-01 04:52:18,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38635564412143947 [2023-09-01 04:52:18,071 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 9888 transitions. [2023-09-01 04:52:18,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 9888 transitions. [2023-09-01 04:52:18,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:52:18,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 9888 transitions. [2023-09-01 04:52:18,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 173.47368421052633) internal successors, (9888), 57 states have internal predecessors, (9888), 0 states have call successors, (0), 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:52:18,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 449.0) internal successors, (26042), 58 states have internal predecessors, (26042), 0 states have call successors, (0), 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:52:18,110 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 449.0) internal successors, (26042), 58 states have internal predecessors, (26042), 0 states have call successors, (0), 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:52:18,110 INFO L175 Difference]: Start difference. First operand has 252 places, 380 transitions, 4849 flow. Second operand 57 states and 9888 transitions. [2023-09-01 04:52:18,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 710 transitions, 14316 flow [2023-09-01 04:52:18,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 710 transitions, 13738 flow, removed 284 selfloop flow, removed 1 redundant places. [2023-09-01 04:52:18,291 INFO L231 Difference]: Finished difference. Result has 334 places, 554 transitions, 10033 flow [2023-09-01 04:52:18,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=4812, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=10033, PETRI_PLACES=334, PETRI_TRANSITIONS=554} [2023-09-01 04:52:18,292 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 277 predicate places. [2023-09-01 04:52:18,292 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 554 transitions, 10033 flow [2023-09-01 04:52:18,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 168.28571428571428) internal successors, (9424), 56 states have internal predecessors, (9424), 0 states have call successors, (0), 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:52:18,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:52:18,293 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] [2023-09-01 04:52:18,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-09-01 04:52:18,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-09-01 04:52:18,494 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:52:18,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:52:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash -50836535, now seen corresponding path program 1 times [2023-09-01 04:52:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:52:18,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521148707] [2023-09-01 04:52:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:52:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:52:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:52:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:52:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521148707] [2023-09-01 04:52:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521148707] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:52:18,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982912349] [2023-09-01 04:52:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:52:18,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:52:18,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:52:18,541 INFO L229 MonitoredProcess]: Starting monitored process 10 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:52:18,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-09-01 04:52:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:52:18,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 04:52:18,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:52:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:18,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:52:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982912349] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:52:18,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:52:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-09-01 04:52:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967863] [2023-09-01 04:52:18,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:52:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 04:52:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:52:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 04:52:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 04:52:18,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 449 [2023-09-01 04:52:18,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 554 transitions, 10033 flow. Second operand has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 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:52:18,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:52:18,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 449 [2023-09-01 04:52:18,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:52:20,753 INFO L130 PetriNetUnfolder]: 3001/6347 cut-off events. [2023-09-01 04:52:20,753 INFO L131 PetriNetUnfolder]: For 952613/952868 co-relation queries the response was YES. [2023-09-01 04:52:20,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81257 conditions, 6347 events. 3001/6347 cut-off events. For 952613/952868 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 41809 event pairs, 1767 based on Foata normal form. 128/5991 useless extension candidates. Maximal degree in co-relation 80672. Up to 3679 conditions per place. [2023-09-01 04:52:20,840 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 511 selfloop transitions, 35 changer transitions 0/585 dead transitions. [2023-09-01 04:52:20,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 585 transitions, 12538 flow [2023-09-01 04:52:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 04:52:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 04:52:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1423 transitions. [2023-09-01 04:52:20,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282108389012621 [2023-09-01 04:52:20,842 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1423 transitions. [2023-09-01 04:52:20,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1423 transitions. [2023-09-01 04:52:20,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 04:52:20,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1423 transitions. [2023-09-01 04:52:20,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.16666666666666) internal successors, (1423), 6 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 04:52:20,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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:52:20,845 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 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:52:20,846 INFO L175 Difference]: Start difference. First operand has 334 places, 554 transitions, 10033 flow. Second operand 6 states and 1423 transitions. [2023-09-01 04:52:20,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 585 transitions, 12538 flow [2023-09-01 04:52:21,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 585 transitions, 10010 flow, removed 1198 selfloop flow, removed 15 redundant places. [2023-09-01 04:52:21,335 INFO L231 Difference]: Finished difference. Result has 328 places, 539 transitions, 7574 flow [2023-09-01 04:52:21,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=7273, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7574, PETRI_PLACES=328, PETRI_TRANSITIONS=539} [2023-09-01 04:52:21,336 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 271 predicate places. [2023-09-01 04:52:21,336 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 539 transitions, 7574 flow [2023-09-01 04:52:21,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.71428571428572) internal successors, (1594), 7 states have internal predecessors, (1594), 0 states have call successors, (0), 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:52:21,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 04:52:21,336 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 04:52:21,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-09-01 04:52:21,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:52:21,537 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-09-01 04:52:21,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 04:52:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -228871586, now seen corresponding path program 5 times [2023-09-01 04:52:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 04:52:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894972842] [2023-09-01 04:52:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 04:52:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 04:52:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 04:52:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 04:52:23,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894972842] [2023-09-01 04:52:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894972842] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 04:52:23,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961699955] [2023-09-01 04:52:23,048 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 04:52:23,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 04:52:23,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 04:52:23,049 INFO L229 MonitoredProcess]: Starting monitored process 11 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:52:23,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-09-01 04:52:23,198 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-09-01 04:52:23,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 04:52:23,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 100 conjunts are in the unsatisfiable core [2023-09-01 04:52:23,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 04:52:23,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:23,232 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 04:52:23,232 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:52:23,249 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 04:52:23,249 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:52:23,398 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:52:23,523 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:52:23,660 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:52:23,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:23,718 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 33 treesize of output 35 [2023-09-01 04:52:23,818 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 47 treesize of output 40 [2023-09-01 04:52:24,043 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:52:24,293 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:52:25,101 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 44 treesize of output 46 [2023-09-01 04:52:25,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 04:52:25,243 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 44 treesize of output 46 [2023-09-01 04:52:25,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2023-09-01 04:52:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 04:52:32,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 04:52:32,156 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-09-01 04:52:32,168 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1461) |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) is different from false [2023-09-01 04:52:41,957 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1456 Int) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1458 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1454))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_1456)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1458) .cse2 v_ArrVal_1460)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1461) |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1458) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1460) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) .cse1) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|))))))) is different from false [2023-09-01 04:52:41,996 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1452 Int) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1456 Int) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1458 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1452)) |c_~#stored_elements~0.base| v_ArrVal_1454))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_1456)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1458) .cse2 v_ArrVal_1460)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1461) |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1458) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1452) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1460))))))) is different from false [2023-09-01 04:52:42,041 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1452 Int) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1456 Int) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1458 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1452)) |c_~#stored_elements~0.base| v_ArrVal_1454))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_1456)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1458) .cse4 v_ArrVal_1460)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1461) |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1452) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) .cse3) 2147483647) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1458) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1460)))))))) is different from false [2023-09-01 04:52:42,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_1451 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1452 Int) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1456 Int) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1458 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1451) .cse3 v_ArrVal_1452)) |c_~#stored_elements~0.base| v_ArrVal_1454))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_1456)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1458) .cse4 v_ArrVal_1460)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1461) |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1452) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_1451) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1458) (< (+ (select .cse6 .cse4) 1) v_ArrVal_1460)))))))) is different from false [2023-09-01 04:52:44,737 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87| Int) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 Int) (v_ArrVal_1463 Int) (v_ArrVal_1456 Int) (v_ArrVal_1458 Int) (v_ArrVal_1449 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_1449)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1451) .cse7 v_ArrVal_1452)) |c_~#stored_elements~0.base| v_ArrVal_1454))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|)) v_ArrVal_1456)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1458) .cse3 v_ArrVal_1460)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1461) |c_~#stored_elements~0.base| v_ArrVal_1462) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1451) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_87|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1458) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_1463) .cse5) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1460) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) (< (+ (select .cse0 .cse7) 1) v_ArrVal_1452)))))))) is different from false [2023-09-01 04:52:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 7 not checked. [2023-09-01 04:52:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961699955] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 04:52:59,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 04:52:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2023-09-01 04:52:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192065615] [2023-09-01 04:52:59,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 04:52:59,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-09-01 04:52:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 04:52:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-09-01 04:52:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1668, Unknown=64, NotChecked=686, Total=2970 [2023-09-01 04:53:01,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:02,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:04,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:06,545 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 [1] [2023-09-01 04:53:08,555 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 [1] [2023-09-01 04:53:10,563 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 [1] [2023-09-01 04:53:12,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:14,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:16,622 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 [1] [2023-09-01 04:53:19,057 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 [1] [2023-09-01 04:53:21,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:23,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:25,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:27,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:29,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:31,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:33,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 [1] [2023-09-01 04:53:35,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:37,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:39,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:41,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:43,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:45,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:47,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:49,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:51,969 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 [1] [2023-09-01 04:53:53,979 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 [1] [2023-09-01 04:53:56,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:53:58,020 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 [1] [2023-09-01 04:54:00,033 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 [1] [2023-09-01 04:54:02,045 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 [1] [2023-09-01 04:54:04,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 [1] [2023-09-01 04:54:06,069 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 [1] [2023-09-01 04:54:08,081 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 [1] [2023-09-01 04:54:10,090 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 [1] [2023-09-01 04:54:12,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:14,209 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 [1] [2023-09-01 04:54:16,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:18,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:20,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:22,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:24,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:26,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:28,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:30,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:32,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:34,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:36,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:38,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:40,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:42,315 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 [1] [2023-09-01 04:54:44,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:46,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 04:54:48,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 [1] [2023-09-01 04:54:48,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 449 [2023-09-01 04:54:48,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 539 transitions, 7574 flow. Second operand has 55 states, 55 states have (on average 168.3090909090909) internal successors, (9257), 55 states have internal predecessors, (9257), 0 states have call successors, (0), 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:54:48,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 04:54:48,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 449 [2023-09-01 04:54:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 04:54:55,947 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,208 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:55:09,799 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:55:13,440 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:55:27,578 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:55:29,647 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:55:44,442 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:55:47,141 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:49,150 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:51,158 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:53,164 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:55,173 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:57,184 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:59,196 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:56:01,204 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:56:03,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:56:05,219 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:56:07,227 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:56:09,234 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:56:11,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:56:13,393 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:56:15,751 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:56:17,760 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] Killed by 15