./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.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/goblint-regression/06-symbeq_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --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 06:10:39,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 06:10:39,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 06:10:39,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 06:10:39,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 06:10:39,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 06:10:39,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 06:10:39,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 06:10:39,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 06:10:39,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 06:10:39,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 06:10:39,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 06:10:39,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 06:10:39,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 06:10:39,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 06:10:39,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 06:10:39,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 06:10:39,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 06:10:39,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 06:10:39,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 06:10:39,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 06:10:39,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 06:10:39,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 06:10:39,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 06:10:39,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 06:10:39,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 06:10:39,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 06:10:39,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 06:10:39,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 06:10:39,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 06:10:39,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 06:10:39,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 06:10:39,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 06:10:39,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 06:10:39,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 06:10:39,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 06:10:39,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 06:10:39,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 06:10:39,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 06:10:39,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 06:10:39,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 06:10:39,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-09-01 06:10:39,522 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 06:10:39,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 06:10:39,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 06:10:39,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 06:10:39,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 06:10:39,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 06:10:39,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 06:10:39,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 06:10:39,525 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 06:10:39,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 06:10:39,527 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 06:10:39,527 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 06:10:39,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 06:10:39,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 06:10:39,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 06:10:39,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 06:10:39,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 06:10:39,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 06:10:39,528 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-09-01 06:10:39,528 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 06:10:39,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 06:10:39,529 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 06:10:39,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 06:10:39,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 06:10:39,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 06:10:39,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 06:10:39,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 06:10:39,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 06:10:39,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 06:10:39,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 06:10:39,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 06:10:39,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 06:10:39,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 06:10:39,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 06:10:39,532 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 06:10:39,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 06:10:39,532 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 06:10:39,532 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 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 06:10:40,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 06:10:40,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 06:10:40,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 06:10:40,087 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 06:10:40,097 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 06:10:40,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-09-01 06:10:41,721 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 06:10:42,103 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 06:10:42,106 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-09-01 06:10:42,128 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf77aec5/729ec5f19db04d279604bb5b70d4347c/FLAG4f7726664 [2023-09-01 06:10:42,150 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf77aec5/729ec5f19db04d279604bb5b70d4347c [2023-09-01 06:10:42,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 06:10:42,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 06:10:42,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 06:10:42,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 06:10:42,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 06:10:42,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:42,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36241d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42, skipping insertion in model container [2023-09-01 06:10:42,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:42,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 06:10:42,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 06:10:42,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 06:10:42,719 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 06:10:42,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 06:10:42,906 INFO L208 MainTranslator]: Completed translation [2023-09-01 06:10:42,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42 WrapperNode [2023-09-01 06:10:42,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 06:10:42,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 06:10:42,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 06:10:42,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 06:10:42,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:42,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:42,982 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2023-09-01 06:10:42,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 06:10:42,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 06:10:42,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 06:10:42,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 06:10:42,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:42,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 06:10:43,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 06:10:43,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 06:10:43,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 06:10:43,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (1/1) ... [2023-09-01 06:10:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 06:10:43,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:43,074 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 06:10:43,084 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 06:10:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 06:10:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 06:10:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 06:10:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 06:10:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 06:10:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 06:10:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-09-01 06:10:43,115 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-09-01 06:10:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 06:10:43,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 06:10:43,117 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 06:10:43,351 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 06:10:43,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 06:10:43,602 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 06:10:43,612 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 06:10:43,615 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 06:10:43,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 06:10:43 BoogieIcfgContainer [2023-09-01 06:10:43,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 06:10:43,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 06:10:43,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 06:10:43,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 06:10:43,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 06:10:42" (1/3) ... [2023-09-01 06:10:43,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf91f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 06:10:43, skipping insertion in model container [2023-09-01 06:10:43,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 06:10:42" (2/3) ... [2023-09-01 06:10:43,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf91f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 06:10:43, skipping insertion in model container [2023-09-01 06:10:43,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 06:10:43" (3/3) ... [2023-09-01 06:10:43,627 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-09-01 06:10:43,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 06:10:43,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 06:10:43,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-09-01 06:10:43,645 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 06:10:43,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 06:10:43,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 189 flow [2023-09-01 06:10:43,832 INFO L130 PetriNetUnfolder]: 6/91 cut-off events. [2023-09-01 06:10:43,832 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:43,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 6/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-09-01 06:10:43,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 92 transitions, 189 flow [2023-09-01 06:10:43,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 185 flow [2023-09-01 06:10:43,848 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 06:10:43,862 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 91 transitions, 185 flow [2023-09-01 06:10:43,866 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 91 transitions, 185 flow [2023-09-01 06:10:43,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 185 flow [2023-09-01 06:10:43,906 INFO L130 PetriNetUnfolder]: 6/91 cut-off events. [2023-09-01 06:10:43,906 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:43,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 6/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-09-01 06:10:43,910 INFO L119 LiptonReduction]: Number of co-enabled transitions 2108 [2023-09-01 06:10:45,894 INFO L134 LiptonReduction]: Checked pairs total: 3013 [2023-09-01 06:10:45,895 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-09-01 06:10:45,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 06:10:45,914 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;@67e51c10, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 06:10:45,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-09-01 06:10:45,917 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-09-01 06:10:45,917 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:45,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:45,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-09-01 06:10:45,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:45,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 11425, now seen corresponding path program 1 times [2023-09-01 06:10:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697083697] [2023-09-01 06:10:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:46,124 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 06:10:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:46,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697083697] [2023-09-01 06:10:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697083697] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 06:10:46,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675580016] [2023-09-01 06:10:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:46,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:10:46,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:10:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:10:46,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-09-01 06:10:46,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:46,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-09-01 06:10:46,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:46,267 INFO L130 PetriNetUnfolder]: 102/206 cut-off events. [2023-09-01 06:10:46,267 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 206 events. 102/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 720 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 400. Up to 206 conditions per place. [2023-09-01 06:10:46,270 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-09-01 06:10:46,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 107 flow [2023-09-01 06:10:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:10:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:10:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-09-01 06:10:46,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251396648044693 [2023-09-01 06:10:46,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-09-01 06:10:46,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-09-01 06:10:46,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:46,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-09-01 06:10:46,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,298 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 282 transitions. [2023-09-01 06:10:46,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 107 flow [2023-09-01 06:10:46,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:46,302 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 66 flow [2023-09-01 06:10:46,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2023-09-01 06:10:46,306 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-09-01 06:10:46,307 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 66 flow [2023-09-01 06:10:46,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:46,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 06:10:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 06:10:46,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:46,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 355339, now seen corresponding path program 1 times [2023-09-01 06:10:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888276583] [2023-09-01 06:10:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:46,370 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 06:10:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888276583] [2023-09-01 06:10:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888276583] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135253888] [2023-09-01 06:10:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:46,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:46,375 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 06:10:46,394 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 06:10:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:46,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 06:10:46,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:46,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 06:10:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135253888] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:46,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 06:10:46,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-09-01 06:10:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760814506] [2023-09-01 06:10:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 06:10:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 06:10:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 06:10:46,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-09-01 06:10:46,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:46,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-09-01 06:10:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:46,556 INFO L130 PetriNetUnfolder]: 102/205 cut-off events. [2023-09-01 06:10:46,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:46,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 205 events. 102/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 725 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 410. Up to 204 conditions per place. [2023-09-01 06:10:46,575 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-09-01 06:10:46,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 112 flow [2023-09-01 06:10:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:10:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:10:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-09-01 06:10:46,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505586592178771 [2023-09-01 06:10:46,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-09-01 06:10:46,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-09-01 06:10:46,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:46,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-09-01 06:10:46,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,583 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 66 flow. Second operand 4 states and 362 transitions. [2023-09-01 06:10:46,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 112 flow [2023-09-01 06:10:46,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:46,584 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 62 flow [2023-09-01 06:10:46,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-09-01 06:10:46,595 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-09-01 06:10:46,595 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 62 flow [2023-09-01 06:10:46,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:46,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:46,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:46,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 06:10:46,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:46,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:46,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1784505349, now seen corresponding path program 1 times [2023-09-01 06:10:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:46,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766097] [2023-09-01 06:10:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:46,974 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 06:10:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766097] [2023-09-01 06:10:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766097] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891105521] [2023-09-01 06:10:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:46,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:46,977 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 06:10:46,980 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 06:10:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:47,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 06:10:47,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:47,049 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 06:10:47,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:10:47,077 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 06:10:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891105521] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:10:47,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:10:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 06:10:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44556846] [2023-09-01 06:10:47,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:10:47,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 06:10:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 06:10:47,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-09-01 06:10:47,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-09-01 06:10:47,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:47,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:47,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-09-01 06:10:47,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:47,190 INFO L130 PetriNetUnfolder]: 102/208 cut-off events. [2023-09-01 06:10:47,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 06:10:47,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 208 events. 102/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 719 event pairs, 81 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 419. Up to 205 conditions per place. [2023-09-01 06:10:47,193 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-09-01 06:10:47,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 130 flow [2023-09-01 06:10:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 06:10:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 06:10:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-09-01 06:10:47,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925512104283054 [2023-09-01 06:10:47,197 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-09-01 06:10:47,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-09-01 06:10:47,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:47,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-09-01 06:10:47,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:47,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:47,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:47,203 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 62 flow. Second operand 6 states and 529 transitions. [2023-09-01 06:10:47,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 130 flow [2023-09-01 06:10:47,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 06:10:47,205 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 95 flow [2023-09-01 06:10:47,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-09-01 06:10:47,206 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2023-09-01 06:10:47,206 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 95 flow [2023-09-01 06:10:47,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:47,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:47,207 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:47,219 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 06:10:47,414 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,SelfDestructingSolverStorable2 [2023-09-01 06:10:47,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:47,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -512084965, now seen corresponding path program 2 times [2023-09-01 06:10:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479047601] [2023-09-01 06:10:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479047601] [2023-09-01 06:10:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479047601] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:47,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81884964] [2023-09-01 06:10:47,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:10:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:47,602 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 06:10:47,629 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 06:10:47,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-01 06:10:47,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:10:47,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 06:10:47,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:47,710 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 7 treesize of output 6 [2023-09-01 06:10:47,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:10:47,793 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 13 treesize of output 15 [2023-09-01 06:10:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-01 06:10:47,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 06:10:47,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81884964] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:47,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 06:10:47,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-09-01 06:10:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476789164] [2023-09-01 06:10:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:47,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 06:10:47,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 06:10:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-09-01 06:10:47,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-09-01 06:10:47,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:47,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:47,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-09-01 06:10:47,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:47,997 INFO L130 PetriNetUnfolder]: 136/276 cut-off events. [2023-09-01 06:10:47,997 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 06:10:47,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 276 events. 136/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1082 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 565. Up to 211 conditions per place. [2023-09-01 06:10:47,999 INFO L137 encePairwiseOnDemand]: 173/179 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-09-01 06:10:47,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 227 flow [2023-09-01 06:10:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:10:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:10:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-09-01 06:10:48,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153631284916201 [2023-09-01 06:10:48,001 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-09-01 06:10:48,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-09-01 06:10:48,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:48,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-09-01 06:10:48,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,004 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 95 flow. Second operand 4 states and 369 transitions. [2023-09-01 06:10:48,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 227 flow [2023-09-01 06:10:48,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 213 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:48,006 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 115 flow [2023-09-01 06:10:48,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-09-01 06:10:48,007 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2023-09-01 06:10:48,007 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 115 flow [2023-09-01 06:10:48,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:48,008 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:48,019 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 06:10:48,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:48,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:48,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -512070322, now seen corresponding path program 1 times [2023-09-01 06:10:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185792544] [2023-09-01 06:10:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185792544] [2023-09-01 06:10:48,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185792544] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141159903] [2023-09-01 06:10:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:48,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:48,290 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 06:10:48,323 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 06:10:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 06:10:48,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:48,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:10:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 06:10:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141159903] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:10:48,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:10:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-09-01 06:10:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842103917] [2023-09-01 06:10:48,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:10:48,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 06:10:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 06:10:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-09-01 06:10:48,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-09-01 06:10:48,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 115 flow. Second operand has 13 states, 13 states have (on average 84.38461538461539) internal successors, (1097), 13 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:48,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-09-01 06:10:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:48,595 INFO L130 PetriNetUnfolder]: 136/282 cut-off events. [2023-09-01 06:10:48,595 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-09-01 06:10:48,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 282 events. 136/282 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1097 event pairs, 91 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 671. Up to 273 conditions per place. [2023-09-01 06:10:48,598 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-09-01 06:10:48,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 227 flow [2023-09-01 06:10:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 06:10:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 06:10:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1036 transitions. [2023-09-01 06:10:48,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823091247672253 [2023-09-01 06:10:48,601 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1036 transitions. [2023-09-01 06:10:48,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1036 transitions. [2023-09-01 06:10:48,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:48,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1036 transitions. [2023-09-01 06:10:48,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.33333333333333) internal successors, (1036), 12 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 179.0) internal successors, (2327), 13 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,608 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 179.0) internal successors, (2327), 13 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,608 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 115 flow. Second operand 12 states and 1036 transitions. [2023-09-01 06:10:48,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 227 flow [2023-09-01 06:10:48,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 06:10:48,611 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 199 flow [2023-09-01 06:10:48,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=199, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-09-01 06:10:48,612 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-09-01 06:10:48,612 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 199 flow [2023-09-01 06:10:48,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 84.38461538461539) internal successors, (1097), 13 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:48,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:48,613 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:48,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-01 06:10:48,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:48,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:48,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1904182542, now seen corresponding path program 2 times [2023-09-01 06:10:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347523235] [2023-09-01 06:10:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:49,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:49,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347523235] [2023-09-01 06:10:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347523235] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 06:10:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770090592] [2023-09-01 06:10:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:49,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 06:10:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 06:10:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 06:10:49,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-09-01 06:10:49,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:49,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-09-01 06:10:49,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:49,196 INFO L130 PetriNetUnfolder]: 126/262 cut-off events. [2023-09-01 06:10:49,196 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-09-01 06:10:49,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 262 events. 126/262 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 969 event pairs, 32 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 645. Up to 209 conditions per place. [2023-09-01 06:10:49,199 INFO L137 encePairwiseOnDemand]: 173/179 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-09-01 06:10:49,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 330 flow [2023-09-01 06:10:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:10:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:10:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-09-01 06:10:49,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097765363128491 [2023-09-01 06:10:49,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-09-01 06:10:49,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-09-01 06:10:49,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:49,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-09-01 06:10:49,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,207 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 199 flow. Second operand 4 states and 365 transitions. [2023-09-01 06:10:49,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 330 flow [2023-09-01 06:10:49,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 282 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-09-01 06:10:49,215 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 183 flow [2023-09-01 06:10:49,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-09-01 06:10:49,217 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-09-01 06:10:49,217 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 183 flow [2023-09-01 06:10:49,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:49,218 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:49,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 06:10:49,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:49,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 249274821, now seen corresponding path program 1 times [2023-09-01 06:10:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:49,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787942785] [2023-09-01 06:10:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787942785] [2023-09-01 06:10:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787942785] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:49,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:49,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:10:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957694993] [2023-09-01 06:10:49,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:49,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:10:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:10:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:10:49,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-09-01 06:10:49,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:49,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-09-01 06:10:49,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:49,411 INFO L130 PetriNetUnfolder]: 176/362 cut-off events. [2023-09-01 06:10:49,411 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-09-01 06:10:49,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 362 events. 176/362 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1475 event pairs, 68 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 937. Up to 219 conditions per place. [2023-09-01 06:10:49,414 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-09-01 06:10:49,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 361 flow [2023-09-01 06:10:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:10:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:10:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-09-01 06:10:49,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437616387337058 [2023-09-01 06:10:49,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-09-01 06:10:49,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-09-01 06:10:49,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:49,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-09-01 06:10:49,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,420 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 183 flow. Second operand 3 states and 292 transitions. [2023-09-01 06:10:49,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 361 flow [2023-09-01 06:10:49,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:49,424 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 194 flow [2023-09-01 06:10:49,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-09-01 06:10:49,425 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2023-09-01 06:10:49,425 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 194 flow [2023-09-01 06:10:49,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:49,425 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:49,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 06:10:49,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:49,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash 263361348, now seen corresponding path program 1 times [2023-09-01 06:10:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472310402] [2023-09-01 06:10:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472310402] [2023-09-01 06:10:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472310402] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:10:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434056886] [2023-09-01 06:10:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:49,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:10:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:10:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:10:49,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-09-01 06:10:49,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:49,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-09-01 06:10:49,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:49,664 INFO L130 PetriNetUnfolder]: 238/486 cut-off events. [2023-09-01 06:10:49,665 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2023-09-01 06:10:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 486 events. 238/486 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2002 event pairs, 127 based on Foata normal form. 14/384 useless extension candidates. Maximal degree in co-relation 1349. Up to 333 conditions per place. [2023-09-01 06:10:49,668 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-09-01 06:10:49,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 391 flow [2023-09-01 06:10:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:10:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:10:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-09-01 06:10:49,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493482309124768 [2023-09-01 06:10:49,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-09-01 06:10:49,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-09-01 06:10:49,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:49,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-09-01 06:10:49,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,672 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 194 flow. Second operand 3 states and 295 transitions. [2023-09-01 06:10:49,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 391 flow [2023-09-01 06:10:49,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:49,676 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 208 flow [2023-09-01 06:10:49,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-09-01 06:10:49,677 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 33 predicate places. [2023-09-01 06:10:49,677 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 208 flow [2023-09-01 06:10:49,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:49,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:49,677 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:49,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 06:10:49,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:49,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -964451862, now seen corresponding path program 1 times [2023-09-01 06:10:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483032891] [2023-09-01 06:10:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483032891] [2023-09-01 06:10:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483032891] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:49,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079418938] [2023-09-01 06:10:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:49,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:50,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-09-01 06:10:50,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:50,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:50,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-09-01 06:10:50,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:50,397 INFO L130 PetriNetUnfolder]: 264/550 cut-off events. [2023-09-01 06:10:50,398 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2023-09-01 06:10:50,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 550 events. 264/550 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2412 event pairs, 115 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 1628. Up to 428 conditions per place. [2023-09-01 06:10:50,402 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 57 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2023-09-01 06:10:50,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 502 flow [2023-09-01 06:10:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 880 transitions. [2023-09-01 06:10:50,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44692737430167595 [2023-09-01 06:10:50,406 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 880 transitions. [2023-09-01 06:10:50,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 880 transitions. [2023-09-01 06:10:50,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:50,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 880 transitions. [2023-09-01 06:10:50,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:50,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:50,412 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:50,413 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 208 flow. Second operand 11 states and 880 transitions. [2023-09-01 06:10:50,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 502 flow [2023-09-01 06:10:50,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:10:50,417 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 350 flow [2023-09-01 06:10:50,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=350, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-09-01 06:10:50,418 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 47 predicate places. [2023-09-01 06:10:50,419 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 350 flow [2023-09-01 06:10:50,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:50,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:50,419 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:50,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 06:10:50,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:50,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1213833421, now seen corresponding path program 1 times [2023-09-01 06:10:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659486344] [2023-09-01 06:10:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659486344] [2023-09-01 06:10:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659486344] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:50,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100880168] [2023-09-01 06:10:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:50,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:50,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:50,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:50,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-09-01 06:10:50,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:50,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:50,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-09-01 06:10:50,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:51,141 INFO L130 PetriNetUnfolder]: 285/618 cut-off events. [2023-09-01 06:10:51,142 INFO L131 PetriNetUnfolder]: For 874/874 co-relation queries the response was YES. [2023-09-01 06:10:51,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 618 events. 285/618 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2967 event pairs, 80 based on Foata normal form. 15/524 useless extension candidates. Maximal degree in co-relation 2133. Up to 447 conditions per place. [2023-09-01 06:10:51,147 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 69 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2023-09-01 06:10:51,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 706 flow [2023-09-01 06:10:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-09-01 06:10:51,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45657694261046217 [2023-09-01 06:10:51,150 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-09-01 06:10:51,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-09-01 06:10:51,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:51,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-09-01 06:10:51,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,156 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,156 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 350 flow. Second operand 11 states and 899 transitions. [2023-09-01 06:10:51,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 706 flow [2023-09-01 06:10:51,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 93 transitions, 653 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-09-01 06:10:51,164 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 419 flow [2023-09-01 06:10:51,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=419, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-09-01 06:10:51,166 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 54 predicate places. [2023-09-01 06:10:51,166 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 419 flow [2023-09-01 06:10:51,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:51,167 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:51,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 06:10:51,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:51,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1212049482, now seen corresponding path program 2 times [2023-09-01 06:10:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816616921] [2023-09-01 06:10:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816616921] [2023-09-01 06:10:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816616921] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117882457] [2023-09-01 06:10:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:51,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:51,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-09-01 06:10:51,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:51,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-09-01 06:10:51,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:51,858 INFO L130 PetriNetUnfolder]: 278/604 cut-off events. [2023-09-01 06:10:51,858 INFO L131 PetriNetUnfolder]: For 1154/1154 co-relation queries the response was YES. [2023-09-01 06:10:51,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 604 events. 278/604 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2842 event pairs, 80 based on Foata normal form. 7/503 useless extension candidates. Maximal degree in co-relation 2224. Up to 446 conditions per place. [2023-09-01 06:10:51,864 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 68 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2023-09-01 06:10:51,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 725 flow [2023-09-01 06:10:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 887 transitions. [2023-09-01 06:10:51,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504824784154393 [2023-09-01 06:10:51,867 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 887 transitions. [2023-09-01 06:10:51,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 887 transitions. [2023-09-01 06:10:51,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:51,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 887 transitions. [2023-09-01 06:10:51,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.63636363636364) internal successors, (887), 11 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,893 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,893 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 419 flow. Second operand 11 states and 887 transitions. [2023-09-01 06:10:51,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 725 flow [2023-09-01 06:10:51,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 684 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-09-01 06:10:51,899 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 416 flow [2023-09-01 06:10:51,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-09-01 06:10:51,900 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 57 predicate places. [2023-09-01 06:10:51,900 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 416 flow [2023-09-01 06:10:51,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:51,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:51,900 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:51,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 06:10:51,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:51,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471901, now seen corresponding path program 1 times [2023-09-01 06:10:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115622797] [2023-09-01 06:10:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:52,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115622797] [2023-09-01 06:10:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115622797] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:52,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:52,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829453300] [2023-09-01 06:10:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:52,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:52,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-09-01 06:10:52,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 416 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:52,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:52,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-09-01 06:10:52,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:52,583 INFO L130 PetriNetUnfolder]: 303/667 cut-off events. [2023-09-01 06:10:52,583 INFO L131 PetriNetUnfolder]: For 1320/1320 co-relation queries the response was YES. [2023-09-01 06:10:52,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 667 events. 303/667 cut-off events. For 1320/1320 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3331 event pairs, 118 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 2512. Up to 532 conditions per place. [2023-09-01 06:10:52,589 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 69 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2023-09-01 06:10:52,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 835 flow [2023-09-01 06:10:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 06:10:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 06:10:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 661 transitions. [2023-09-01 06:10:52,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4615921787709497 [2023-09-01 06:10:52,592 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 661 transitions. [2023-09-01 06:10:52,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 661 transitions. [2023-09-01 06:10:52,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:52,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 661 transitions. [2023-09-01 06:10:52,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:52,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:52,596 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:52,596 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 416 flow. Second operand 8 states and 661 transitions. [2023-09-01 06:10:52,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 835 flow [2023-09-01 06:10:52,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 782 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-09-01 06:10:52,605 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 601 flow [2023-09-01 06:10:52,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=601, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2023-09-01 06:10:52,607 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 60 predicate places. [2023-09-01 06:10:52,607 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 601 flow [2023-09-01 06:10:52,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:52,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:52,608 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:52,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 06:10:52,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:52,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471918, now seen corresponding path program 1 times [2023-09-01 06:10:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853815436] [2023-09-01 06:10:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853815436] [2023-09-01 06:10:52,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853815436] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:52,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:52,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454493332] [2023-09-01 06:10:52,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:52,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:52,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:52,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:52,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:52,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-09-01 06:10:52,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:52,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:52,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-09-01 06:10:52,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:53,234 INFO L130 PetriNetUnfolder]: 296/678 cut-off events. [2023-09-01 06:10:53,234 INFO L131 PetriNetUnfolder]: For 1928/1928 co-relation queries the response was YES. [2023-09-01 06:10:53,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 678 events. 296/678 cut-off events. For 1928/1928 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3536 event pairs, 116 based on Foata normal form. 7/605 useless extension candidates. Maximal degree in co-relation 2867. Up to 551 conditions per place. [2023-09-01 06:10:53,241 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 72 selfloop transitions, 30 changer transitions 0/102 dead transitions. [2023-09-01 06:10:53,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 971 flow [2023-09-01 06:10:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 06:10:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 06:10:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2023-09-01 06:10:53,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45313469894475483 [2023-09-01 06:10:53,244 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2023-09-01 06:10:53,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2023-09-01 06:10:53,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:53,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2023-09-01 06:10:53,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.11111111111111) internal successors, (730), 9 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:53,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:53,249 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:53,249 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 601 flow. Second operand 9 states and 730 transitions. [2023-09-01 06:10:53,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 971 flow [2023-09-01 06:10:53,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 933 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-09-01 06:10:53,262 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 696 flow [2023-09-01 06:10:53,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=696, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2023-09-01 06:10:53,263 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 68 predicate places. [2023-09-01 06:10:53,264 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 696 flow [2023-09-01 06:10:53,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:53,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:53,264 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:53,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 06:10:53,265 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:53,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1204754528, now seen corresponding path program 2 times [2023-09-01 06:10:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014235944] [2023-09-01 06:10:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014235944] [2023-09-01 06:10:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014235944] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:53,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298608727] [2023-09-01 06:10:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:53,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:53,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:53,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-09-01 06:10:53,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 696 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:53,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:53,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-09-01 06:10:53,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:53,994 INFO L130 PetriNetUnfolder]: 322/723 cut-off events. [2023-09-01 06:10:53,994 INFO L131 PetriNetUnfolder]: For 2624/2624 co-relation queries the response was YES. [2023-09-01 06:10:53,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 723 events. 322/723 cut-off events. For 2624/2624 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3760 event pairs, 126 based on Foata normal form. 8/651 useless extension candidates. Maximal degree in co-relation 3217. Up to 560 conditions per place. [2023-09-01 06:10:54,001 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 73 selfloop transitions, 42 changer transitions 0/115 dead transitions. [2023-09-01 06:10:54,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 115 transitions, 1179 flow [2023-09-01 06:10:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 880 transitions. [2023-09-01 06:10:54,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44692737430167595 [2023-09-01 06:10:54,006 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 880 transitions. [2023-09-01 06:10:54,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 880 transitions. [2023-09-01 06:10:54,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:54,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 880 transitions. [2023-09-01 06:10:54,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,012 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,012 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 696 flow. Second operand 11 states and 880 transitions. [2023-09-01 06:10:54,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 115 transitions, 1179 flow [2023-09-01 06:10:54,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 1137 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-09-01 06:10:54,022 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 953 flow [2023-09-01 06:10:54,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=953, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2023-09-01 06:10:54,023 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2023-09-01 06:10:54,023 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 953 flow [2023-09-01 06:10:54,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:54,024 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:54,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 06:10:54,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:54,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1204322061, now seen corresponding path program 2 times [2023-09-01 06:10:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599877556] [2023-09-01 06:10:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599877556] [2023-09-01 06:10:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599877556] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631615896] [2023-09-01 06:10:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:54,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:54,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:54,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-09-01 06:10:54,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 953 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:54,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-09-01 06:10:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:54,754 INFO L130 PetriNetUnfolder]: 333/746 cut-off events. [2023-09-01 06:10:54,754 INFO L131 PetriNetUnfolder]: For 4266/4266 co-relation queries the response was YES. [2023-09-01 06:10:54,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 746 events. 333/746 cut-off events. For 4266/4266 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3921 event pairs, 127 based on Foata normal form. 7/673 useless extension candidates. Maximal degree in co-relation 3747. Up to 619 conditions per place. [2023-09-01 06:10:54,762 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 85 selfloop transitions, 34 changer transitions 0/119 dead transitions. [2023-09-01 06:10:54,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 119 transitions, 1377 flow [2023-09-01 06:10:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 06:10:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 06:10:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2023-09-01 06:10:54,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547486033519553 [2023-09-01 06:10:54,766 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2023-09-01 06:10:54,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2023-09-01 06:10:54,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:54,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2023-09-01 06:10:54,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,771 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,771 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 953 flow. Second operand 10 states and 814 transitions. [2023-09-01 06:10:54,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 119 transitions, 1377 flow [2023-09-01 06:10:54,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 1358 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-09-01 06:10:54,788 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 1106 flow [2023-09-01 06:10:54,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1106, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2023-09-01 06:10:54,789 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 86 predicate places. [2023-09-01 06:10:54,789 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 1106 flow [2023-09-01 06:10:54,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:54,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:54,790 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:54,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 06:10:54,790 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:54,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804731, now seen corresponding path program 3 times [2023-09-01 06:10:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:54,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79363944] [2023-09-01 06:10:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:55,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79363944] [2023-09-01 06:10:55,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79363944] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:55,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:55,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877461610] [2023-09-01 06:10:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:55,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:55,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:55,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-09-01 06:10:55,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 1106 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:55,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:55,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-09-01 06:10:55,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:55,467 INFO L130 PetriNetUnfolder]: 355/796 cut-off events. [2023-09-01 06:10:55,467 INFO L131 PetriNetUnfolder]: For 5418/5418 co-relation queries the response was YES. [2023-09-01 06:10:55,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 796 events. 355/796 cut-off events. For 5418/5418 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4292 event pairs, 114 based on Foata normal form. 14/730 useless extension candidates. Maximal degree in co-relation 4097. Up to 568 conditions per place. [2023-09-01 06:10:55,476 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 85 selfloop transitions, 53 changer transitions 0/138 dead transitions. [2023-09-01 06:10:55,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 1666 flow [2023-09-01 06:10:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-09-01 06:10:55,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45657694261046217 [2023-09-01 06:10:55,479 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-09-01 06:10:55,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-09-01 06:10:55,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:55,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-09-01 06:10:55,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:55,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:55,485 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:55,486 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 1106 flow. Second operand 11 states and 899 transitions. [2023-09-01 06:10:55,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 1666 flow [2023-09-01 06:10:55,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 138 transitions, 1520 flow, removed 22 selfloop flow, removed 9 redundant places. [2023-09-01 06:10:55,506 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 1227 flow [2023-09-01 06:10:55,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1227, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2023-09-01 06:10:55,507 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2023-09-01 06:10:55,507 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 1227 flow [2023-09-01 06:10:55,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:55,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:55,508 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:55,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 06:10:55,508 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:55,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804748, now seen corresponding path program 3 times [2023-09-01 06:10:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642977642] [2023-09-01 06:10:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:55,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642977642] [2023-09-01 06:10:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642977642] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:10:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:10:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 06:10:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462697883] [2023-09-01 06:10:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:10:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 06:10:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:10:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 06:10:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-09-01 06:10:55,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-09-01 06:10:55,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 1227 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:55,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:10:55,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-09-01 06:10:55,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:10:56,181 INFO L130 PetriNetUnfolder]: 348/782 cut-off events. [2023-09-01 06:10:56,181 INFO L131 PetriNetUnfolder]: For 5635/5635 co-relation queries the response was YES. [2023-09-01 06:10:56,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 782 events. 348/782 cut-off events. For 5635/5635 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4146 event pairs, 114 based on Foata normal form. 7/709 useless extension candidates. Maximal degree in co-relation 4160. Up to 567 conditions per place. [2023-09-01 06:10:56,191 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 84 selfloop transitions, 52 changer transitions 0/136 dead transitions. [2023-09-01 06:10:56,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 1671 flow [2023-09-01 06:10:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:10:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:10:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 887 transitions. [2023-09-01 06:10:56,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504824784154393 [2023-09-01 06:10:56,193 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 887 transitions. [2023-09-01 06:10:56,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 887 transitions. [2023-09-01 06:10:56,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:10:56,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 887 transitions. [2023-09-01 06:10:56,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.63636363636364) internal successors, (887), 11 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:56,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:56,198 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:56,198 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 1227 flow. Second operand 11 states and 887 transitions. [2023-09-01 06:10:56,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 1671 flow [2023-09-01 06:10:56,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 1588 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-09-01 06:10:56,214 INFO L231 Difference]: Finished difference. Result has 120 places, 105 transitions, 1216 flow [2023-09-01 06:10:56,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1216, PETRI_PLACES=120, PETRI_TRANSITIONS=105} [2023-09-01 06:10:56,215 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 93 predicate places. [2023-09-01 06:10:56,215 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 105 transitions, 1216 flow [2023-09-01 06:10:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:10:56,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:10:56,216 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:10:56,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 06:10:56,216 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:10:56,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:10:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash -965041958, now seen corresponding path program 1 times [2023-09-01 06:10:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:10:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198830396] [2023-09-01 06:10:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:10:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:10:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:10:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198830396] [2023-09-01 06:10:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198830396] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:10:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929313581] [2023-09-01 06:10:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:10:56,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:10:56,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:10:56,437 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 06:10:56,440 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 06:10:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:10:56,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-09-01 06:10:56,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:10:56,541 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 7 treesize of output 6 [2023-09-01 06:10:56,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:10:56,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-09-01 06:10:56,652 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 18 treesize of output 13 [2023-09-01 06:11:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:02,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:11:06,593 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_530 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_36| Int) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_36| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_36| v_ArrVal_529) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| v_ArrVal_530) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647))) is different from false [2023-09-01 06:11:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929313581] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:11:06,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:11:06,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-09-01 06:11:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664750494] [2023-09-01 06:11:06,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:11:06,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-01 06:11:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:11:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-01 06:11:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=216, Unknown=7, NotChecked=32, Total=342 [2023-09-01 06:11:06,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 179 [2023-09-01 06:11:06,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 105 transitions, 1216 flow. Second operand has 19 states, 19 states have (on average 66.63157894736842) internal successors, (1266), 19 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:11:06,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:11:06,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 179 [2023-09-01 06:11:06,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:11:07,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:09,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:10,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:11,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:12,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:13,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:15,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:16,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:21,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:22,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:23,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:24,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:25,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:27,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:28,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:29,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:31,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:32,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:35,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:11:37,253 INFO L130 PetriNetUnfolder]: 330/743 cut-off events. [2023-09-01 06:11:37,254 INFO L131 PetriNetUnfolder]: For 5463/5463 co-relation queries the response was YES. [2023-09-01 06:11:37,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 743 events. 330/743 cut-off events. For 5463/5463 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3786 event pairs, 71 based on Foata normal form. 20/683 useless extension candidates. Maximal degree in co-relation 3919. Up to 496 conditions per place. [2023-09-01 06:11:37,264 INFO L137 encePairwiseOnDemand]: 172/179 looper letters, 113 selfloop transitions, 44 changer transitions 0/157 dead transitions. [2023-09-01 06:11:37,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 157 transitions, 1903 flow [2023-09-01 06:11:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 06:11:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 06:11:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 805 transitions. [2023-09-01 06:11:37,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40883697308278316 [2023-09-01 06:11:37,267 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 805 transitions. [2023-09-01 06:11:37,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 805 transitions. [2023-09-01 06:11:37,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:11:37,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 805 transitions. [2023-09-01 06:11:37,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.18181818181819) internal successors, (805), 11 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:11:37,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:11:37,285 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:11:37,285 INFO L175 Difference]: Start difference. First operand has 120 places, 105 transitions, 1216 flow. Second operand 11 states and 805 transitions. [2023-09-01 06:11:37,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 157 transitions, 1903 flow [2023-09-01 06:11:37,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 157 transitions, 1805 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-09-01 06:11:37,307 INFO L231 Difference]: Finished difference. Result has 127 places, 117 transitions, 1400 flow [2023-09-01 06:11:37,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1400, PETRI_PLACES=127, PETRI_TRANSITIONS=117} [2023-09-01 06:11:37,308 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 100 predicate places. [2023-09-01 06:11:37,308 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 117 transitions, 1400 flow [2023-09-01 06:11:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 66.63157894736842) internal successors, (1266), 19 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:11:37,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:11:37,309 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:11:37,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 06:11:37,514 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,SelfDestructingSolverStorable17 [2023-09-01 06:11:37,514 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:11:37,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:11:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -312793093, now seen corresponding path program 1 times [2023-09-01 06:11:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:11:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077110386] [2023-09-01 06:11:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:37,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:11:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:11:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077110386] [2023-09-01 06:11:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077110386] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:11:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118686353] [2023-09-01 06:11:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:11:37,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:11:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:11:37,863 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 06:11:37,897 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 06:11:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:11:37,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-09-01 06:11:37,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:11:37,986 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 7 treesize of output 6 [2023-09-01 06:11:38,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:11:38,059 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 13 treesize of output 15 [2023-09-01 06:11:38,113 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 18 treesize of output 13 [2023-09-01 06:11:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:42,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:11:46,422 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_37| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_37| v_ArrVal_599) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_600) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2023-09-01 06:11:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:11:46,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118686353] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:11:46,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:11:46,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-09-01 06:11:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131563049] [2023-09-01 06:11:46,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:11:46,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-09-01 06:11:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:11:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-09-01 06:11:46,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=238, Unknown=7, NotChecked=34, Total=380 [2023-09-01 06:11:47,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:11:49,933 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 06:11:51,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 [1] [2023-09-01 06:11:53,953 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 06:11:55,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:11:57,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 06:11:59,979 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 06:12:01,985 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 06:12:03,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:12:06,013 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 06:12:08,031 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 06:12:10,039 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 06:12:12,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:12:14,062 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 06:12:16,076 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 06:12:18,091 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 06:12:20,106 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 06:12:22,110 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 06:12:24,130 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 06:12:26,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:12:28,142 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 06:12:30,147 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 06:12:30,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 179 [2023-09-01 06:12:30,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 117 transitions, 1400 flow. Second operand has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:12:30,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:12:30,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 179 [2023-09-01 06:12:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:12:31,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:32,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:33,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:34,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:35,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:36,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:38,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:39,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:40,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:43,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:44,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:45,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:46,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:47,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:50,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:51,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:52,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:57,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:58,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:12:59,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:13:02,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:13:06,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-09-01 06:13:07,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:13:09,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:13:12,423 INFO L130 PetriNetUnfolder]: 331/742 cut-off events. [2023-09-01 06:13:12,424 INFO L131 PetriNetUnfolder]: For 6633/6633 co-relation queries the response was YES. [2023-09-01 06:13:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 742 events. 331/742 cut-off events. For 6633/6633 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3812 event pairs, 66 based on Foata normal form. 28/708 useless extension candidates. Maximal degree in co-relation 4246. Up to 410 conditions per place. [2023-09-01 06:13:12,438 INFO L137 encePairwiseOnDemand]: 168/179 looper letters, 126 selfloop transitions, 86 changer transitions 0/212 dead transitions. [2023-09-01 06:13:12,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 212 transitions, 2822 flow [2023-09-01 06:13:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-09-01 06:13:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-09-01 06:13:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1014 transitions. [2023-09-01 06:13:12,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776536312849162 [2023-09-01 06:13:12,441 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1014 transitions. [2023-09-01 06:13:12,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1014 transitions. [2023-09-01 06:13:12,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:12,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1014 transitions. [2023-09-01 06:13:12,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 67.6) internal successors, (1014), 15 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:12,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:12,446 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:12,446 INFO L175 Difference]: Start difference. First operand has 127 places, 117 transitions, 1400 flow. Second operand 15 states and 1014 transitions. [2023-09-01 06:13:12,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 212 transitions, 2822 flow [2023-09-01 06:13:12,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 212 transitions, 2643 flow, removed 71 selfloop flow, removed 3 redundant places. [2023-09-01 06:13:12,487 INFO L231 Difference]: Finished difference. Result has 145 places, 149 transitions, 2022 flow [2023-09-01 06:13:12,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2022, PETRI_PLACES=145, PETRI_TRANSITIONS=149} [2023-09-01 06:13:12,488 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 118 predicate places. [2023-09-01 06:13:12,488 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 149 transitions, 2022 flow [2023-09-01 06:13:12,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:12,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:12,489 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:12,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 06:13:12,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:12,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:13:12,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 307606274, now seen corresponding path program 1 times [2023-09-01 06:13:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2841756] [2023-09-01 06:13:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2841756] [2023-09-01 06:13:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2841756] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:13:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513373254] [2023-09-01 06:13:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:12,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:13:12,753 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 06:13:12,757 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 06:13:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:12,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 06:13:12,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:13:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:12,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 06:13:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513373254] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 06:13:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-09-01 06:13:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576052246] [2023-09-01 06:13:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:12,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 06:13:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:12,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 06:13:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 06:13:12,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-09-01 06:13:12,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 149 transitions, 2022 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:12,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:12,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-09-01 06:13:12,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:13,055 INFO L130 PetriNetUnfolder]: 313/702 cut-off events. [2023-09-01 06:13:13,055 INFO L131 PetriNetUnfolder]: For 6902/6902 co-relation queries the response was YES. [2023-09-01 06:13:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 702 events. 313/702 cut-off events. For 6902/6902 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3506 event pairs, 83 based on Foata normal form. 0/683 useless extension candidates. Maximal degree in co-relation 4406. Up to 401 conditions per place. [2023-09-01 06:13:13,065 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 175 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2023-09-01 06:13:13,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 180 transitions, 2695 flow [2023-09-01 06:13:13,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 06:13:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 06:13:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2023-09-01 06:13:13,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321229050279329 [2023-09-01 06:13:13,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 381 transitions. [2023-09-01 06:13:13,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 381 transitions. [2023-09-01 06:13:13,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:13,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 381 transitions. [2023-09-01 06:13:13,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,069 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,069 INFO L175 Difference]: Start difference. First operand has 145 places, 149 transitions, 2022 flow. Second operand 4 states and 381 transitions. [2023-09-01 06:13:13,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 180 transitions, 2695 flow [2023-09-01 06:13:13,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 2589 flow, removed 38 selfloop flow, removed 4 redundant places. [2023-09-01 06:13:13,099 INFO L231 Difference]: Finished difference. Result has 143 places, 148 transitions, 1956 flow [2023-09-01 06:13:13,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1956, PETRI_PLACES=143, PETRI_TRANSITIONS=148} [2023-09-01 06:13:13,100 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 116 predicate places. [2023-09-01 06:13:13,100 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 148 transitions, 1956 flow [2023-09-01 06:13:13,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:13,100 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:13,107 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 06:13:13,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:13,307 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:13:13,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash 307606276, now seen corresponding path program 1 times [2023-09-01 06:13:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550483813] [2023-09-01 06:13:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-09-01 06:13:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550483813] [2023-09-01 06:13:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550483813] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:13,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:13:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:13:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623704795] [2023-09-01 06:13:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:13,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:13:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:13:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:13:13,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 179 [2023-09-01 06:13:13,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 148 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:13,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 179 [2023-09-01 06:13:13,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:13,500 INFO L130 PetriNetUnfolder]: 295/662 cut-off events. [2023-09-01 06:13:13,500 INFO L131 PetriNetUnfolder]: For 6052/6052 co-relation queries the response was YES. [2023-09-01 06:13:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4117 conditions, 662 events. 295/662 cut-off events. For 6052/6052 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3243 event pairs, 75 based on Foata normal form. 22/666 useless extension candidates. Maximal degree in co-relation 4051. Up to 508 conditions per place. [2023-09-01 06:13:13,515 INFO L137 encePairwiseOnDemand]: 175/179 looper letters, 162 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2023-09-01 06:13:13,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 172 transitions, 2517 flow [2023-09-01 06:13:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-09-01 06:13:13,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521415270018622 [2023-09-01 06:13:13,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-09-01 06:13:13,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-09-01 06:13:13,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:13,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-09-01 06:13:13,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,518 INFO L175 Difference]: Start difference. First operand has 143 places, 148 transitions, 1956 flow. Second operand 3 states and 280 transitions. [2023-09-01 06:13:13,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 172 transitions, 2517 flow [2023-09-01 06:13:13,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 172 transitions, 2508 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 06:13:13,545 INFO L231 Difference]: Finished difference. Result has 143 places, 148 transitions, 1981 flow [2023-09-01 06:13:13,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1981, PETRI_PLACES=143, PETRI_TRANSITIONS=148} [2023-09-01 06:13:13,546 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 116 predicate places. [2023-09-01 06:13:13,546 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 148 transitions, 1981 flow [2023-09-01 06:13:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:13,546 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-09-01 06:13:13,547 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:13:13,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 53554929, now seen corresponding path program 1 times [2023-09-01 06:13:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996575978] [2023-09-01 06:13:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996575978] [2023-09-01 06:13:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996575978] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:13,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:13:13,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:13:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874188731] [2023-09-01 06:13:13,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:13,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:13:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:13,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:13:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:13:13,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-09-01 06:13:13,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 148 transitions, 1981 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:13,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-09-01 06:13:13,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:13,724 INFO L130 PetriNetUnfolder]: 281/630 cut-off events. [2023-09-01 06:13:13,724 INFO L131 PetriNetUnfolder]: For 5942/5942 co-relation queries the response was YES. [2023-09-01 06:13:13,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4080 conditions, 630 events. 281/630 cut-off events. For 5942/5942 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2991 event pairs, 69 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 4014. Up to 601 conditions per place. [2023-09-01 06:13:13,732 INFO L137 encePairwiseOnDemand]: 177/179 looper letters, 159 selfloop transitions, 1 changer transitions 0/160 dead transitions. [2023-09-01 06:13:13,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 160 transitions, 2426 flow [2023-09-01 06:13:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-09-01 06:13:13,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232774674115456 [2023-09-01 06:13:13,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-09-01 06:13:13,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-09-01 06:13:13,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:13,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-09-01 06:13:13,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,737 INFO L175 Difference]: Start difference. First operand has 143 places, 148 transitions, 1981 flow. Second operand 3 states and 281 transitions. [2023-09-01 06:13:13,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 160 transitions, 2426 flow [2023-09-01 06:13:13,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 160 transitions, 2411 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:13,763 INFO L231 Difference]: Finished difference. Result has 143 places, 147 transitions, 1969 flow [2023-09-01 06:13:13,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1969, PETRI_PLACES=143, PETRI_TRANSITIONS=147} [2023-09-01 06:13:13,764 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 116 predicate places. [2023-09-01 06:13:13,764 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 147 transitions, 1969 flow [2023-09-01 06:13:13,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:13,765 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:13,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-09-01 06:13:13,765 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:13:13,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash 53554928, now seen corresponding path program 1 times [2023-09-01 06:13:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:13,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338572616] [2023-09-01 06:13:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-09-01 06:13:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338572616] [2023-09-01 06:13:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338572616] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 06:13:13,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 06:13:13,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 06:13:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629874638] [2023-09-01 06:13:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 06:13:13,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 06:13:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:13,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 06:13:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 06:13:13,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-09-01 06:13:13,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 147 transitions, 1969 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:13,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-09-01 06:13:13,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:13,933 INFO L130 PetriNetUnfolder]: 267/598 cut-off events. [2023-09-01 06:13:13,933 INFO L131 PetriNetUnfolder]: For 5513/5513 co-relation queries the response was YES. [2023-09-01 06:13:13,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 598 events. 267/598 cut-off events. For 5513/5513 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2808 event pairs, 53 based on Foata normal form. 18/616 useless extension candidates. Maximal degree in co-relation 3832. Up to 456 conditions per place. [2023-09-01 06:13:13,940 INFO L137 encePairwiseOnDemand]: 175/179 looper letters, 156 selfloop transitions, 12 changer transitions 0/168 dead transitions. [2023-09-01 06:13:13,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 168 transitions, 2530 flow [2023-09-01 06:13:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 06:13:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 06:13:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-09-01 06:13:13,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195530726256983 [2023-09-01 06:13:13,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-09-01 06:13:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-09-01 06:13:13,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:13,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-09-01 06:13:13,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,943 INFO L175 Difference]: Start difference. First operand has 143 places, 147 transitions, 1969 flow. Second operand 3 states and 279 transitions. [2023-09-01 06:13:13,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 168 transitions, 2530 flow [2023-09-01 06:13:13,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 168 transitions, 2527 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:13,968 INFO L231 Difference]: Finished difference. Result has 144 places, 147 transitions, 2006 flow [2023-09-01 06:13:13,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2006, PETRI_PLACES=144, PETRI_TRANSITIONS=147} [2023-09-01 06:13:13,969 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 117 predicate places. [2023-09-01 06:13:13,969 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 147 transitions, 2006 flow [2023-09-01 06:13:13,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:13,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:13,969 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:13,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-09-01 06:13:13,970 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:13:13,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash -740167841, now seen corresponding path program 1 times [2023-09-01 06:13:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920723687] [2023-09-01 06:13:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920723687] [2023-09-01 06:13:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920723687] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:13:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708009164] [2023-09-01 06:13:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:14,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:14,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:13:14,333 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 06:13:14,359 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 06:13:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:14,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:13:14,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:13:14,460 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 7 treesize of output 6 [2023-09-01 06:13:14,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:13:14,562 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 13 treesize of output 15 [2023-09-01 06:13:14,664 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 18 treesize of output 13 [2023-09-01 06:13:14,835 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 21 treesize of output 16 [2023-09-01 06:13:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:14,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:13:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708009164] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:13:17,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:13:17,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-09-01 06:13:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160510553] [2023-09-01 06:13:17,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:13:17,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 06:13:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:17,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 06:13:17,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=731, Unknown=4, NotChecked=0, Total=870 [2023-09-01 06:13:18,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-09-01 06:13:18,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 147 transitions, 2006 flow. Second operand has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:18,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:18,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-09-01 06:13:18,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:19,432 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_863 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_865 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_863)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_863 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_863) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_38| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_862) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-09-01 06:13:22,306 INFO L130 PetriNetUnfolder]: 420/912 cut-off events. [2023-09-01 06:13:22,306 INFO L131 PetriNetUnfolder]: For 12300/12300 co-relation queries the response was YES. [2023-09-01 06:13:22,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6219 conditions, 912 events. 420/912 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4855 event pairs, 31 based on Foata normal form. 50/962 useless extension candidates. Maximal degree in co-relation 6152. Up to 466 conditions per place. [2023-09-01 06:13:22,314 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 179 selfloop transitions, 185 changer transitions 0/364 dead transitions. [2023-09-01 06:13:22,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 364 transitions, 5407 flow [2023-09-01 06:13:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-09-01 06:13:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-09-01 06:13:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2126 transitions. [2023-09-01 06:13:22,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30454089671966766 [2023-09-01 06:13:22,321 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2126 transitions. [2023-09-01 06:13:22,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2126 transitions. [2023-09-01 06:13:22,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:13:22,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2126 transitions. [2023-09-01 06:13:22,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 54.51282051282051) internal successors, (2126), 39 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:22,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 179.0) internal successors, (7160), 40 states have internal predecessors, (7160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:22,331 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 179.0) internal successors, (7160), 40 states have internal predecessors, (7160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:22,331 INFO L175 Difference]: Start difference. First operand has 144 places, 147 transitions, 2006 flow. Second operand 39 states and 2126 transitions. [2023-09-01 06:13:22,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 364 transitions, 5407 flow [2023-09-01 06:13:22,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 364 transitions, 5362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 06:13:22,372 INFO L231 Difference]: Finished difference. Result has 209 places, 277 transitions, 4734 flow [2023-09-01 06:13:22,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=4734, PETRI_PLACES=209, PETRI_TRANSITIONS=277} [2023-09-01 06:13:22,372 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 182 predicate places. [2023-09-01 06:13:22,372 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 277 transitions, 4734 flow [2023-09-01 06:13:22,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:22,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:13:22,373 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:13:22,380 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 06:13:22,579 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,SelfDestructingSolverStorable23 [2023-09-01 06:13:22,579 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:13:22,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:13:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1296386063, now seen corresponding path program 2 times [2023-09-01 06:13:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:13:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127533103] [2023-09-01 06:13:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:13:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:13:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:13:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:13:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127533103] [2023-09-01 06:13:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127533103] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:13:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190733594] [2023-09-01 06:13:22,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:13:22,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:13:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:13:22,993 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 06:13:22,996 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 06:13:23,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 06:13:23,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:13:23,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:13:23,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:13:23,118 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 7 treesize of output 6 [2023-09-01 06:13:23,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:13:23,198 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 13 treesize of output 15 [2023-09-01 06:13:23,336 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 18 treesize of output 13 [2023-09-01 06:13:23,495 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 21 treesize of output 16 [2023-09-01 06:13:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:23,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:13:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:13:24,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190733594] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:13:24,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:13:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-09-01 06:13:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995784890] [2023-09-01 06:13:24,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:13:24,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-09-01 06:13:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:13:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-09-01 06:13:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=736, Unknown=14, NotChecked=0, Total=870 [2023-09-01 06:13:26,759 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 06:13:27,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-09-01 06:13:27,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 277 transitions, 4734 flow. Second operand has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:13:27,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:13:27,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-09-01 06:13:27,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:13:32,668 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse2 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse2 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)))) (= ((as const (Array Int Int)) 0) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2023-09-01 06:13:35,664 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((as const (Array Int Int)) 0)) (.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store .cse2 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= .cse2 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-09-01 06:13:38,105 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-09-01 06:13:40,814 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-09-01 06:13:41,138 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (+ .cse0 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse4))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_945)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse4)))))) is different from false [2023-09-01 06:13:43,917 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_945)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-09-01 06:13:44,239 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse2 (@diff .cse1 .cse0)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store .cse0 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse5 |c_~#cache~0.offset|))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse5 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))))) is different from false [2023-09-01 06:13:45,337 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (< 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483650)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-09-01 06:13:45,802 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse2 (@diff .cse1 .cse0)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse9 (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store .cse0 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse5 |c_~#cache~0.offset|))) (or (and .cse6 (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse7) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse5 28 |c_~#cache~0.offset|)))) (<= 0 (+ (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) .cse9 (or (and .cse6 .cse9) (not .cse7))))) is different from false [2023-09-01 06:13:49,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:13:53,955 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 06:13:55,970 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 06:14:00,035 INFO L130 PetriNetUnfolder]: 1190/2542 cut-off events. [2023-09-01 06:14:00,035 INFO L131 PetriNetUnfolder]: For 76116/76116 co-relation queries the response was YES. [2023-09-01 06:14:00,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21465 conditions, 2542 events. 1190/2542 cut-off events. For 76116/76116 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17623 event pairs, 84 based on Foata normal form. 112/2654 useless extension candidates. Maximal degree in co-relation 21368. Up to 894 conditions per place. [2023-09-01 06:14:00,067 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 474 selfloop transitions, 717 changer transitions 0/1191 dead transitions. [2023-09-01 06:14:00,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1191 transitions, 21229 flow [2023-09-01 06:14:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-09-01 06:14:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2023-09-01 06:14:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 6445 transitions. [2023-09-01 06:14:00,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3000465549348231 [2023-09-01 06:14:00,089 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 6445 transitions. [2023-09-01 06:14:00,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 6445 transitions. [2023-09-01 06:14:00,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:14:00,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 6445 transitions. [2023-09-01 06:14:00,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 121 states, 120 states have (on average 53.708333333333336) internal successors, (6445), 120 states have internal predecessors, (6445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:00,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 121 states, 121 states have (on average 179.0) internal successors, (21659), 121 states have internal predecessors, (21659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:00,125 INFO L81 ComplementDD]: Finished complementDD. Result has 121 states, 121 states have (on average 179.0) internal successors, (21659), 121 states have internal predecessors, (21659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:00,125 INFO L175 Difference]: Start difference. First operand has 209 places, 277 transitions, 4734 flow. Second operand 120 states and 6445 transitions. [2023-09-01 06:14:00,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 1191 transitions, 21229 flow [2023-09-01 06:14:00,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1191 transitions, 19268 flow, removed 900 selfloop flow, removed 5 redundant places. [2023-09-01 06:14:00,338 INFO L231 Difference]: Finished difference. Result has 395 places, 961 transitions, 17765 flow [2023-09-01 06:14:00,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=4142, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=17765, PETRI_PLACES=395, PETRI_TRANSITIONS=961} [2023-09-01 06:14:00,339 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 368 predicate places. [2023-09-01 06:14:00,339 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 961 transitions, 17765 flow [2023-09-01 06:14:00,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:00,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:14:00,339 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:14:00,345 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 06:14:00,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-09-01 06:14:00,540 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:14:00,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:14:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1237794514, now seen corresponding path program 1 times [2023-09-01 06:14:00,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:14:00,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223986806] [2023-09-01 06:14:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:14:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:14:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:14:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:14:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:14:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223986806] [2023-09-01 06:14:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223986806] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:14:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895440260] [2023-09-01 06:14:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:14:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:14:01,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:14:01,013 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 06:14:01,018 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 06:14:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:14:01,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:14:01,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:14:01,158 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 7 treesize of output 6 [2023-09-01 06:14:01,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:14:01,246 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 13 treesize of output 15 [2023-09-01 06:14:01,429 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 18 treesize of output 13 [2023-09-01 06:14:01,486 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 21 treesize of output 16 [2023-09-01 06:14:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:14:01,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:14:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:14:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895440260] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:14:06,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:14:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-09-01 06:14:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598396511] [2023-09-01 06:14:06,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:14:06,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-09-01 06:14:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:14:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-09-01 06:14:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=774, Unknown=2, NotChecked=0, Total=992 [2023-09-01 06:14:06,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-09-01 06:14:06,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 961 transitions, 17765 flow. Second operand has 32 states, 32 states have (on average 56.40625) internal successors, (1805), 32 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:06,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:14:06,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-09-01 06:14:06,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:14:08,235 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1026 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1026) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1026 Int) (v_ArrVal_1022 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_1022) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1026) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-09-01 06:14:09,025 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1026 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1026) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1023 Int) (v_ArrVal_1026 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1023)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1026) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1026 Int) (v_ArrVal_1022 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_1022) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1026) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-09-01 06:14:11,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:14:21,480 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 06:14:23,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:14:28,209 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 06:14:31,093 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 06:14:33,210 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 06:14:46,259 INFO L130 PetriNetUnfolder]: 1749/3730 cut-off events. [2023-09-01 06:14:46,259 INFO L131 PetriNetUnfolder]: For 254624/254624 co-relation queries the response was YES. [2023-09-01 06:14:46,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41037 conditions, 3730 events. 1749/3730 cut-off events. For 254624/254624 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 28099 event pairs, 115 based on Foata normal form. 125/3855 useless extension candidates. Maximal degree in co-relation 40866. Up to 1506 conditions per place. [2023-09-01 06:14:46,327 INFO L137 encePairwiseOnDemand]: 163/179 looper letters, 655 selfloop transitions, 1114 changer transitions 0/1769 dead transitions. [2023-09-01 06:14:46,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1769 transitions, 38145 flow [2023-09-01 06:14:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-09-01 06:14:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-09-01 06:14:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 6361 transitions. [2023-09-01 06:14:46,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352482344260567 [2023-09-01 06:14:46,335 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 6361 transitions. [2023-09-01 06:14:46,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 6361 transitions. [2023-09-01 06:14:46,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:14:46,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 6361 transitions. [2023-09-01 06:14:46,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 60.009433962264154) internal successors, (6361), 106 states have internal predecessors, (6361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:46,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 179.0) internal successors, (19153), 107 states have internal predecessors, (19153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:46,429 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 179.0) internal successors, (19153), 107 states have internal predecessors, (19153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:46,429 INFO L175 Difference]: Start difference. First operand has 395 places, 961 transitions, 17765 flow. Second operand 106 states and 6361 transitions. [2023-09-01 06:14:46,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 1769 transitions, 38145 flow [2023-09-01 06:14:47,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 1769 transitions, 35064 flow, removed 1525 selfloop flow, removed 3 redundant places. [2023-09-01 06:14:47,926 INFO L231 Difference]: Finished difference. Result has 541 places, 1543 transitions, 30512 flow [2023-09-01 06:14:47,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=15438, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=629, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=30512, PETRI_PLACES=541, PETRI_TRANSITIONS=1543} [2023-09-01 06:14:47,927 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 514 predicate places. [2023-09-01 06:14:47,927 INFO L495 AbstractCegarLoop]: Abstraction has has 541 places, 1543 transitions, 30512 flow [2023-09-01 06:14:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 56.40625) internal successors, (1805), 32 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:14:47,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:14:47,928 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:14:47,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-09-01 06:14:48,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-09-01 06:14:48,134 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:14:48,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:14:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash -486380777, now seen corresponding path program 1 times [2023-09-01 06:14:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:14:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829439437] [2023-09-01 06:14:48,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:14:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:14:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:14:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:14:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:14:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829439437] [2023-09-01 06:14:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829439437] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:14:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398462545] [2023-09-01 06:14:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:14:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:14:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:14:48,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:14:48,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-09-01 06:14:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:14:48,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2023-09-01 06:14:48,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:14:49,012 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 06:14:49,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:14:49,104 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 06:14:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:14:49,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:14:52,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 74 [2023-09-01 06:14:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:14:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398462545] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:14:53,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:14:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-09-01 06:14:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756564424] [2023-09-01 06:14:53,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:14:53,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:14:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:14:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:14:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=811, Unknown=1, NotChecked=0, Total=930 [2023-09-01 06:14:55,164 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 06:14:57,224 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 06:14:59,278 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 06:15:01,332 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 06:15:03,385 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 06:15:05,391 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 06:15:07,437 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 06:15:09,506 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 06:15:11,513 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 06:15:13,565 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 06:15:15,589 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 06:15:17,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 [1] [2023-09-01 06:15:19,675 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 06:15:21,735 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 06:15:23,788 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 06:15:25,854 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 06:15:27,885 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 06:15:27,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-09-01 06:15:27,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 1543 transitions, 30512 flow. Second operand has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:15:27,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:15:27,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-09-01 06:15:27,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:15:37,634 INFO L130 PetriNetUnfolder]: 2067/4424 cut-off events. [2023-09-01 06:15:37,634 INFO L131 PetriNetUnfolder]: For 408667/408667 co-relation queries the response was YES. [2023-09-01 06:15:37,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55848 conditions, 4424 events. 2067/4424 cut-off events. For 408667/408667 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 35105 event pairs, 161 based on Foata normal form. 15/4439 useless extension candidates. Maximal degree in co-relation 55631. Up to 2216 conditions per place. [2023-09-01 06:15:37,757 INFO L137 encePairwiseOnDemand]: 163/179 looper letters, 1167 selfloop transitions, 1024 changer transitions 0/2191 dead transitions. [2023-09-01 06:15:37,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 2191 transitions, 47911 flow [2023-09-01 06:15:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-09-01 06:15:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-09-01 06:15:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 3621 transitions. [2023-09-01 06:15:37,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29748603351955305 [2023-09-01 06:15:37,764 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 3621 transitions. [2023-09-01 06:15:37,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 3621 transitions. [2023-09-01 06:15:37,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:15:37,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 3621 transitions. [2023-09-01 06:15:37,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 53.25) internal successors, (3621), 68 states have internal predecessors, (3621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:15:37,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 179.0) internal successors, (12351), 69 states have internal predecessors, (12351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:15:37,777 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 179.0) internal successors, (12351), 69 states have internal predecessors, (12351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:15:37,777 INFO L175 Difference]: Start difference. First operand has 541 places, 1543 transitions, 30512 flow. Second operand 68 states and 3621 transitions. [2023-09-01 06:15:37,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 2191 transitions, 47911 flow [2023-09-01 06:15:40,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 2191 transitions, 43580 flow, removed 2067 selfloop flow, removed 12 redundant places. [2023-09-01 06:15:40,792 INFO L231 Difference]: Finished difference. Result has 624 places, 1897 transitions, 37935 flow [2023-09-01 06:15:40,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=27353, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=37935, PETRI_PLACES=624, PETRI_TRANSITIONS=1897} [2023-09-01 06:15:40,793 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 597 predicate places. [2023-09-01 06:15:40,794 INFO L495 AbstractCegarLoop]: Abstraction has has 624 places, 1897 transitions, 37935 flow [2023-09-01 06:15:40,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:15:40,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:15:40,794 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:15:40,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-09-01 06:15:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-09-01 06:15:40,995 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:15:40,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:15:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash 667174739, now seen corresponding path program 1 times [2023-09-01 06:15:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:15:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374525590] [2023-09-01 06:15:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:15:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:15:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:15:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:15:41,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:15:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374525590] [2023-09-01 06:15:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374525590] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:15:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123852173] [2023-09-01 06:15:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:15:41,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:15:41,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:15:41,385 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:15:41,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-09-01 06:15:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:15:41,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:15:41,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:15:41,529 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 7 treesize of output 6 [2023-09-01 06:15:41,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:15:41,629 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 13 treesize of output 15 [2023-09-01 06:15:41,793 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 18 treesize of output 13 [2023-09-01 06:15:41,887 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 21 treesize of output 16 [2023-09-01 06:15:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:15:41,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:15:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:15:44,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123852173] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:15:44,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:15:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-09-01 06:15:44,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960152010] [2023-09-01 06:15:44,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:15:44,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:15:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:15:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:15:44,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=788, Unknown=5, NotChecked=0, Total=930 [2023-09-01 06:15:46,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-09-01 06:15:46,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 1897 transitions, 37935 flow. Second operand has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:15:46,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:15:46,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-09-01 06:15:46,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:16:03,049 WARN L222 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 60 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:16:03,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1181) .cse1 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) .cse1 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))))) is different from false [2023-09-01 06:16:19,522 WARN L222 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 73 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:16:43,900 WARN L222 SmtUtils]: Spent 24.30s on a formula simplification. DAG size of input: 96 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:16:45,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:16:47,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:16:49,916 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 06:16:51,927 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 06:16:53,932 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 06:16:55,945 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 06:16:57,955 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 06:16:59,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:17:01,968 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 06:17:03,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:17:06,152 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 06:17:08,175 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 06:17:10,184 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 06:17:32,680 WARN L222 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 92 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:17:34,689 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 06:17:36,696 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 06:17:38,704 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 06:17:40,715 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 06:17:42,725 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 06:17:44,735 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 06:17:46,742 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 06:17:48,754 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 06:17:50,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 06:17:52,777 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 06:17:52,826 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1181) .cse1 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse2) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) .cse1 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse2) (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))))) is different from false [2023-09-01 06:17:54,833 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 06:17:56,842 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 06:17:58,855 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 06:18:00,865 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 06:18:02,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 06:18:04,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 06:18:06,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 06:18:08,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:18:10,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:18:12,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:18:14,945 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 06:18:16,957 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 06:18:19,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 06:18:27,407 WARN L222 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 76 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:18:27,470 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))))) is different from false [2023-09-01 06:18:29,693 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 06:18:38,332 WARN L222 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 91 DAG size of output: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:18:40,341 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 06:18:42,351 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 06:18:44,358 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 06:18:46,364 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 06:18:48,383 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 06:18:50,391 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 06:18:52,403 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 06:18:54,412 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 06:18:56,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:18:58,431 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 06:19:00,444 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 06:19:02,458 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 06:19:10,747 WARN L222 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 99 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:19:12,756 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 06:19:14,774 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 06:19:16,886 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 06:19:20,055 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 06:19:22,067 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 06:19:24,073 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 06:19:26,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:19:26,091 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse2 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1181) .cse1 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (= |c_~#cache~0.base| 1) (or (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) .cse2) .cse3) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse4) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) .cse1 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_~#cache~0.offset| 0) (or (not .cse3) (and (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|)) .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse4) (< 0 (+ 2147483650 (select (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (<= 0 (+ (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))) is different from false [2023-09-01 06:19:28,131 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 06:19:30,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 06:19:32,148 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 06:19:34,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:19:36,167 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 06:19:38,174 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 06:19:40,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:19:42,701 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 06:19:44,706 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 06:19:46,719 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 06:19:48,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 06:19:50,748 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 06:19:50,769 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse9 (@diff .cse4 .cse2)) (.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse1 (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|))) (.cse5 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ .cse10 28 |c_~#cache~0.offset|)) (.cse8 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) .cse1 (exists ((v_ArrVal_1181 Int)) (= (store .cse2 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1181) .cse3 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (= |c_~#cache~0.base| 1) (or (and (= (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) .cse5) .cse6) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse7) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) .cse3 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= .cse2 (store .cse4 .cse9 0)) (= |c_~#cache~0.offset| 0) (or (<= (+ .cse9 28) (+ .cse10 |c_~#cache~0.offset|)) (= .cse2 .cse4)) (or (not .cse6) (and .cse1 .cse5)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse7) (< 0 (+ 2147483650 (select (select (let ((.cse11 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (<= 0 (+ (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))))) is different from false [2023-09-01 06:19:52,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 06:19:54,806 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 06:19:56,812 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 06:19:58,820 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 06:20:00,835 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 06:20:02,841 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 06:20:04,848 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 06:20:06,861 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 06:20:08,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 06:20:10,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:20:12,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 06:20:14,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-01 06:20:16,922 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 06:20:18,928 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 06:20:18,942 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse6 (@diff .cse5 .cse1)) (.cse3 (+ .cse7 28 |c_~#cache~0.offset|)) (.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|)) (exists ((v_ArrVal_1181 Int)) (= (store .cse1 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< 0 (+ 2147483650 (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1181) .cse2 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse3) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) .cse2 v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= .cse1 (store .cse5 .cse6 0)) (= |c_~#cache~0.offset| 0) (or (<= (+ .cse6 28) (+ .cse7 |c_~#cache~0.offset|)) (= .cse1 .cse5)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse3) (< 0 (+ 2147483650 (select (select (let ((.cse8 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))))))) is different from false [2023-09-01 06:20:18,964 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))))) is different from false [2023-09-01 06:20:21,514 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (<= 0 (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))) is different from false [2023-09-01 06:20:25,419 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 06:20:30,255 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)))))) is different from false [2023-09-01 06:20:37,777 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 06:20:39,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:20:40,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:20:43,966 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 06:20:46,827 INFO L130 PetriNetUnfolder]: 2521/5348 cut-off events. [2023-09-01 06:20:46,827 INFO L131 PetriNetUnfolder]: For 543004/543004 co-relation queries the response was YES. [2023-09-01 06:20:46,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71918 conditions, 5348 events. 2521/5348 cut-off events. For 543004/543004 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 43916 event pairs, 274 based on Foata normal form. 58/5406 useless extension candidates. Maximal degree in co-relation 71678. Up to 3621 conditions per place. [2023-09-01 06:20:46,942 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 1624 selfloop transitions, 1023 changer transitions 0/2647 dead transitions. [2023-09-01 06:20:46,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 2647 transitions, 62311 flow [2023-09-01 06:20:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-09-01 06:20:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2023-09-01 06:20:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 4469 transitions. [2023-09-01 06:20:46,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30080096924008887 [2023-09-01 06:20:46,949 INFO L72 ComplementDD]: Start complementDD. Operand 83 states and 4469 transitions. [2023-09-01 06:20:46,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 4469 transitions. [2023-09-01 06:20:46,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:20:46,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 83 states and 4469 transitions. [2023-09-01 06:20:46,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 84 states, 83 states have (on average 53.8433734939759) internal successors, (4469), 83 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:20:46,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 84 states, 84 states have (on average 179.0) internal successors, (15036), 84 states have internal predecessors, (15036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:20:46,967 INFO L81 ComplementDD]: Finished complementDD. Result has 84 states, 84 states have (on average 179.0) internal successors, (15036), 84 states have internal predecessors, (15036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:20:46,968 INFO L175 Difference]: Start difference. First operand has 624 places, 1897 transitions, 37935 flow. Second operand 83 states and 4469 transitions. [2023-09-01 06:20:46,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 2647 transitions, 62311 flow [2023-09-01 06:20:52,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 2647 transitions, 59545 flow, removed 1163 selfloop flow, removed 21 redundant places. [2023-09-01 06:20:52,067 INFO L231 Difference]: Finished difference. Result has 740 places, 2329 transitions, 51794 flow [2023-09-01 06:20:52,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=36298, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=634, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=51794, PETRI_PLACES=740, PETRI_TRANSITIONS=2329} [2023-09-01 06:20:52,069 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 713 predicate places. [2023-09-01 06:20:52,069 INFO L495 AbstractCegarLoop]: Abstraction has has 740 places, 2329 transitions, 51794 flow [2023-09-01 06:20:52,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:20:52,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:20:52,070 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:20:52,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-09-01 06:20:52,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-09-01 06:20:52,277 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:20:52,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:20:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2051569873, now seen corresponding path program 3 times [2023-09-01 06:20:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:20:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781730077] [2023-09-01 06:20:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:20:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:20:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:20:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:20:52,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:20:52,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781730077] [2023-09-01 06:20:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781730077] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:20:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296975879] [2023-09-01 06:20:52,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 06:20:52,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:20:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:20:52,813 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:20:52,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-09-01 06:20:52,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 06:20:52,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:20:52,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:20:52,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:20:52,933 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 7 treesize of output 6 [2023-09-01 06:20:53,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:20:53,042 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 13 treesize of output 15 [2023-09-01 06:20:53,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 18 treesize of output 13 [2023-09-01 06:20:53,285 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 21 treesize of output 16 [2023-09-01 06:20:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:20:53,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:20:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:20:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296975879] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:20:58,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:20:58,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-09-01 06:20:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336441506] [2023-09-01 06:20:58,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:20:58,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-09-01 06:20:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:20:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-09-01 06:20:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=827, Unknown=8, NotChecked=0, Total=1056 [2023-09-01 06:21:02,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-09-01 06:21:02,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 2329 transitions, 51794 flow. Second operand has 33 states, 33 states have (on average 50.36363636363637) internal successors, (1662), 33 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:21:02,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:21:02,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-09-01 06:21:02,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:21:04,222 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1260 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1260) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1263 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1263) (select |c_#memory_int| 1))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-09-01 06:21:04,678 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse0) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1261)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1260 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1260) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= .cse2 (store .cse3 .cse4 0)) (= |c_~#cache~0.offset| 0) (or (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= .cse4 |c_~#cache~0.offset|)) (= .cse2 .cse3)) (exists ((v_ArrVal_1263 Int)) (= (store .cse2 0 v_ArrVal_1263) (select |c_#memory_int| 1))) (<= 0 (+ (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse0) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))))) is different from false [2023-09-01 06:21:05,270 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1261)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1260 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1260) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1263 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1263) (select |c_#memory_int| 1))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) is different from false [2023-09-01 06:21:15,612 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1260 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1260) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= .cse0 (store .cse1 .cse2 0)) (= |c_~#cache~0.offset| 0) (or (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= .cse2 |c_~#cache~0.offset|)) (= .cse0 .cse1)) (exists ((v_ArrVal_1263 Int)) (= (store .cse0 0 v_ArrVal_1263) (select |c_#memory_int| 1))) (<= 0 (+ (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))))) is different from false [2023-09-01 06:21:17,627 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 06:21:25,661 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 06:21:27,672 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 06:21:27,745 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse2 (+ .cse6 28 |c_~#cache~0.offset|)) (.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ .cse6 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< 0 (+ (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1261) .cse1 v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse2))) (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse2) (< 0 (+ (select (select (let ((.cse3 (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1261)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1260 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse4) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1260) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (< 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483650)) (forall ((v_ArrVal_1261 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse2) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_1263 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse4) (< 0 (+ 2147483650 (select (store .cse0 |c_~#cache~0.offset| v_ArrVal_1263) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49| .cse1) (< 0 (+ (select .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_49|) 2147483650))))))) is different from false [2023-09-01 06:21:53,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:21:56,272 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 06:21:58,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 06:22:00,230 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 06:22:10,466 INFO L130 PetriNetUnfolder]: 3112/6600 cut-off events. [2023-09-01 06:22:10,466 INFO L131 PetriNetUnfolder]: For 756900/756900 co-relation queries the response was YES. [2023-09-01 06:22:10,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95628 conditions, 6600 events. 3112/6600 cut-off events. For 756900/756900 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 56650 event pairs, 221 based on Foata normal form. 108/6708 useless extension candidates. Maximal degree in co-relation 95340. Up to 3514 conditions per place. [2023-09-01 06:22:10,691 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 1716 selfloop transitions, 1568 changer transitions 2/3286 dead transitions. [2023-09-01 06:22:10,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 824 places, 3286 transitions, 85243 flow [2023-09-01 06:22:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-09-01 06:22:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2023-09-01 06:22:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 4629 transitions. [2023-09-01 06:22:10,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30423923759447913 [2023-09-01 06:22:10,698 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 4629 transitions. [2023-09-01 06:22:10,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 4629 transitions. [2023-09-01 06:22:10,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:22:10,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 4629 transitions. [2023-09-01 06:22:10,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 54.45882352941177) internal successors, (4629), 85 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:22:10,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 179.0) internal successors, (15394), 86 states have internal predecessors, (15394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:22:10,715 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 179.0) internal successors, (15394), 86 states have internal predecessors, (15394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:22:10,716 INFO L175 Difference]: Start difference. First operand has 740 places, 2329 transitions, 51794 flow. Second operand 85 states and 4629 transitions. [2023-09-01 06:22:10,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 824 places, 3286 transitions, 85243 flow [2023-09-01 06:22:18,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 823 places, 3286 transitions, 80151 flow, removed 2543 selfloop flow, removed 1 redundant places. [2023-09-01 06:22:18,270 INFO L231 Difference]: Finished difference. Result has 871 places, 2901 transitions, 69166 flow [2023-09-01 06:22:18,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=48968, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=69166, PETRI_PLACES=871, PETRI_TRANSITIONS=2901} [2023-09-01 06:22:18,274 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 844 predicate places. [2023-09-01 06:22:18,274 INFO L495 AbstractCegarLoop]: Abstraction has has 871 places, 2901 transitions, 69166 flow [2023-09-01 06:22:18,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 50.36363636363637) internal successors, (1662), 33 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:22:18,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:22:18,275 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:22:18,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-09-01 06:22:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-09-01 06:22:18,482 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:22:18,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:22:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash 688242700, now seen corresponding path program 1 times [2023-09-01 06:22:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:22:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504386069] [2023-09-01 06:22:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:22:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:22:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:22:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:22:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:22:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504386069] [2023-09-01 06:22:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504386069] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:22:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22652073] [2023-09-01 06:22:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:22:18,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:22:18,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:22:18,884 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:22:18,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-09-01 06:22:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:22:19,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:22:19,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:22:19,012 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 7 treesize of output 6 [2023-09-01 06:22:19,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:22:19,094 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 13 treesize of output 15 [2023-09-01 06:22:19,269 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 18 treesize of output 13 [2023-09-01 06:22:19,308 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 21 treesize of output 16 [2023-09-01 06:22:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:22:19,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:22:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:22:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22652073] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:22:23,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:22:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-09-01 06:22:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866644941] [2023-09-01 06:22:23,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:22:23,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:22:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:22:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:22:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=726, Unknown=1, NotChecked=0, Total=930 [2023-09-01 06:22:25,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-09-01 06:22:25,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 2901 transitions, 69166 flow. Second operand has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:22:25,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:22:25,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-09-01 06:22:25,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:22:33,097 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse7 (@diff .cse1 .cse2))) (let ((.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse3 (store .cse1 .cse7 0))) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse4 (@diff .cse3 .cse2)) (.cse6 (+ .cse8 28 |c_~#cache~0.offset|)) (.cse5 (+ .cse8 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0) (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (or (= .cse2 .cse3) (<= (+ .cse4 28) .cse5)) (= .cse2 (store .cse3 .cse4 0)) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse6))) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store .cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse6))) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse6))) (or (= .cse2 .cse1) (<= (+ 28 .cse7) .cse5))))))) is different from false [2023-09-01 06:22:33,450 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse8 (@diff .cse1 .cse2))) (let ((.cse9 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse3 (store .cse1 .cse8 0))) (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse4 (@diff .cse3 .cse2)) (.cse6 (+ .cse9 28 |c_~#cache~0.offset|)) (.cse5 (+ .cse9 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0) (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (or (= .cse2 .cse3) (<= (+ .cse4 28) .cse5)) (= .cse2 (store .cse3 .cse4 0)) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store .cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse6))) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1341)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse6))) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse6))) (or (= .cse2 .cse1) (<= (+ 28 .cse8) .cse5))))))) is different from false [2023-09-01 06:22:35,547 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 06:22:39,781 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-09-01 06:22:42,176 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int)) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1341)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| .cse0))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1344 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1344) (select |c_#memory_int| 1))))) is different from false [2023-09-01 06:22:43,544 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-09-01 06:22:58,414 WARN L222 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 06:23:01,316 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_51|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1344 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1344) (select |c_#memory_int| 1)))) is different from false [2023-09-01 06:23:08,509 INFO L130 PetriNetUnfolder]: 3673/7868 cut-off events. [2023-09-01 06:23:08,510 INFO L131 PetriNetUnfolder]: For 1084618/1084618 co-relation queries the response was YES. [2023-09-01 06:23:08,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128109 conditions, 7868 events. 3673/7868 cut-off events. For 1084618/1084618 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 70286 event pairs, 391 based on Foata normal form. 158/8026 useless extension candidates. Maximal degree in co-relation 127772. Up to 4859 conditions per place. [2023-09-01 06:23:08,710 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 2334 selfloop transitions, 1484 changer transitions 6/3824 dead transitions. [2023-09-01 06:23:08,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 3824 transitions, 105620 flow [2023-09-01 06:23:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-09-01 06:23:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2023-09-01 06:23:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 5123 transitions. [2023-09-01 06:23:08,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33670719684521855 [2023-09-01 06:23:08,717 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 5123 transitions. [2023-09-01 06:23:08,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 5123 transitions. [2023-09-01 06:23:08,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:23:08,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 5123 transitions. [2023-09-01 06:23:08,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 60.27058823529412) internal successors, (5123), 85 states have internal predecessors, (5123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:08,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 179.0) internal successors, (15394), 86 states have internal predecessors, (15394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:08,734 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 179.0) internal successors, (15394), 86 states have internal predecessors, (15394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:08,734 INFO L175 Difference]: Start difference. First operand has 871 places, 2901 transitions, 69166 flow. Second operand 85 states and 5123 transitions. [2023-09-01 06:23:08,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 951 places, 3824 transitions, 105620 flow [2023-09-01 06:23:20,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 3824 transitions, 100763 flow, removed 2263 selfloop flow, removed 10 redundant places. [2023-09-01 06:23:21,056 INFO L231 Difference]: Finished difference. Result has 987 places, 3449 transitions, 88897 flow [2023-09-01 06:23:21,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=64925, PETRI_DIFFERENCE_MINUEND_PLACES=857, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=88897, PETRI_PLACES=987, PETRI_TRANSITIONS=3449} [2023-09-01 06:23:21,060 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 960 predicate places. [2023-09-01 06:23:21,060 INFO L495 AbstractCegarLoop]: Abstraction has has 987 places, 3449 transitions, 88897 flow [2023-09-01 06:23:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:21,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:23:21,061 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:23:21,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-09-01 06:23:21,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:23:21,270 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:23:21,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:23:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash -586968654, now seen corresponding path program 2 times [2023-09-01 06:23:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:23:21,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211962921] [2023-09-01 06:23:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:23:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:23:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:23:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:23:21,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:23:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211962921] [2023-09-01 06:23:21,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211962921] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:23:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088610204] [2023-09-01 06:23:21,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 06:23:21,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:23:21,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:23:21,623 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:23:21,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-09-01 06:23:21,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 06:23:21,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:23:21,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:23:21,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:23:21,753 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 7 treesize of output 6 [2023-09-01 06:23:21,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:23:21,838 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 13 treesize of output 15 [2023-09-01 06:23:22,021 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 18 treesize of output 13 [2023-09-01 06:23:22,167 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 21 treesize of output 16 [2023-09-01 06:23:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:23:22,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:23:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:23:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088610204] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:23:24,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:23:24,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-09-01 06:23:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704790594] [2023-09-01 06:23:24,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:23:24,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:23:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:23:24,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:23:24,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=768, Unknown=4, NotChecked=0, Total=930 [2023-09-01 06:23:26,867 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 06:23:27,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-09-01 06:23:27,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 3449 transitions, 88897 flow. Second operand has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:27,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:23:27,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-09-01 06:23:27,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:23:29,824 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1422)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1423))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647))) (exists ((v_ArrVal_1422 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1422) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1423 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| .cse0) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1420 (Array Int Int)) (v_ArrVal_1423 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1420) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-09-01 06:23:31,096 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1423 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1420 (Array Int Int)) (v_ArrVal_1423 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1420) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-09-01 06:23:31,341 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (< (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483647) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1422 Int) (v_ArrVal_1423 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| .cse1) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1422)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1423))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647))) (exists ((v_ArrVal_1422 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1422) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1423 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| .cse1) (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1420 (Array Int Int)) (v_ArrVal_1423 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1420) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-09-01 06:23:33,553 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1420 (Array Int Int)) (v_ArrVal_1423 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1420) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1423) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_53| (+ 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-09-01 06:23:47,347 INFO L130 PetriNetUnfolder]: 3890/8356 cut-off events. [2023-09-01 06:23:47,347 INFO L131 PetriNetUnfolder]: For 1305183/1305183 co-relation queries the response was YES. [2023-09-01 06:23:47,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144501 conditions, 8356 events. 3890/8356 cut-off events. For 1305183/1305183 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 75482 event pairs, 573 based on Foata normal form. 54/8410 useless extension candidates. Maximal degree in co-relation 144121. Up to 7029 conditions per place. [2023-09-01 06:23:47,583 INFO L137 encePairwiseOnDemand]: 163/179 looper letters, 3276 selfloop transitions, 623 changer transitions 2/3901 dead transitions. [2023-09-01 06:23:47,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 3901 transitions, 112221 flow [2023-09-01 06:23:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-09-01 06:23:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-09-01 06:23:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 3121 transitions. [2023-09-01 06:23:47,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33530296519123337 [2023-09-01 06:23:47,589 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 3121 transitions. [2023-09-01 06:23:47,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 3121 transitions. [2023-09-01 06:23:47,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 06:23:47,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 3121 transitions. [2023-09-01 06:23:47,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 60.01923076923077) internal successors, (3121), 52 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:47,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 179.0) internal successors, (9487), 53 states have internal predecessors, (9487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:47,600 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 179.0) internal successors, (9487), 53 states have internal predecessors, (9487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:23:47,600 INFO L175 Difference]: Start difference. First operand has 987 places, 3449 transitions, 88897 flow. Second operand 52 states and 3121 transitions. [2023-09-01 06:23:47,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 3901 transitions, 112221 flow [2023-09-01 06:24:04,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 3901 transitions, 103376 flow, removed 4182 selfloop flow, removed 18 redundant places. [2023-09-01 06:24:04,681 INFO L231 Difference]: Finished difference. Result has 1045 places, 3683 transitions, 92156 flow [2023-09-01 06:24:04,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=82412, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=433, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=92156, PETRI_PLACES=1045, PETRI_TRANSITIONS=3683} [2023-09-01 06:24:04,684 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1018 predicate places. [2023-09-01 06:24:04,684 INFO L495 AbstractCegarLoop]: Abstraction has has 1045 places, 3683 transitions, 92156 flow [2023-09-01 06:24:04,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:24:04,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 06:24:04,685 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 06:24:04,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-09-01 06:24:04,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:24:04,886 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-09-01 06:24:04,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 06:24:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1549192346, now seen corresponding path program 3 times [2023-09-01 06:24:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 06:24:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335459649] [2023-09-01 06:24:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 06:24:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 06:24:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 06:24:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:24:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 06:24:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335459649] [2023-09-01 06:24:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335459649] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 06:24:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960922680] [2023-09-01 06:24:05,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 06:24:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 06:24:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 06:24:05,262 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 06:24:05,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-09-01 06:24:05,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 06:24:05,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 06:24:05,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-09-01 06:24:05,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 06:24:05,397 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 7 treesize of output 6 [2023-09-01 06:24:05,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 06:24:05,497 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 13 treesize of output 15 [2023-09-01 06:24:05,714 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 18 treesize of output 13 [2023-09-01 06:24:05,825 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 21 treesize of output 16 [2023-09-01 06:24:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:24:05,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 06:24:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-09-01 06:24:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960922680] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 06:24:08,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 06:24:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-09-01 06:24:08,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993694308] [2023-09-01 06:24:08,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 06:24:08,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-09-01 06:24:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 06:24:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-09-01 06:24:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=764, Unknown=11, NotChecked=0, Total=930 [2023-09-01 06:24:09,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-09-01 06:24:09,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 3683 transitions, 92156 flow. Second operand has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 06:24:09,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 06:24:09,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-09-01 06:24:09,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 06:24:17,522 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 06:24:22,642 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 06:24:32,136 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1503 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1500) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1503) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| .cse0) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1503 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1503) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| .cse0))) (exists ((v_ArrVal_1501 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1501) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1501 Int) (v_ArrVal_1503 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1501)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1503))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-09-01 06:24:32,229 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (< (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483647) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1503 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1500) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1503) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| .cse1) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1503 Int)) (or (< (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1503) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| .cse1))) (exists ((v_ArrVal_1501 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1501) (select |c_#memory_int| 1))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1501 Int) (v_ArrVal_1503 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1501)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1503))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-09-01 06:24:34,627 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1503 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1500) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1503) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false Killed by 15