./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/28-race_reach_76-tricky_address3_racefree.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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 10:22:01,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 10:22:01,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 10:22:01,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 10:22:01,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 10:22:01,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 10:22:01,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 10:22:01,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 10:22:01,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 10:22:01,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 10:22:01,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 10:22:01,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 10:22:01,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 10:22:01,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 10:22:01,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 10:22:01,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 10:22:01,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 10:22:02,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 10:22:02,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 10:22:02,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 10:22:02,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 10:22:02,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 10:22:02,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 10:22:02,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 10:22:02,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 10:22:02,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 10:22:02,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 10:22:02,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 10:22:02,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 10:22:02,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 10:22:02,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 10:22:02,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 10:22:02,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 10:22:02,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 10:22:02,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 10:22:02,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 10:22:02,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 10:22:02,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 10:22:02,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 10:22:02,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 10:22:02,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 10:22:02,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 10:22:02,068 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 10:22:02,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 10:22:02,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 10:22:02,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 10:22:02,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 10:22:02,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 10:22:02,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 10:22:02,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 10:22:02,072 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 10:22:02,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 10:22:02,073 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 10:22:02,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 10:22:02,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 10:22:02,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 10:22:02,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 10:22:02,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 10:22:02,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 10:22:02,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 10:22:02,075 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 10:22:02,075 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 10:22:02,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 10:22:02,075 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 10:22:02,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 10:22:02,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 10:22:02,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 10:22:02,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 10:22:02,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 10:22:02,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 10:22:02,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 10:22:02,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 10:22:02,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 10:22:02,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 10:22:02,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 10:22:02,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 10:22:02,078 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 10:22:02,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 10:22:02,078 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 10:22:02,079 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 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 -> AFTER [2023-08-30 10:22:02,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 10:22:02,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 10:22:02,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 10:22:02,407 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 10:22:02,407 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 10:22:02,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-30 10:22:03,529 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 10:22:03,802 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 10:22:03,804 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-30 10:22:03,819 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85124b4d9/793ab65745d64f2dabd7e37dfde22fd3/FLAG521c24499 [2023-08-30 10:22:03,834 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85124b4d9/793ab65745d64f2dabd7e37dfde22fd3 [2023-08-30 10:22:03,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 10:22:03,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 10:22:03,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 10:22:03,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 10:22:03,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 10:22:03,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:22:03" (1/1) ... [2023-08-30 10:22:03,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb65405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:03, skipping insertion in model container [2023-08-30 10:22:03,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:22:03" (1/1) ... [2023-08-30 10:22:03,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 10:22:03,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 10:22:04,313 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-08-30 10:22:04,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 10:22:04,381 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 10:22:04,422 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-08-30 10:22:04,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 10:22:04,498 INFO L208 MainTranslator]: Completed translation [2023-08-30 10:22:04,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04 WrapperNode [2023-08-30 10:22:04,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 10:22:04,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 10:22:04,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 10:22:04,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 10:22:04,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,554 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 209 [2023-08-30 10:22:04,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 10:22:04,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 10:22:04,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 10:22:04,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 10:22:04,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,589 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 10:22:04,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 10:22:04,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 10:22:04,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 10:22:04,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (1/1) ... [2023-08-30 10:22:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 10:22:04,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:04,638 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-08-30 10:22:04,668 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-08-30 10:22:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 10:22:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 10:22:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 10:22:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 10:22:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 10:22:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 10:22:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 10:22:04,683 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 10:22:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 10:22:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 10:22:04,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 10:22:04,685 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 10:22:04,825 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 10:22:04,826 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 10:22:05,240 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 10:22:05,250 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 10:22:05,251 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-30 10:22:05,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:22:05 BoogieIcfgContainer [2023-08-30 10:22:05,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 10:22:05,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 10:22:05,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 10:22:05,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 10:22:05,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 10:22:03" (1/3) ... [2023-08-30 10:22:05,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d000152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:22:05, skipping insertion in model container [2023-08-30 10:22:05,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:22:04" (2/3) ... [2023-08-30 10:22:05,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d000152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:22:05, skipping insertion in model container [2023-08-30 10:22:05,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:22:05" (3/3) ... [2023-08-30 10:22:05,261 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-08-30 10:22:05,268 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 10:22:05,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 10:22:05,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-08-30 10:22:05,277 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 10:22:05,362 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 10:22:05,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 223 transitions, 454 flow [2023-08-30 10:22:05,535 INFO L130 PetriNetUnfolder]: 45/300 cut-off events. [2023-08-30 10:22:05,535 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 10:22:05,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 300 events. 45/300 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 961 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2023-08-30 10:22:05,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 223 transitions, 454 flow [2023-08-30 10:22:05,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 220 transitions, 448 flow [2023-08-30 10:22:05,559 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:22:05,573 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 220 transitions, 448 flow [2023-08-30 10:22:05,577 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 220 transitions, 448 flow [2023-08-30 10:22:05,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 220 transitions, 448 flow [2023-08-30 10:22:05,629 INFO L130 PetriNetUnfolder]: 44/297 cut-off events. [2023-08-30 10:22:05,629 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 10:22:05,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 297 events. 44/297 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 962 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2023-08-30 10:22:05,642 INFO L119 LiptonReduction]: Number of co-enabled transitions 14268 [2023-08-30 10:22:09,155 INFO L134 LiptonReduction]: Checked pairs total: 24711 [2023-08-30 10:22:09,155 INFO L136 LiptonReduction]: Total number of compositions: 200 [2023-08-30 10:22:09,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 10:22:09,173 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;@d506a29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:22:09,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-30 10:22:09,175 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 10:22:09,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:22:09,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:09,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 10:22:09,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:09,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash 28157, now seen corresponding path program 1 times [2023-08-30 10:22:09,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741569547] [2023-08-30 10:22:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:09,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741569547] [2023-08-30 10:22:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741569547] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:09,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 10:22:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403018547] [2023-08-30 10:22:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:09,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:09,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 423 [2023-08-30 10:22:09,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 81 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:09,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 423 [2023-08-30 10:22:09,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:09,671 INFO L130 PetriNetUnfolder]: 501/1044 cut-off events. [2023-08-30 10:22:09,672 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:22:09,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 1044 events. 501/1044 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5673 event pairs, 456 based on Foata normal form. 112/838 useless extension candidates. Maximal degree in co-relation 1967. Up to 983 conditions per place. [2023-08-30 10:22:09,678 INFO L137 encePairwiseOnDemand]: 397/423 looper letters, 49 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-30 10:22:09,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 220 flow [2023-08-30 10:22:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2023-08-30 10:22:09,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2023-08-30 10:22:09,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2023-08-30 10:22:09,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2023-08-30 10:22:09,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:09,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2023-08-30 10:22:09,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 423.0) internal successors, (1692), 4 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 423.0) internal successors, (1692), 4 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,716 INFO L175 Difference]: Start difference. First operand has 60 places, 81 transitions, 170 flow. Second operand 3 states and 639 transitions. [2023-08-30 10:22:09,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 220 flow [2023-08-30 10:22:09,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:22:09,721 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 122 flow [2023-08-30 10:22:09,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-08-30 10:22:09,725 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2023-08-30 10:22:09,726 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 122 flow [2023-08-30 10:22:09,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:09,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 10:22:09,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 10:22:09,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:09,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 841224676, now seen corresponding path program 1 times [2023-08-30 10:22:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:09,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746472713] [2023-08-30 10:22:09,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746472713] [2023-08-30 10:22:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746472713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:09,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:22:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822176651] [2023-08-30 10:22:09,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:09,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:09,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 423 [2023-08-30 10:22:09,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:09,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 423 [2023-08-30 10:22:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:09,947 INFO L130 PetriNetUnfolder]: 501/1045 cut-off events. [2023-08-30 10:22:09,947 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:22:09,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1045 events. 501/1045 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5670 event pairs, 456 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 2031. Up to 984 conditions per place. [2023-08-30 10:22:09,967 INFO L137 encePairwiseOnDemand]: 420/423 looper letters, 49 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-30 10:22:09,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 226 flow [2023-08-30 10:22:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-30 10:22:09,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854215918045705 [2023-08-30 10:22:09,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-30 10:22:09,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-30 10:22:09,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:09,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-30 10:22:09,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 423.0) internal successors, (1692), 4 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,976 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 423.0) internal successors, (1692), 4 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,976 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 122 flow. Second operand 3 states and 616 transitions. [2023-08-30 10:22:09,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 226 flow [2023-08-30 10:22:09,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:09,979 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 133 flow [2023-08-30 10:22:09,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2023-08-30 10:22:09,980 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-08-30 10:22:09,980 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 133 flow [2023-08-30 10:22:09,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:09,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:09,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 10:22:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 10:22:09,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:09,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 297397015, now seen corresponding path program 1 times [2023-08-30 10:22:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:09,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675343026] [2023-08-30 10:22:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675343026] [2023-08-30 10:22:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675343026] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690926806] [2023-08-30 10:22:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:10,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:10,117 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-08-30 10:22:10,133 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-08-30 10:22:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:10,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:22:10,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:10,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690926806] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:10,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-30 10:22:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833606779] [2023-08-30 10:22:10,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:10,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:22:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:10,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:22:10,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:22:10,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 423 [2023-08-30 10:22:10,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:10,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 423 [2023-08-30 10:22:10,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:10,493 INFO L130 PetriNetUnfolder]: 501/1048 cut-off events. [2023-08-30 10:22:10,493 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:22:10,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1048 events. 501/1048 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5664 event pairs, 456 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 2044. Up to 984 conditions per place. [2023-08-30 10:22:10,498 INFO L137 encePairwiseOnDemand]: 420/423 looper letters, 49 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-30 10:22:10,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 253 flow [2023-08-30 10:22:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:22:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:22:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1179 transitions. [2023-08-30 10:22:10,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645390070921986 [2023-08-30 10:22:10,502 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1179 transitions. [2023-08-30 10:22:10,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1179 transitions. [2023-08-30 10:22:10,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:10,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1179 transitions. [2023-08-30 10:22:10,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 196.5) internal successors, (1179), 6 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 423.0) internal successors, (2961), 7 states have internal predecessors, (2961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,510 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 423.0) internal successors, (2961), 7 states have internal predecessors, (2961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,511 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 133 flow. Second operand 6 states and 1179 transitions. [2023-08-30 10:22:10,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 253 flow [2023-08-30 10:22:10,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 249 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:10,513 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 165 flow [2023-08-30 10:22:10,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2023-08-30 10:22:10,514 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-30 10:22:10,514 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 165 flow [2023-08-30 10:22:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:10,515 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2023-08-30 10:22:10,528 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-08-30 10:22:10,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:10,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:10,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1433028260, now seen corresponding path program 2 times [2023-08-30 10:22:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:10,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251585412] [2023-08-30 10:22:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 10:22:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251585412] [2023-08-30 10:22:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251585412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:10,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:10,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:22:10,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583383826] [2023-08-30 10:22:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:10,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:10,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:10,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:10,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:10,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 423 [2023-08-30 10:22:10,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:10,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 423 [2023-08-30 10:22:10,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:10,922 INFO L130 PetriNetUnfolder]: 461/956 cut-off events. [2023-08-30 10:22:10,923 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 10:22:10,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 956 events. 461/956 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5089 event pairs, 252 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 1870. Up to 868 conditions per place. [2023-08-30 10:22:10,927 INFO L137 encePairwiseOnDemand]: 418/423 looper letters, 70 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-30 10:22:10,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 345 flow [2023-08-30 10:22:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2023-08-30 10:22:10,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003940110323088 [2023-08-30 10:22:10,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 635 transitions. [2023-08-30 10:22:10,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 635 transitions. [2023-08-30 10:22:10,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:10,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 635 transitions. [2023-08-30 10:22:10,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 423.0) internal successors, (1692), 4 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 423.0) internal successors, (1692), 4 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,936 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 165 flow. Second operand 3 states and 635 transitions. [2023-08-30 10:22:10,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 345 flow [2023-08-30 10:22:10,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 331 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:10,938 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 155 flow [2023-08-30 10:22:10,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-08-30 10:22:10,939 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-30 10:22:10,940 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 155 flow [2023-08-30 10:22:10,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:10,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:10,940 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:10,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 10:22:10,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:10,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2013368503, now seen corresponding path program 1 times [2023-08-30 10:22:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770020023] [2023-08-30 10:22:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770020023] [2023-08-30 10:22:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770020023] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:11,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556517231] [2023-08-30 10:22:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:11,033 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-08-30 10:22:11,056 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-08-30 10:22:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:11,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:22:11,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:11,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556517231] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:11,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-30 10:22:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064311760] [2023-08-30 10:22:11,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 10:22:11,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 10:22:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-30 10:22:11,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 423 [2023-08-30 10:22:11,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 155 flow. Second operand has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:11,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:11,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 423 [2023-08-30 10:22:11,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:11,368 INFO L130 PetriNetUnfolder]: 461/952 cut-off events. [2023-08-30 10:22:11,369 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2023-08-30 10:22:11,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 952 events. 461/952 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4922 event pairs, 418 based on Foata normal form. 6/715 useless extension candidates. Maximal degree in co-relation 1932. Up to 886 conditions per place. [2023-08-30 10:22:11,374 INFO L137 encePairwiseOnDemand]: 420/423 looper letters, 47 selfloop transitions, 11 changer transitions 0/64 dead transitions. [2023-08-30 10:22:11,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 64 transitions, 307 flow [2023-08-30 10:22:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:22:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:22:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2308 transitions. [2023-08-30 10:22:11,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45468873128447596 [2023-08-30 10:22:11,380 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2308 transitions. [2023-08-30 10:22:11,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2308 transitions. [2023-08-30 10:22:11,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:11,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2308 transitions. [2023-08-30 10:22:11,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 192.33333333333334) internal successors, (2308), 12 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:11,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 423.0) internal successors, (5499), 13 states have internal predecessors, (5499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:11,412 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 423.0) internal successors, (5499), 13 states have internal predecessors, (5499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:11,412 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 155 flow. Second operand 12 states and 2308 transitions. [2023-08-30 10:22:11,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 64 transitions, 307 flow [2023-08-30 10:22:11,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 64 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:22:11,415 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 235 flow [2023-08-30 10:22:11,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=235, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2023-08-30 10:22:11,416 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2023-08-30 10:22:11,416 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 235 flow [2023-08-30 10:22:11,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:11,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:11,417 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:11,426 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-08-30 10:22:11,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:11,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:11,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1518625833, now seen corresponding path program 2 times [2023-08-30 10:22:11,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:11,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881046835] [2023-08-30 10:22:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:11,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881046835] [2023-08-30 10:22:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881046835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:22:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728899213] [2023-08-30 10:22:11,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:11,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:22:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:11,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:22:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:22:12,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 423 [2023-08-30 10:22:12,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:12,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:12,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 423 [2023-08-30 10:22:12,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:12,337 INFO L130 PetriNetUnfolder]: 455/1025 cut-off events. [2023-08-30 10:22:12,339 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-30 10:22:12,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 1025 events. 455/1025 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5831 event pairs, 99 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 2088. Up to 640 conditions per place. [2023-08-30 10:22:12,344 INFO L137 encePairwiseOnDemand]: 410/423 looper letters, 108 selfloop transitions, 14 changer transitions 11/139 dead transitions. [2023-08-30 10:22:12,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 139 transitions, 663 flow [2023-08-30 10:22:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:22:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:22:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1391 transitions. [2023-08-30 10:22:12,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469773725092874 [2023-08-30 10:22:12,350 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1391 transitions. [2023-08-30 10:22:12,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1391 transitions. [2023-08-30 10:22:12,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:12,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1391 transitions. [2023-08-30 10:22:12,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.71428571428572) internal successors, (1391), 7 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:12,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 423.0) internal successors, (3384), 8 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:12,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 423.0) internal successors, (3384), 8 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:12,359 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 235 flow. Second operand 7 states and 1391 transitions. [2023-08-30 10:22:12,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 139 transitions, 663 flow [2023-08-30 10:22:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 139 transitions, 615 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 10:22:12,365 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 295 flow [2023-08-30 10:22:12,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2023-08-30 10:22:12,369 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 28 predicate places. [2023-08-30 10:22:12,369 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 295 flow [2023-08-30 10:22:12,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:12,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:12,370 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:12,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 10:22:12,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:12,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:12,371 INFO L85 PathProgramCache]: Analyzing trace with hash 718863419, now seen corresponding path program 1 times [2023-08-30 10:22:12,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:12,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773309256] [2023-08-30 10:22:12,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:12,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773309256] [2023-08-30 10:22:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773309256] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177617903] [2023-08-30 10:22:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:12,610 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-08-30 10:22:12,636 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-08-30 10:22:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:12,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 10:22:12,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:12,751 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-08-30 10:22:12,839 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:22:12,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:22:12,863 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-08-30 10:22:12,915 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-08-30 10:22:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:12,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:13,000 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_163) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:22:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:22:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177617903] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:13,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-30 10:22:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466850127] [2023-08-30 10:22:13,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:22:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:22:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=100, Unknown=3, NotChecked=20, Total=156 [2023-08-30 10:22:13,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 423 [2023-08-30 10:22:13,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 295 flow. Second operand has 13 states, 13 states have (on average 158.3846153846154) internal successors, (2059), 13 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:13,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:13,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 423 [2023-08-30 10:22:13,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:13,686 INFO L130 PetriNetUnfolder]: 451/1015 cut-off events. [2023-08-30 10:22:13,687 INFO L131 PetriNetUnfolder]: For 367/371 co-relation queries the response was YES. [2023-08-30 10:22:13,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 1015 events. 451/1015 cut-off events. For 367/371 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5763 event pairs, 114 based on Foata normal form. 3/856 useless extension candidates. Maximal degree in co-relation 2373. Up to 640 conditions per place. [2023-08-30 10:22:13,693 INFO L137 encePairwiseOnDemand]: 413/423 looper letters, 104 selfloop transitions, 13 changer transitions 5/128 dead transitions. [2023-08-30 10:22:13,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 661 flow [2023-08-30 10:22:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:22:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:22:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1205 transitions. [2023-08-30 10:22:13,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4069571090847687 [2023-08-30 10:22:13,710 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1205 transitions. [2023-08-30 10:22:13,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1205 transitions. [2023-08-30 10:22:13,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:13,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1205 transitions. [2023-08-30 10:22:13,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.14285714285714) internal successors, (1205), 7 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:13,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 423.0) internal successors, (3384), 8 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:13,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 423.0) internal successors, (3384), 8 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:13,719 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 295 flow. Second operand 7 states and 1205 transitions. [2023-08-30 10:22:13,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 661 flow [2023-08-30 10:22:13,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:22:13,724 INFO L231 Difference]: Finished difference. Result has 95 places, 76 transitions, 330 flow [2023-08-30 10:22:13,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=95, PETRI_TRANSITIONS=76} [2023-08-30 10:22:13,725 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2023-08-30 10:22:13,726 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 76 transitions, 330 flow [2023-08-30 10:22:13,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 158.3846153846154) internal successors, (2059), 13 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:13,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:13,727 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:13,739 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-08-30 10:22:13,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:13,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:13,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash 88738370, now seen corresponding path program 1 times [2023-08-30 10:22:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678795750] [2023-08-30 10:22:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678795750] [2023-08-30 10:22:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678795750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 10:22:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455518624] [2023-08-30 10:22:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:14,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:22:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:14,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:22:14,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:22:14,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 423 [2023-08-30 10:22:14,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 76 transitions, 330 flow. Second operand has 8 states, 8 states have (on average 177.625) internal successors, (1421), 8 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:14,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:14,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 423 [2023-08-30 10:22:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:15,022 INFO L130 PetriNetUnfolder]: 508/1163 cut-off events. [2023-08-30 10:22:15,023 INFO L131 PetriNetUnfolder]: For 606/610 co-relation queries the response was YES. [2023-08-30 10:22:15,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1163 events. 508/1163 cut-off events. For 606/610 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6885 event pairs, 48 based on Foata normal form. 2/990 useless extension candidates. Maximal degree in co-relation 2804. Up to 507 conditions per place. [2023-08-30 10:22:15,029 INFO L137 encePairwiseOnDemand]: 408/423 looper letters, 162 selfloop transitions, 32 changer transitions 10/210 dead transitions. [2023-08-30 10:22:15,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 210 transitions, 1096 flow [2023-08-30 10:22:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 10:22:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 10:22:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2483 transitions. [2023-08-30 10:22:15,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4515366430260047 [2023-08-30 10:22:15,036 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2483 transitions. [2023-08-30 10:22:15,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2483 transitions. [2023-08-30 10:22:15,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:15,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2483 transitions. [2023-08-30 10:22:15,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 191.0) internal successors, (2483), 13 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 423.0) internal successors, (5922), 14 states have internal predecessors, (5922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,051 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 423.0) internal successors, (5922), 14 states have internal predecessors, (5922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,051 INFO L175 Difference]: Start difference. First operand has 95 places, 76 transitions, 330 flow. Second operand 13 states and 2483 transitions. [2023-08-30 10:22:15,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 210 transitions, 1096 flow [2023-08-30 10:22:15,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 210 transitions, 1076 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 10:22:15,058 INFO L231 Difference]: Finished difference. Result has 109 places, 93 transitions, 511 flow [2023-08-30 10:22:15,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=511, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2023-08-30 10:22:15,059 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 49 predicate places. [2023-08-30 10:22:15,059 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 93 transitions, 511 flow [2023-08-30 10:22:15,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 177.625) internal successors, (1421), 8 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:15,060 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:15,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 10:22:15,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:15,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash 88738433, now seen corresponding path program 1 times [2023-08-30 10:22:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320059621] [2023-08-30 10:22:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320059621] [2023-08-30 10:22:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320059621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:15,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 10:22:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097648235] [2023-08-30 10:22:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:15,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:22:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:22:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 10:22:15,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 423 [2023-08-30 10:22:15,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 93 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:15,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 423 [2023-08-30 10:22:15,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:15,484 INFO L130 PetriNetUnfolder]: 507/1202 cut-off events. [2023-08-30 10:22:15,485 INFO L131 PetriNetUnfolder]: For 1451/1451 co-relation queries the response was YES. [2023-08-30 10:22:15,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 1202 events. 507/1202 cut-off events. For 1451/1451 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7165 event pairs, 168 based on Foata normal form. 35/1124 useless extension candidates. Maximal degree in co-relation 3295. Up to 538 conditions per place. [2023-08-30 10:22:15,493 INFO L137 encePairwiseOnDemand]: 413/423 looper letters, 115 selfloop transitions, 21 changer transitions 10/152 dead transitions. [2023-08-30 10:22:15,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 152 transitions, 1007 flow [2023-08-30 10:22:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:22:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:22:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1012 transitions. [2023-08-30 10:22:15,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47848699763593383 [2023-08-30 10:22:15,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1012 transitions. [2023-08-30 10:22:15,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1012 transitions. [2023-08-30 10:22:15,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:15,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1012 transitions. [2023-08-30 10:22:15,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 423.0) internal successors, (2538), 6 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,516 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 423.0) internal successors, (2538), 6 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,516 INFO L175 Difference]: Start difference. First operand has 109 places, 93 transitions, 511 flow. Second operand 5 states and 1012 transitions. [2023-08-30 10:22:15,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 152 transitions, 1007 flow [2023-08-30 10:22:15,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 152 transitions, 952 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 10:22:15,527 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 544 flow [2023-08-30 10:22:15,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2023-08-30 10:22:15,528 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 50 predicate places. [2023-08-30 10:22:15,528 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 544 flow [2023-08-30 10:22:15,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:15,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:15,529 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 10:22:15,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:15,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1299854270, now seen corresponding path program 1 times [2023-08-30 10:22:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014642568] [2023-08-30 10:22:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:15,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014642568] [2023-08-30 10:22:15,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014642568] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:15,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980203571] [2023-08-30 10:22:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:15,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:15,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:15,811 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-08-30 10:22:15,839 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-08-30 10:22:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:15,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 10:22:15,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:15,928 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-08-30 10:22:15,992 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:22:15,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:22:16,003 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-08-30 10:22:16,086 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 27 treesize of output 20 [2023-08-30 10:22:16,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:22:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:16,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:16,188 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648))) is different from false [2023-08-30 10:22:16,208 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_312 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_310 (+ |c_t_funThread1of1ForFork0_#t~post37#1| 1)))) is different from false [2023-08-30 10:22:16,221 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|))) (< v_ArrVal_310 (+ 1 (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-30 10:22:16,275 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_310 (+ (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:22:16,296 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_309 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_309))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_310 (+ (select .cse1 |t_funThread1of1ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-30 10:22:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:22:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980203571] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:16,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-30 10:22:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075175926] [2023-08-30 10:22:16,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:16,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 10:22:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 10:22:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=146, Unknown=5, NotChecked=140, Total=342 [2023-08-30 10:22:16,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 423 [2023-08-30 10:22:16,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 544 flow. Second operand has 19 states, 19 states have (on average 152.10526315789474) internal successors, (2890), 19 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:16,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:16,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 423 [2023-08-30 10:22:16,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:17,903 INFO L130 PetriNetUnfolder]: 511/1216 cut-off events. [2023-08-30 10:22:17,903 INFO L131 PetriNetUnfolder]: For 1757/1761 co-relation queries the response was YES. [2023-08-30 10:22:17,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1216 events. 511/1216 cut-off events. For 1757/1761 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7359 event pairs, 72 based on Foata normal form. 4/1105 useless extension candidates. Maximal degree in co-relation 3573. Up to 462 conditions per place. [2023-08-30 10:22:17,913 INFO L137 encePairwiseOnDemand]: 407/423 looper letters, 201 selfloop transitions, 40 changer transitions 23/270 dead transitions. [2023-08-30 10:22:17,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 270 transitions, 1666 flow [2023-08-30 10:22:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 10:22:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 10:22:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3239 transitions. [2023-08-30 10:22:17,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828605200945627 [2023-08-30 10:22:17,922 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3239 transitions. [2023-08-30 10:22:17,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3239 transitions. [2023-08-30 10:22:17,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:17,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3239 transitions. [2023-08-30 10:22:17,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 161.95) internal successors, (3239), 20 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:17,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 423.0) internal successors, (8883), 21 states have internal predecessors, (8883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:17,943 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 423.0) internal successors, (8883), 21 states have internal predecessors, (8883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:17,943 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 544 flow. Second operand 20 states and 3239 transitions. [2023-08-30 10:22:17,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 270 transitions, 1666 flow [2023-08-30 10:22:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 270 transitions, 1624 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-30 10:22:17,958 INFO L231 Difference]: Finished difference. Result has 134 places, 107 transitions, 813 flow [2023-08-30 10:22:17,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=813, PETRI_PLACES=134, PETRI_TRANSITIONS=107} [2023-08-30 10:22:17,959 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 74 predicate places. [2023-08-30 10:22:17,960 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 107 transitions, 813 flow [2023-08-30 10:22:17,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.10526315789474) internal successors, (2890), 19 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:17,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:17,961 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:17,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 10:22:18,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:18,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:18,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2137895018, now seen corresponding path program 1 times [2023-08-30 10:22:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:18,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928769859] [2023-08-30 10:22:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:18,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:18,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928769859] [2023-08-30 10:22:18,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928769859] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:18,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063840627] [2023-08-30 10:22:18,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:18,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:18,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:18,228 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-08-30 10:22:18,255 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-08-30 10:22:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:18,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:22:18,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:18,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063840627] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:18,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 10:22:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114015805] [2023-08-30 10:22:18,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:18,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:22:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:22:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:22:18,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 423 [2023-08-30 10:22:18,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 107 transitions, 813 flow. Second operand has 7 states, 7 states have (on average 190.14285714285714) internal successors, (1331), 7 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:18,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:18,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 423 [2023-08-30 10:22:18,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:18,420 INFO L130 PetriNetUnfolder]: 20/97 cut-off events. [2023-08-30 10:22:18,421 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2023-08-30 10:22:18,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 97 events. 20/97 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 2 based on Foata normal form. 17/111 useless extension candidates. Maximal degree in co-relation 363. Up to 58 conditions per place. [2023-08-30 10:22:18,422 INFO L137 encePairwiseOnDemand]: 420/423 looper letters, 32 selfloop transitions, 2 changer transitions 18/54 dead transitions. [2023-08-30 10:22:18,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 54 transitions, 439 flow [2023-08-30 10:22:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:22:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:22:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 787 transitions. [2023-08-30 10:22:18,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651300236406619 [2023-08-30 10:22:18,424 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 787 transitions. [2023-08-30 10:22:18,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 787 transitions. [2023-08-30 10:22:18,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:18,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 787 transitions. [2023-08-30 10:22:18,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:18,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:18,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:18,429 INFO L175 Difference]: Start difference. First operand has 134 places, 107 transitions, 813 flow. Second operand 4 states and 787 transitions. [2023-08-30 10:22:18,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 54 transitions, 439 flow [2023-08-30 10:22:18,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 291 flow, removed 9 selfloop flow, removed 34 redundant places. [2023-08-30 10:22:18,432 INFO L231 Difference]: Finished difference. Result has 64 places, 29 transitions, 132 flow [2023-08-30 10:22:18,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=64, PETRI_TRANSITIONS=29} [2023-08-30 10:22:18,432 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2023-08-30 10:22:18,433 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 29 transitions, 132 flow [2023-08-30 10:22:18,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.14285714285714) internal successors, (1331), 7 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:18,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:18,433 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:18,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 10:22:18,638 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,SelfDestructingSolverStorable10 [2023-08-30 10:22:18,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:22:18,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash 138654499, now seen corresponding path program 1 times [2023-08-30 10:22:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627713309] [2023-08-30 10:22:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627713309] [2023-08-30 10:22:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627713309] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512056294] [2023-08-30 10:22:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:18,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:18,879 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-08-30 10:22:18,915 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-08-30 10:22:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:19,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 10:22:19,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:19,059 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:22:19,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:22:19,122 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-08-30 10:22:19,152 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 14 treesize of output 16 [2023-08-30 10:22:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:19,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:19,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:22:19,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-30 10:22:19,220 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 31 treesize of output 23 [2023-08-30 10:22:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512056294] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:19,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:19,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-30 10:22:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631357066] [2023-08-30 10:22:19,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:19,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:22:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:19,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:22:19,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2023-08-30 10:22:19,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 423 [2023-08-30 10:22:19,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 29 transitions, 132 flow. Second operand has 20 states, 20 states have (on average 152.25) internal successors, (3045), 20 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:19,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:19,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 423 [2023-08-30 10:22:19,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:19,927 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2023-08-30 10:22:19,927 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2023-08-30 10:22:19,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 57 events. 10/57 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 1 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 161. Up to 12 conditions per place. [2023-08-30 10:22:19,927 INFO L137 encePairwiseOnDemand]: 416/423 looper letters, 0 selfloop transitions, 0 changer transitions 32/32 dead transitions. [2023-08-30 10:22:19,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 32 transitions, 203 flow [2023-08-30 10:22:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 10:22:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 10:22:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1220 transitions. [2023-08-30 10:22:19,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3605200945626478 [2023-08-30 10:22:19,931 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1220 transitions. [2023-08-30 10:22:19,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1220 transitions. [2023-08-30 10:22:19,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:19,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1220 transitions. [2023-08-30 10:22:19,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 152.5) internal successors, (1220), 8 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:19,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 423.0) internal successors, (3807), 9 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:19,938 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 423.0) internal successors, (3807), 9 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:19,938 INFO L175 Difference]: Start difference. First operand has 64 places, 29 transitions, 132 flow. Second operand 8 states and 1220 transitions. [2023-08-30 10:22:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 32 transitions, 203 flow [2023-08-30 10:22:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 32 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 10:22:19,939 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2023-08-30 10:22:19,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=423, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2023-08-30 10:22:19,940 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2023-08-30 10:22:19,940 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2023-08-30 10:22:19,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 152.25) internal successors, (3045), 20 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:19,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2023-08-30 10:22:19,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2023-08-30 10:22:19,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2023-08-30 10:22:19,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2023-08-30 10:22:19,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2023-08-30 10:22:19,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2023-08-30 10:22:19,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2023-08-30 10:22:19,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2023-08-30 10:22:19,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2023-08-30 10:22:19,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2023-08-30 10:22:19,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2023-08-30 10:22:19,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2023-08-30 10:22:19,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2023-08-30 10:22:19,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2023-08-30 10:22:19,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2023-08-30 10:22:19,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2023-08-30 10:22:19,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2023-08-30 10:22:19,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2023-08-30 10:22:19,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2023-08-30 10:22:19,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2023-08-30 10:22:19,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2023-08-30 10:22:19,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2023-08-30 10:22:19,963 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-08-30 10:22:20,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:20,166 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:20,167 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-30 10:22:20,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 223 transitions, 454 flow [2023-08-30 10:22:20,194 INFO L130 PetriNetUnfolder]: 45/300 cut-off events. [2023-08-30 10:22:20,194 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 10:22:20,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 300 events. 45/300 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 961 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2023-08-30 10:22:20,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 223 transitions, 454 flow [2023-08-30 10:22:20,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 212 transitions, 429 flow [2023-08-30 10:22:20,197 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:22:20,197 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 212 transitions, 429 flow [2023-08-30 10:22:20,197 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 212 transitions, 429 flow [2023-08-30 10:22:20,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 212 transitions, 429 flow [2023-08-30 10:22:20,222 INFO L130 PetriNetUnfolder]: 44/289 cut-off events. [2023-08-30 10:22:20,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:22:20,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 289 events. 44/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 919 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2023-08-30 10:22:20,229 INFO L119 LiptonReduction]: Number of co-enabled transitions 14268 [2023-08-30 10:22:23,076 INFO L134 LiptonReduction]: Checked pairs total: 23874 [2023-08-30 10:22:23,077 INFO L136 LiptonReduction]: Total number of compositions: 191 [2023-08-30 10:22:23,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 10:22:23,079 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;@d506a29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:22:23,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 10:22:23,082 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2023-08-30 10:22:23,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:22:23,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:23,083 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 10:22:23,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:22:23,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:23,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1034982227, now seen corresponding path program 1 times [2023-08-30 10:22:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233673883] [2023-08-30 10:22:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:23,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233673883] [2023-08-30 10:22:23,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233673883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:23,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:23,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:22:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098417914] [2023-08-30 10:22:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:23,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 414 [2023-08-30 10:22:23,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 77 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:23,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 414 [2023-08-30 10:22:23,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:23,235 INFO L130 PetriNetUnfolder]: 501/1042 cut-off events. [2023-08-30 10:22:23,236 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:22:23,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1042 events. 501/1042 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5656 event pairs, 456 based on Foata normal form. 112/837 useless extension candidates. Maximal degree in co-relation 1967. Up to 981 conditions per place. [2023-08-30 10:22:23,238 INFO L137 encePairwiseOnDemand]: 387/414 looper letters, 27 selfloop transitions, 2 changer transitions 22/54 dead transitions. [2023-08-30 10:22:23,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 209 flow [2023-08-30 10:22:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2023-08-30 10:22:23,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128824476650563 [2023-08-30 10:22:23,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2023-08-30 10:22:23,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2023-08-30 10:22:23,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:23,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2023-08-30 10:22:23,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,246 INFO L175 Difference]: Start difference. First operand has 55 places, 77 transitions, 159 flow. Second operand 3 states and 637 transitions. [2023-08-30 10:22:23,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 209 flow [2023-08-30 10:22:23,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:22:23,247 INFO L231 Difference]: Finished difference. Result has 56 places, 32 transitions, 79 flow [2023-08-30 10:22:23,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=56, PETRI_TRANSITIONS=32} [2023-08-30 10:22:23,248 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2023-08-30 10:22:23,248 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 32 transitions, 79 flow [2023-08-30 10:22:23,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:23,249 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:23,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 10:22:23,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:22:23,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash -362663475, now seen corresponding path program 1 times [2023-08-30 10:22:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:23,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467435888] [2023-08-30 10:22:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:23,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467435888] [2023-08-30 10:22:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467435888] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969751779] [2023-08-30 10:22:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:23,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:23,277 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-08-30 10:22:23,287 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-08-30 10:22:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:23,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:22:23,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969751779] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:23,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:23,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 10:22:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003412963] [2023-08-30 10:22:23,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:23,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:22:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:22:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:22:23,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 414 [2023-08-30 10:22:23,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 32 transitions, 79 flow. Second operand has 7 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:23,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 414 [2023-08-30 10:22:23,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:23,452 INFO L130 PetriNetUnfolder]: 102/237 cut-off events. [2023-08-30 10:22:23,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:22:23,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 237 events. 102/237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 844 event pairs, 95 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 465. Up to 221 conditions per place. [2023-08-30 10:22:23,453 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2023-08-30 10:22:23,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 155 flow [2023-08-30 10:22:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:22:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:22:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1157 transitions. [2023-08-30 10:22:23,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46578099838969406 [2023-08-30 10:22:23,459 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1157 transitions. [2023-08-30 10:22:23,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1157 transitions. [2023-08-30 10:22:23,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:23,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1157 transitions. [2023-08-30 10:22:23,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,467 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,467 INFO L175 Difference]: Start difference. First operand has 56 places, 32 transitions, 79 flow. Second operand 6 states and 1157 transitions. [2023-08-30 10:22:23,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 155 flow [2023-08-30 10:22:23,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 151 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:23,468 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 111 flow [2023-08-30 10:22:23,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 10:22:23,469 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2023-08-30 10:22:23,469 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 111 flow [2023-08-30 10:22:23,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:23,470 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-30 10:22:23,479 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-08-30 10:22:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:23,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:22:23,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1402904109, now seen corresponding path program 2 times [2023-08-30 10:22:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606029136] [2023-08-30 10:22:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:23,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606029136] [2023-08-30 10:22:23,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606029136] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125589673] [2023-08-30 10:22:23,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:22:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:23,725 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-08-30 10:22:23,752 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-08-30 10:22:23,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:22:23,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:22:23,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:22:23,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 10:22:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125589673] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:23,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 10:22:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776213013] [2023-08-30 10:22:23,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:23,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:22:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:22:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 10:22:23,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 414 [2023-08-30 10:22:23,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 111 flow. Second operand has 13 states, 13 states have (on average 188.30769230769232) internal successors, (2448), 13 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:23,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:23,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 414 [2023-08-30 10:22:23,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:23,975 INFO L130 PetriNetUnfolder]: 102/243 cut-off events. [2023-08-30 10:22:23,975 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 10:22:23,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 243 events. 102/243 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 844 event pairs, 95 based on Foata normal form. 6/158 useless extension candidates. Maximal degree in co-relation 456. Up to 221 conditions per place. [2023-08-30 10:22:23,976 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 27 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2023-08-30 10:22:23,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 223 flow [2023-08-30 10:22:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:22:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:22:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2288 transitions. [2023-08-30 10:22:23,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605475040257649 [2023-08-30 10:22:23,980 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2288 transitions. [2023-08-30 10:22:23,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2288 transitions. [2023-08-30 10:22:23,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:23,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2288 transitions. [2023-08-30 10:22:23,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 190.66666666666666) internal successors, (2288), 12 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:24,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 414.0) internal successors, (5382), 13 states have internal predecessors, (5382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:24,005 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 414.0) internal successors, (5382), 13 states have internal predecessors, (5382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:24,006 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 111 flow. Second operand 12 states and 2288 transitions. [2023-08-30 10:22:24,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 223 flow [2023-08-30 10:22:24,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 209 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:24,007 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 181 flow [2023-08-30 10:22:24,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-30 10:22:24,009 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-30 10:22:24,009 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 181 flow [2023-08-30 10:22:24,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 188.30769230769232) internal successors, (2448), 13 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:24,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:24,010 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-30 10:22:24,021 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-08-30 10:22:24,215 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,SelfDestructingSolverStorable14 [2023-08-30 10:22:24,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:22:24,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1156087917, now seen corresponding path program 3 times [2023-08-30 10:22:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:24,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017298811] [2023-08-30 10:22:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 10:22:24,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 10:22:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 10:22:24,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 10:22:24,279 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 10:22:24,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 10:22:24,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 10:22:24,280 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 10:22:24,281 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 10:22:24,281 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 10:22:24,281 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 10:22:24,322 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 10:22:24,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 307 transitions, 632 flow [2023-08-30 10:22:24,379 INFO L130 PetriNetUnfolder]: 75/497 cut-off events. [2023-08-30 10:22:24,379 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 10:22:24,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 497 events. 75/497 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2021 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 302. Up to 12 conditions per place. [2023-08-30 10:22:24,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 307 transitions, 632 flow [2023-08-30 10:22:24,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 307 transitions, 632 flow [2023-08-30 10:22:24,390 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:22:24,390 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 307 transitions, 632 flow [2023-08-30 10:22:24,390 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 307 transitions, 632 flow [2023-08-30 10:22:24,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 307 transitions, 632 flow [2023-08-30 10:22:24,435 INFO L130 PetriNetUnfolder]: 75/497 cut-off events. [2023-08-30 10:22:24,436 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 10:22:24,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 497 events. 75/497 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2021 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 302. Up to 12 conditions per place. [2023-08-30 10:22:24,461 INFO L119 LiptonReduction]: Number of co-enabled transitions 45100 [2023-08-30 10:22:28,025 INFO L134 LiptonReduction]: Checked pairs total: 79211 [2023-08-30 10:22:28,025 INFO L136 LiptonReduction]: Total number of compositions: 269 [2023-08-30 10:22:28,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 10:22:28,027 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;@d506a29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:22:28,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-08-30 10:22:28,027 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 10:22:28,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:22:28,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:28,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 10:22:28,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:28,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 55182, now seen corresponding path program 1 times [2023-08-30 10:22:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:28,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593005827] [2023-08-30 10:22:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:28,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:28,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593005827] [2023-08-30 10:22:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593005827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:28,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:28,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 10:22:28,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834500010] [2023-08-30 10:22:28,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:28,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:28,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:28,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:28,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 576 [2023-08-30 10:22:28,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 119 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:28,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:28,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 576 [2023-08-30 10:22:28,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:30,198 INFO L130 PetriNetUnfolder]: 19249/29724 cut-off events. [2023-08-30 10:22:30,198 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2023-08-30 10:22:30,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58306 conditions, 29724 events. 19249/29724 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 211237 event pairs, 18264 based on Foata normal form. 3746/24642 useless extension candidates. Maximal degree in co-relation 34888. Up to 28466 conditions per place. [2023-08-30 10:22:30,362 INFO L137 encePairwiseOnDemand]: 536/576 looper letters, 71 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-30 10:22:30,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 84 transitions, 332 flow [2023-08-30 10:22:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2023-08-30 10:22:30,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109953703703703 [2023-08-30 10:22:30,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2023-08-30 10:22:30,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2023-08-30 10:22:30,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:30,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2023-08-30 10:22:30,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:30,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:30,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:30,368 INFO L175 Difference]: Start difference. First operand has 87 places, 119 transitions, 256 flow. Second operand 3 states and 883 transitions. [2023-08-30 10:22:30,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 84 transitions, 332 flow [2023-08-30 10:22:30,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 332 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:22:30,370 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 198 flow [2023-08-30 10:22:30,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2023-08-30 10:22:30,372 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -2 predicate places. [2023-08-30 10:22:30,372 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 198 flow [2023-08-30 10:22:30,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:30,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:30,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 10:22:30,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 10:22:30,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:30,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1713527, now seen corresponding path program 1 times [2023-08-30 10:22:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140560035] [2023-08-30 10:22:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:30,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140560035] [2023-08-30 10:22:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140560035] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354610480] [2023-08-30 10:22:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:30,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:30,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:30,397 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-08-30 10:22:30,421 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-08-30 10:22:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:30,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 10:22:30,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:30,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 10:22:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354610480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 10:22:30,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 10:22:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868355963] [2023-08-30 10:22:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:30,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:22:30,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:30,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:22:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:22:30,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 576 [2023-08-30 10:22:30,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 257.75) internal successors, (1031), 4 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:30,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:30,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 576 [2023-08-30 10:22:30,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:32,399 INFO L130 PetriNetUnfolder]: 19249/29723 cut-off events. [2023-08-30 10:22:32,400 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2023-08-30 10:22:32,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58311 conditions, 29723 events. 19249/29723 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 211104 event pairs, 18264 based on Foata normal form. 0/20896 useless extension candidates. Maximal degree in co-relation 58298. Up to 28464 conditions per place. [2023-08-30 10:22:32,593 INFO L137 encePairwiseOnDemand]: 573/576 looper letters, 70 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-30 10:22:32,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 338 flow [2023-08-30 10:22:32,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:22:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:22:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1101 transitions. [2023-08-30 10:22:32,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778645833333333 [2023-08-30 10:22:32,596 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1101 transitions. [2023-08-30 10:22:32,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1101 transitions. [2023-08-30 10:22:32,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:32,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1101 transitions. [2023-08-30 10:22:32,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 275.25) internal successors, (1101), 4 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:32,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:32,602 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 576.0) internal successors, (2880), 5 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:32,602 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 198 flow. Second operand 4 states and 1101 transitions. [2023-08-30 10:22:32,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 338 flow [2023-08-30 10:22:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 334 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:32,604 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 194 flow [2023-08-30 10:22:32,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2023-08-30 10:22:32,605 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -1 predicate places. [2023-08-30 10:22:32,605 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 194 flow [2023-08-30 10:22:32,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 257.75) internal successors, (1031), 4 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:32,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:32,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:32,615 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-08-30 10:22:32,812 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,SelfDestructingSolverStorable17 [2023-08-30 10:22:32,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:32,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2020306878, now seen corresponding path program 1 times [2023-08-30 10:22:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:32,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664703483] [2023-08-30 10:22:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664703483] [2023-08-30 10:22:32,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664703483] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456051242] [2023-08-30 10:22:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:32,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:32,847 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-08-30 10:22:32,849 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-08-30 10:22:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:33,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:22:33,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:33,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456051242] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:33,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 10:22:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633397886] [2023-08-30 10:22:33,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:33,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:22:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:22:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:22:33,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 576 [2023-08-30 10:22:33,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 257.57142857142856) internal successors, (1803), 7 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:33,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:33,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 576 [2023-08-30 10:22:33,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:34,583 INFO L130 PetriNetUnfolder]: 19249/29726 cut-off events. [2023-08-30 10:22:34,584 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2023-08-30 10:22:34,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58320 conditions, 29726 events. 19249/29726 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 211214 event pairs, 18264 based on Foata normal form. 0/20899 useless extension candidates. Maximal degree in co-relation 58307. Up to 28465 conditions per place. [2023-08-30 10:22:34,737 INFO L137 encePairwiseOnDemand]: 573/576 looper letters, 70 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-08-30 10:22:34,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 356 flow [2023-08-30 10:22:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:22:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:22:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1614 transitions. [2023-08-30 10:22:34,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4670138888888889 [2023-08-30 10:22:34,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1614 transitions. [2023-08-30 10:22:34,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1614 transitions. [2023-08-30 10:22:34,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:34,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1614 transitions. [2023-08-30 10:22:34,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:34,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:34,951 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 576.0) internal successors, (4032), 7 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:34,951 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 194 flow. Second operand 6 states and 1614 transitions. [2023-08-30 10:22:34,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 356 flow [2023-08-30 10:22:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 86 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:22:34,955 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 227 flow [2023-08-30 10:22:34,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2023-08-30 10:22:34,961 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2023-08-30 10:22:34,962 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 227 flow [2023-08-30 10:22:34,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 257.57142857142856) internal successors, (1803), 7 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:34,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:34,962 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:34,971 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-08-30 10:22:35,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:35,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:35,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1772277909, now seen corresponding path program 2 times [2023-08-30 10:22:35,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:35,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324195806] [2023-08-30 10:22:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 10:22:35,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:35,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324195806] [2023-08-30 10:22:35,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324195806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:35,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:35,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:22:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310944821] [2023-08-30 10:22:35,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:35,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:35,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:35,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:35,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 576 [2023-08-30 10:22:35,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:35,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:35,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 576 [2023-08-30 10:22:35,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:36,690 INFO L130 PetriNetUnfolder]: 19029/29560 cut-off events. [2023-08-30 10:22:36,690 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2023-08-30 10:22:36,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58102 conditions, 29560 events. 19029/29560 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 213724 event pairs, 8778 based on Foata normal form. 0/20833 useless extension candidates. Maximal degree in co-relation 58085. Up to 28356 conditions per place. [2023-08-30 10:22:36,831 INFO L137 encePairwiseOnDemand]: 571/576 looper letters, 93 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2023-08-30 10:22:36,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 106 transitions, 457 flow [2023-08-30 10:22:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2023-08-30 10:22:36,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005787037037037 [2023-08-30 10:22:36,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 865 transitions. [2023-08-30 10:22:36,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 865 transitions. [2023-08-30 10:22:36,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:36,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 865 transitions. [2023-08-30 10:22:36,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:36,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:36,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:36,837 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 227 flow. Second operand 3 states and 865 transitions. [2023-08-30 10:22:36,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 106 transitions, 457 flow [2023-08-30 10:22:36,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 106 transitions, 443 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:36,840 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 229 flow [2023-08-30 10:22:36,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2023-08-30 10:22:36,840 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 7 predicate places. [2023-08-30 10:22:36,840 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 229 flow [2023-08-30 10:22:36,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:36,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:36,841 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:36,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 10:22:36,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:36,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 347213659, now seen corresponding path program 1 times [2023-08-30 10:22:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207474679] [2023-08-30 10:22:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207474679] [2023-08-30 10:22:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207474679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159405788] [2023-08-30 10:22:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:36,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:36,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:36,901 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-08-30 10:22:36,923 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-08-30 10:22:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:36,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:22:37,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:37,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 10:22:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159405788] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:37,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 10:22:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541563455] [2023-08-30 10:22:37,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:37,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:22:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:22:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 10:22:37,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 576 [2023-08-30 10:22:37,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 229 flow. Second operand has 13 states, 13 states have (on average 257.53846153846155) internal successors, (3348), 13 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:37,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:37,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 576 [2023-08-30 10:22:37,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:39,007 INFO L130 PetriNetUnfolder]: 19428/29764 cut-off events. [2023-08-30 10:22:39,007 INFO L131 PetriNetUnfolder]: For 991/991 co-relation queries the response was YES. [2023-08-30 10:22:39,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59871 conditions, 29764 events. 19428/29764 cut-off events. For 991/991 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 208747 event pairs, 18228 based on Foata normal form. 6/21414 useless extension candidates. Maximal degree in co-relation 59853. Up to 28373 conditions per place. [2023-08-30 10:22:39,177 INFO L137 encePairwiseOnDemand]: 573/576 looper letters, 71 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2023-08-30 10:22:39,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 429 flow [2023-08-30 10:22:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:22:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:22:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3159 transitions. [2023-08-30 10:22:39,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45703125 [2023-08-30 10:22:39,182 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3159 transitions. [2023-08-30 10:22:39,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3159 transitions. [2023-08-30 10:22:39,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:39,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3159 transitions. [2023-08-30 10:22:39,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 263.25) internal successors, (3159), 12 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:39,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:39,193 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 576.0) internal successors, (7488), 13 states have internal predecessors, (7488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:39,193 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 229 flow. Second operand 12 states and 3159 transitions. [2023-08-30 10:22:39,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 429 flow [2023-08-30 10:22:39,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 93 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:39,197 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 311 flow [2023-08-30 10:22:39,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=311, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2023-08-30 10:22:39,198 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 23 predicate places. [2023-08-30 10:22:39,199 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 311 flow [2023-08-30 10:22:39,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 257.53846153846155) internal successors, (3348), 13 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:39,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:39,199 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:39,205 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-08-30 10:22:39,405 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,SelfDestructingSolverStorable20 [2023-08-30 10:22:39,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:39,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash -184560645, now seen corresponding path program 2 times [2023-08-30 10:22:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:39,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120905334] [2023-08-30 10:22:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:39,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120905334] [2023-08-30 10:22:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120905334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:22:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042777278] [2023-08-30 10:22:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:39,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:22:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:22:39,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:22:39,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 576 [2023-08-30 10:22:39,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:39,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:39,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 576 [2023-08-30 10:22:39,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:42,383 INFO L130 PetriNetUnfolder]: 24813/39126 cut-off events. [2023-08-30 10:22:42,383 INFO L131 PetriNetUnfolder]: For 1376/1376 co-relation queries the response was YES. [2023-08-30 10:22:42,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79292 conditions, 39126 events. 24813/39126 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 299695 event pairs, 7120 based on Foata normal form. 0/28957 useless extension candidates. Maximal degree in co-relation 79266. Up to 24531 conditions per place. [2023-08-30 10:22:42,653 INFO L137 encePairwiseOnDemand]: 561/576 looper letters, 237 selfloop transitions, 25 changer transitions 0/273 dead transitions. [2023-08-30 10:22:42,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 273 transitions, 1251 flow [2023-08-30 10:22:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:22:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:22:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1979 transitions. [2023-08-30 10:22:42,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908234126984127 [2023-08-30 10:22:42,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1979 transitions. [2023-08-30 10:22:42,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1979 transitions. [2023-08-30 10:22:42,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:42,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1979 transitions. [2023-08-30 10:22:42,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 282.7142857142857) internal successors, (1979), 7 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:42,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 576.0) internal successors, (4608), 8 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:42,665 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 576.0) internal successors, (4608), 8 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:42,665 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 311 flow. Second operand 7 states and 1979 transitions. [2023-08-30 10:22:42,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 273 transitions, 1251 flow [2023-08-30 10:22:42,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 273 transitions, 1203 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 10:22:42,673 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 427 flow [2023-08-30 10:22:42,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2023-08-30 10:22:42,674 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 28 predicate places. [2023-08-30 10:22:42,674 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 427 flow [2023-08-30 10:22:42,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:42,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:42,675 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 10:22:42,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:42,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1902508773, now seen corresponding path program 1 times [2023-08-30 10:22:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819337350] [2023-08-30 10:22:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819337350] [2023-08-30 10:22:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819337350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:22:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181896120] [2023-08-30 10:22:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:42,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:42,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 576 [2023-08-30 10:22:42,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:42,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:42,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 576 [2023-08-30 10:22:42,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:45,464 INFO L130 PetriNetUnfolder]: 23812/37514 cut-off events. [2023-08-30 10:22:45,464 INFO L131 PetriNetUnfolder]: For 10504/10504 co-relation queries the response was YES. [2023-08-30 10:22:45,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87023 conditions, 37514 events. 23812/37514 cut-off events. For 10504/10504 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 282451 event pairs, 20923 based on Foata normal form. 0/29646 useless extension candidates. Maximal degree in co-relation 86994. Up to 36178 conditions per place. [2023-08-30 10:22:45,711 INFO L137 encePairwiseOnDemand]: 574/576 looper letters, 104 selfloop transitions, 1 changer transitions 0/116 dead transitions. [2023-08-30 10:22:45,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 633 flow [2023-08-30 10:22:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2023-08-30 10:22:45,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48726851851851855 [2023-08-30 10:22:45,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 842 transitions. [2023-08-30 10:22:45,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 842 transitions. [2023-08-30 10:22:45,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:45,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 842 transitions. [2023-08-30 10:22:45,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:45,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:45,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:45,716 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 427 flow. Second operand 3 states and 842 transitions. [2023-08-30 10:22:45,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 633 flow [2023-08-30 10:22:45,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 633 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:22:45,735 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 425 flow [2023-08-30 10:22:45,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2023-08-30 10:22:45,736 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 29 predicate places. [2023-08-30 10:22:45,736 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 425 flow [2023-08-30 10:22:45,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:45,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:45,737 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:45,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 10:22:45,737 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:45,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1902508774, now seen corresponding path program 1 times [2023-08-30 10:22:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286628063] [2023-08-30 10:22:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:22:45,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286628063] [2023-08-30 10:22:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286628063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:22:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123850426] [2023-08-30 10:22:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:45,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:22:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:22:45,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:22:45,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 576 [2023-08-30 10:22:45,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:45,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:45,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 576 [2023-08-30 10:22:45,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:48,225 INFO L130 PetriNetUnfolder]: 22789/36656 cut-off events. [2023-08-30 10:22:48,226 INFO L131 PetriNetUnfolder]: For 8279/8279 co-relation queries the response was YES. [2023-08-30 10:22:48,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84107 conditions, 36656 events. 22789/36656 cut-off events. For 8279/8279 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 286171 event pairs, 2882 based on Foata normal form. 0/29589 useless extension candidates. Maximal degree in co-relation 84077. Up to 32240 conditions per place. [2023-08-30 10:22:48,509 INFO L137 encePairwiseOnDemand]: 572/576 looper letters, 144 selfloop transitions, 6 changer transitions 0/161 dead transitions. [2023-08-30 10:22:48,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 161 transitions, 861 flow [2023-08-30 10:22:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:22:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:22:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 876 transitions. [2023-08-30 10:22:48,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2023-08-30 10:22:48,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 876 transitions. [2023-08-30 10:22:48,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 876 transitions. [2023-08-30 10:22:48,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:48,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 876 transitions. [2023-08-30 10:22:48,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:48,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:48,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 576.0) internal successors, (2304), 4 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:48,514 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 425 flow. Second operand 3 states and 876 transitions. [2023-08-30 10:22:48,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 161 transitions, 861 flow [2023-08-30 10:22:48,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 161 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:48,543 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 446 flow [2023-08-30 10:22:48,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2023-08-30 10:22:48,544 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 30 predicate places. [2023-08-30 10:22:48,544 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 446 flow [2023-08-30 10:22:48,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:48,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:48,544 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:48,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 10:22:48,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:48,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 338648488, now seen corresponding path program 1 times [2023-08-30 10:22:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680211319] [2023-08-30 10:22:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:48,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:48,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680211319] [2023-08-30 10:22:48,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680211319] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:48,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092249947] [2023-08-30 10:22:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:48,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:48,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:48,805 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-08-30 10:22:48,830 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-08-30 10:22:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:48,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 10:22:48,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:48,927 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-08-30 10:22:48,988 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:22:48,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:22:49,003 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-08-30 10:22:49,040 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-08-30 10:22:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:49,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092249947] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:49,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-30 10:22:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698677004] [2023-08-30 10:22:49,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:49,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 10:22:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 10:22:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2023-08-30 10:22:50,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 576 [2023-08-30 10:22:50,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 446 flow. Second operand has 14 states, 14 states have (on average 202.35714285714286) internal successors, (2833), 14 states have internal predecessors, (2833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:50,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:50,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 576 [2023-08-30 10:22:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:53,675 INFO L130 PetriNetUnfolder]: 24485/38602 cut-off events. [2023-08-30 10:22:53,675 INFO L131 PetriNetUnfolder]: For 14864/14864 co-relation queries the response was YES. [2023-08-30 10:22:53,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89927 conditions, 38602 events. 24485/38602 cut-off events. For 14864/14864 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 287102 event pairs, 7029 based on Foata normal form. 175/31553 useless extension candidates. Maximal degree in co-relation 89897. Up to 24737 conditions per place. [2023-08-30 10:22:53,997 INFO L137 encePairwiseOnDemand]: 563/576 looper letters, 224 selfloop transitions, 26 changer transitions 0/259 dead transitions. [2023-08-30 10:22:53,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 259 transitions, 1325 flow [2023-08-30 10:22:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:22:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:22:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1631 transitions. [2023-08-30 10:22:53,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4045138888888889 [2023-08-30 10:22:53,999 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1631 transitions. [2023-08-30 10:22:53,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1631 transitions. [2023-08-30 10:22:53,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:53,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1631 transitions. [2023-08-30 10:22:54,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:54,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 576.0) internal successors, (4608), 8 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:54,003 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 576.0) internal successors, (4608), 8 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:54,003 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 446 flow. Second operand 7 states and 1631 transitions. [2023-08-30 10:22:54,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 259 transitions, 1325 flow [2023-08-30 10:22:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 259 transitions, 1312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:22:54,120 INFO L231 Difference]: Finished difference. Result has 124 places, 120 transitions, 535 flow [2023-08-30 10:22:54,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=535, PETRI_PLACES=124, PETRI_TRANSITIONS=120} [2023-08-30 10:22:54,120 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 37 predicate places. [2023-08-30 10:22:54,120 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 120 transitions, 535 flow [2023-08-30 10:22:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 202.35714285714286) internal successors, (2833), 14 states have internal predecessors, (2833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:54,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:54,121 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:54,126 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-08-30 10:22:54,321 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,SelfDestructingSolverStorable24 [2023-08-30 10:22:54,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:54,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1701431224, now seen corresponding path program 1 times [2023-08-30 10:22:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080742999] [2023-08-30 10:22:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:22:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080742999] [2023-08-30 10:22:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080742999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:22:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131154087] [2023-08-30 10:22:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:54,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:22:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:22:54,557 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-08-30 10:22:54,585 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-08-30 10:22:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:54,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 10:22:54,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:22:54,692 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-08-30 10:22:54,753 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:22:54,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:22:54,771 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-08-30 10:22:54,798 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-08-30 10:22:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:22:54,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:22:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:22:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131154087] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:55,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-30 10:22:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330777034] [2023-08-30 10:22:55,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:55,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 10:22:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 10:22:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=134, Unknown=1, NotChecked=0, Total=182 [2023-08-30 10:22:55,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 576 [2023-08-30 10:22:55,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 120 transitions, 535 flow. Second operand has 14 states, 14 states have (on average 202.57142857142858) internal successors, (2836), 14 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:55,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:55,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 576 [2023-08-30 10:22:55,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:58,870 INFO L130 PetriNetUnfolder]: 25260/40142 cut-off events. [2023-08-30 10:22:58,870 INFO L131 PetriNetUnfolder]: For 21099/21099 co-relation queries the response was YES. [2023-08-30 10:22:59,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96873 conditions, 40142 events. 25260/40142 cut-off events. For 21099/21099 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 301809 event pairs, 6829 based on Foata normal form. 0/33072 useless extension candidates. Maximal degree in co-relation 96839. Up to 27413 conditions per place. [2023-08-30 10:22:59,208 INFO L137 encePairwiseOnDemand]: 563/576 looper letters, 222 selfloop transitions, 37 changer transitions 0/268 dead transitions. [2023-08-30 10:22:59,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 268 transitions, 1545 flow [2023-08-30 10:22:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:22:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:22:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1622 transitions. [2023-08-30 10:22:59,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40228174603174605 [2023-08-30 10:22:59,211 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1622 transitions. [2023-08-30 10:22:59,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1622 transitions. [2023-08-30 10:22:59,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:22:59,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1622 transitions. [2023-08-30 10:22:59,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 231.71428571428572) internal successors, (1622), 7 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:59,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 576.0) internal successors, (4608), 8 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:59,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 576.0) internal successors, (4608), 8 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:59,215 INFO L175 Difference]: Start difference. First operand has 124 places, 120 transitions, 535 flow. Second operand 7 states and 1622 transitions. [2023-08-30 10:22:59,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 268 transitions, 1545 flow [2023-08-30 10:22:59,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 268 transitions, 1491 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 10:22:59,266 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 758 flow [2023-08-30 10:22:59,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=758, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2023-08-30 10:22:59,267 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 44 predicate places. [2023-08-30 10:22:59,267 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 758 flow [2023-08-30 10:22:59,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 202.57142857142858) internal successors, (2836), 14 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:59,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:22:59,267 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:22:59,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-30 10:22:59,468 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,SelfDestructingSolverStorable25 [2023-08-30 10:22:59,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:22:59,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:22:59,469 INFO L85 PathProgramCache]: Analyzing trace with hash 193415782, now seen corresponding path program 1 times [2023-08-30 10:22:59,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:22:59,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6664026] [2023-08-30 10:22:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:22:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:22:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:22:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:22:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:22:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6664026] [2023-08-30 10:22:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6664026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:22:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:22:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 10:22:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214396124] [2023-08-30 10:22:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:22:59,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:22:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:22:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 10:22:59,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 576 [2023-08-30 10:22:59,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 758 flow. Second operand has 4 states, 4 states have (on average 251.25) internal successors, (1005), 4 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:22:59,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:59,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 576 [2023-08-30 10:22:59,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:03,381 INFO L130 PetriNetUnfolder]: 29755/47493 cut-off events. [2023-08-30 10:23:03,381 INFO L131 PetriNetUnfolder]: For 35496/35496 co-relation queries the response was YES. [2023-08-30 10:23:03,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121805 conditions, 47493 events. 29755/47493 cut-off events. For 35496/35496 co-relation queries the response was YES. Maximal size of possible extension queue 1826. Compared 382339 event pairs, 12878 based on Foata normal form. 0/39239 useless extension candidates. Maximal degree in co-relation 121767. Up to 26594 conditions per place. [2023-08-30 10:23:03,809 INFO L137 encePairwiseOnDemand]: 566/576 looper letters, 276 selfloop transitions, 47 changer transitions 0/334 dead transitions. [2023-08-30 10:23:03,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 334 transitions, 2319 flow [2023-08-30 10:23:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:23:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:23:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1457 transitions. [2023-08-30 10:23:03,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059027777777778 [2023-08-30 10:23:03,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1457 transitions. [2023-08-30 10:23:03,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1457 transitions. [2023-08-30 10:23:03,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:03,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1457 transitions. [2023-08-30 10:23:03,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 291.4) internal successors, (1457), 5 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:03,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:03,814 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:03,814 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 758 flow. Second operand 5 states and 1457 transitions. [2023-08-30 10:23:03,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 334 transitions, 2319 flow [2023-08-30 10:23:03,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 334 transitions, 2319 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:23:03,962 INFO L231 Difference]: Finished difference. Result has 138 places, 165 transitions, 1180 flow [2023-08-30 10:23:03,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1180, PETRI_PLACES=138, PETRI_TRANSITIONS=165} [2023-08-30 10:23:03,963 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 51 predicate places. [2023-08-30 10:23:03,963 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 165 transitions, 1180 flow [2023-08-30 10:23:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 251.25) internal successors, (1005), 4 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:03,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:03,963 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:03,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 10:23:03,964 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:03,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash 193415783, now seen corresponding path program 1 times [2023-08-30 10:23:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185239321] [2023-08-30 10:23:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:03,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185239321] [2023-08-30 10:23:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185239321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:23:04,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:23:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 10:23:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901035214] [2023-08-30 10:23:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:23:04,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 10:23:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 10:23:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 10:23:04,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 576 [2023-08-30 10:23:04,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 165 transitions, 1180 flow. Second operand has 9 states, 9 states have (on average 243.44444444444446) internal successors, (2191), 9 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:04,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:04,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 576 [2023-08-30 10:23:04,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:09,447 INFO L130 PetriNetUnfolder]: 31885/51257 cut-off events. [2023-08-30 10:23:09,448 INFO L131 PetriNetUnfolder]: For 76860/76876 co-relation queries the response was YES. [2023-08-30 10:23:09,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144736 conditions, 51257 events. 31885/51257 cut-off events. For 76860/76876 co-relation queries the response was YES. Maximal size of possible extension queue 1956. Compared 419444 event pairs, 9736 based on Foata normal form. 253/44841 useless extension candidates. Maximal degree in co-relation 144695. Up to 37624 conditions per place. [2023-08-30 10:23:09,936 INFO L137 encePairwiseOnDemand]: 560/576 looper letters, 296 selfloop transitions, 68 changer transitions 10/385 dead transitions. [2023-08-30 10:23:09,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 385 transitions, 2726 flow [2023-08-30 10:23:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 10:23:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 10:23:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2722 transitions. [2023-08-30 10:23:09,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47256944444444443 [2023-08-30 10:23:09,939 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2722 transitions. [2023-08-30 10:23:09,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2722 transitions. [2023-08-30 10:23:09,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:09,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2722 transitions. [2023-08-30 10:23:09,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:09,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:09,947 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:09,947 INFO L175 Difference]: Start difference. First operand has 138 places, 165 transitions, 1180 flow. Second operand 10 states and 2722 transitions. [2023-08-30 10:23:09,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 385 transitions, 2726 flow [2023-08-30 10:23:10,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 385 transitions, 2726 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:23:10,411 INFO L231 Difference]: Finished difference. Result has 151 places, 186 transitions, 1590 flow [2023-08-30 10:23:10,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1590, PETRI_PLACES=151, PETRI_TRANSITIONS=186} [2023-08-30 10:23:10,411 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 64 predicate places. [2023-08-30 10:23:10,411 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 186 transitions, 1590 flow [2023-08-30 10:23:10,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 243.44444444444446) internal successors, (2191), 9 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:10,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:10,412 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:10,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 10:23:10,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:10,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1913876334, now seen corresponding path program 1 times [2023-08-30 10:23:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458871712] [2023-08-30 10:23:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:10,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:10,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458871712] [2023-08-30 10:23:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458871712] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325938244] [2023-08-30 10:23:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:10,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:10,646 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-08-30 10:23:10,653 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-08-30 10:23:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:10,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 10:23:10,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:10,781 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-08-30 10:23:10,830 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:10,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:10,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-08-30 10:23:10,905 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 27 treesize of output 20 [2023-08-30 10:23:10,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:10,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:11,010 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 Int)) (or (< 0 (+ 2147483648 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_977) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (< v_ArrVal_976 (+ |c_t_funThread1of2ForFork0_#t~post37#1| 1)))) is different from false [2023-08-30 10:23:11,021 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (< v_ArrVal_976 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_977) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648))))) is different from false [2023-08-30 10:23:11,051 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_977) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_976 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:23:11,079 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_977 (Array Int Int)) (v_ArrVal_976 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_974))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_976)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_977) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_976 (+ (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-30 10:23:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:23:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325938244] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:11,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-30 10:23:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331289408] [2023-08-30 10:23:11,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:11,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 10:23:11,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:11,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 10:23:11,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=165, Unknown=5, NotChecked=116, Total=342 [2023-08-30 10:23:11,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 576 [2023-08-30 10:23:11,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 186 transitions, 1590 flow. Second operand has 19 states, 19 states have (on average 215.05263157894737) internal successors, (4086), 19 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:11,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:11,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 576 [2023-08-30 10:23:11,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:17,843 INFO L130 PetriNetUnfolder]: 36404/58655 cut-off events. [2023-08-30 10:23:17,843 INFO L131 PetriNetUnfolder]: For 119796/119812 co-relation queries the response was YES. [2023-08-30 10:23:18,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175444 conditions, 58655 events. 36404/58655 cut-off events. For 119796/119812 co-relation queries the response was YES. Maximal size of possible extension queue 2190. Compared 487010 event pairs, 8473 based on Foata normal form. 822/51945 useless extension candidates. Maximal degree in co-relation 175397. Up to 29820 conditions per place. [2023-08-30 10:23:18,411 INFO L137 encePairwiseOnDemand]: 559/576 looper letters, 466 selfloop transitions, 132 changer transitions 11/620 dead transitions. [2023-08-30 10:23:18,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 620 transitions, 4736 flow [2023-08-30 10:23:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 10:23:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 10:23:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3463 transitions. [2023-08-30 10:23:18,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42943948412698413 [2023-08-30 10:23:18,415 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3463 transitions. [2023-08-30 10:23:18,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3463 transitions. [2023-08-30 10:23:18,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:18,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3463 transitions. [2023-08-30 10:23:18,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 247.35714285714286) internal successors, (3463), 14 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:18,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:18,426 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:18,426 INFO L175 Difference]: Start difference. First operand has 151 places, 186 transitions, 1590 flow. Second operand 14 states and 3463 transitions. [2023-08-30 10:23:18,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 620 transitions, 4736 flow [2023-08-30 10:23:19,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 620 transitions, 4621 flow, removed 36 selfloop flow, removed 2 redundant places. [2023-08-30 10:23:19,283 INFO L231 Difference]: Finished difference. Result has 171 places, 257 transitions, 2720 flow [2023-08-30 10:23:19,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2720, PETRI_PLACES=171, PETRI_TRANSITIONS=257} [2023-08-30 10:23:19,284 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 84 predicate places. [2023-08-30 10:23:19,284 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 257 transitions, 2720 flow [2023-08-30 10:23:19,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 215.05263157894737) internal successors, (4086), 19 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:19,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:19,285 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:19,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-30 10:23:19,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:19,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:19,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 355300707, now seen corresponding path program 1 times [2023-08-30 10:23:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862867063] [2023-08-30 10:23:19,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862867063] [2023-08-30 10:23:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862867063] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709446693] [2023-08-30 10:23:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:19,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:19,531 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-08-30 10:23:19,557 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-08-30 10:23:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:19,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:23:19,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:19,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709446693] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:19,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 10:23:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264670624] [2023-08-30 10:23:19,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:19,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:23:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:23:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:23:19,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 576 [2023-08-30 10:23:19,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 257 transitions, 2720 flow. Second operand has 7 states, 7 states have (on average 259.14285714285717) internal successors, (1814), 7 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:19,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:19,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 576 [2023-08-30 10:23:19,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:20,656 INFO L130 PetriNetUnfolder]: 3456/6284 cut-off events. [2023-08-30 10:23:20,656 INFO L131 PetriNetUnfolder]: For 32330/32330 co-relation queries the response was YES. [2023-08-30 10:23:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26549 conditions, 6284 events. 3456/6284 cut-off events. For 32330/32330 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 43888 event pairs, 412 based on Foata normal form. 730/6552 useless extension candidates. Maximal degree in co-relation 26492. Up to 4288 conditions per place. [2023-08-30 10:23:20,697 INFO L137 encePairwiseOnDemand]: 573/576 looper letters, 202 selfloop transitions, 3 changer transitions 12/224 dead transitions. [2023-08-30 10:23:20,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 224 transitions, 2594 flow [2023-08-30 10:23:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:23:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:23:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1380 transitions. [2023-08-30 10:23:20,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-30 10:23:20,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1380 transitions. [2023-08-30 10:23:20,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1380 transitions. [2023-08-30 10:23:20,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:20,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1380 transitions. [2023-08-30 10:23:20,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:20,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:20,702 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:20,703 INFO L175 Difference]: Start difference. First operand has 171 places, 257 transitions, 2720 flow. Second operand 5 states and 1380 transitions. [2023-08-30 10:23:20,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 224 transitions, 2594 flow [2023-08-30 10:23:20,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 224 transitions, 2404 flow, removed 60 selfloop flow, removed 11 redundant places. [2023-08-30 10:23:20,802 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 1042 flow [2023-08-30 10:23:20,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1042, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2023-08-30 10:23:20,803 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 44 predicate places. [2023-08-30 10:23:20,803 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 1042 flow [2023-08-30 10:23:20,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 259.14285714285717) internal successors, (1814), 7 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:20,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:20,804 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:20,811 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-08-30 10:23:21,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:21,007 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:21,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash 968248295, now seen corresponding path program 1 times [2023-08-30 10:23:21,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:21,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122702938] [2023-08-30 10:23:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122702938] [2023-08-30 10:23:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122702938] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446746453] [2023-08-30 10:23:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:21,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:21,445 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-08-30 10:23:21,448 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-08-30 10:23:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:21,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 10:23:21,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:21,622 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:21,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:21,693 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-08-30 10:23:21,733 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 14 treesize of output 16 [2023-08-30 10:23:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:21,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:21,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:21,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-30 10:23:21,803 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 31 treesize of output 23 [2023-08-30 10:23:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446746453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:21,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-30 10:23:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714219849] [2023-08-30 10:23:21,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:21,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 10:23:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 10:23:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=357, Unknown=2, NotChecked=0, Total=420 [2023-08-30 10:23:23,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 576 [2023-08-30 10:23:23,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 1042 flow. Second operand has 21 states, 21 states have (on average 210.14285714285714) internal successors, (4413), 21 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:23,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:23,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 576 [2023-08-30 10:23:23,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:24,932 INFO L130 PetriNetUnfolder]: 3724/6696 cut-off events. [2023-08-30 10:23:24,932 INFO L131 PetriNetUnfolder]: For 34796/34796 co-relation queries the response was YES. [2023-08-30 10:23:24,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27027 conditions, 6696 events. 3724/6696 cut-off events. For 34796/34796 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 46959 event pairs, 681 based on Foata normal form. 71/6269 useless extension candidates. Maximal degree in co-relation 26978. Up to 2416 conditions per place. [2023-08-30 10:23:24,975 INFO L137 encePairwiseOnDemand]: 563/576 looper letters, 181 selfloop transitions, 65 changer transitions 49/302 dead transitions. [2023-08-30 10:23:24,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 302 transitions, 2594 flow [2023-08-30 10:23:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 10:23:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 10:23:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4188 transitions. [2023-08-30 10:23:24,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3826754385964912 [2023-08-30 10:23:24,978 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4188 transitions. [2023-08-30 10:23:24,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4188 transitions. [2023-08-30 10:23:24,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:24,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4188 transitions. [2023-08-30 10:23:24,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 220.42105263157896) internal successors, (4188), 19 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:24,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 576.0) internal successors, (11520), 20 states have internal predecessors, (11520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:24,992 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 576.0) internal successors, (11520), 20 states have internal predecessors, (11520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:24,992 INFO L175 Difference]: Start difference. First operand has 131 places, 119 transitions, 1042 flow. Second operand 19 states and 4188 transitions. [2023-08-30 10:23:24,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 302 transitions, 2594 flow [2023-08-30 10:23:25,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 302 transitions, 2512 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-30 10:23:25,104 INFO L231 Difference]: Finished difference. Result has 148 places, 135 transitions, 1448 flow [2023-08-30 10:23:25,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1448, PETRI_PLACES=148, PETRI_TRANSITIONS=135} [2023-08-30 10:23:25,104 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 61 predicate places. [2023-08-30 10:23:25,105 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 135 transitions, 1448 flow [2023-08-30 10:23:25,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 210.14285714285714) internal successors, (4413), 21 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:25,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:25,105 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:25,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:25,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:25,306 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:25,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1978053246, now seen corresponding path program 1 times [2023-08-30 10:23:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172421675] [2023-08-30 10:23:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 10:23:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:25,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172421675] [2023-08-30 10:23:25,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172421675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:23:25,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:23:25,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 10:23:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548614043] [2023-08-30 10:23:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:23:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:23:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:25,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:23:25,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 10:23:25,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 576 [2023-08-30 10:23:25,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 135 transitions, 1448 flow. Second operand has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:25,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:25,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 576 [2023-08-30 10:23:25,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:26,168 INFO L130 PetriNetUnfolder]: 2915/5577 cut-off events. [2023-08-30 10:23:26,168 INFO L131 PetriNetUnfolder]: For 40238/40238 co-relation queries the response was YES. [2023-08-30 10:23:26,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24700 conditions, 5577 events. 2915/5577 cut-off events. For 40238/40238 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 40488 event pairs, 818 based on Foata normal form. 0/5219 useless extension candidates. Maximal degree in co-relation 24648. Up to 2808 conditions per place. [2023-08-30 10:23:26,205 INFO L137 encePairwiseOnDemand]: 566/576 looper letters, 221 selfloop transitions, 61 changer transitions 0/289 dead transitions. [2023-08-30 10:23:26,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 289 transitions, 3714 flow [2023-08-30 10:23:26,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:23:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:23:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1349 transitions. [2023-08-30 10:23:26,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684027777777778 [2023-08-30 10:23:26,207 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1349 transitions. [2023-08-30 10:23:26,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1349 transitions. [2023-08-30 10:23:26,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:26,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1349 transitions. [2023-08-30 10:23:26,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 269.8) internal successors, (1349), 5 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:26,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:26,210 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:26,210 INFO L175 Difference]: Start difference. First operand has 148 places, 135 transitions, 1448 flow. Second operand 5 states and 1349 transitions. [2023-08-30 10:23:26,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 289 transitions, 3714 flow [2023-08-30 10:23:26,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 289 transitions, 3401 flow, removed 79 selfloop flow, removed 10 redundant places. [2023-08-30 10:23:26,275 INFO L231 Difference]: Finished difference. Result has 142 places, 189 transitions, 2335 flow [2023-08-30 10:23:26,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2335, PETRI_PLACES=142, PETRI_TRANSITIONS=189} [2023-08-30 10:23:26,276 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 55 predicate places. [2023-08-30 10:23:26,276 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 189 transitions, 2335 flow [2023-08-30 10:23:26,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 251.75) internal successors, (1007), 4 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:26,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:26,277 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:26,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 10:23:26,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:26,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1978053345, now seen corresponding path program 1 times [2023-08-30 10:23:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664191824] [2023-08-30 10:23:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664191824] [2023-08-30 10:23:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664191824] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876358529] [2023-08-30 10:23:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:26,784 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:26,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 10:23:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:26,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 10:23:26,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:26,918 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-08-30 10:23:26,975 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:26,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:26,994 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-08-30 10:23:27,013 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-08-30 10:23:27,081 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 27 treesize of output 20 [2023-08-30 10:23:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:27,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:27,199 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1238 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1238) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-30 10:23:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 10:23:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876358529] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:27,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-30 10:23:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752789379] [2023-08-30 10:23:27,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:27,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 10:23:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:27,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 10:23:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2023-08-30 10:23:27,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 576 [2023-08-30 10:23:27,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 189 transitions, 2335 flow. Second operand has 21 states, 21 states have (on average 191.28571428571428) internal successors, (4017), 21 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:27,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:27,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 576 [2023-08-30 10:23:27,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:28,729 INFO L130 PetriNetUnfolder]: 3208/6158 cut-off events. [2023-08-30 10:23:28,729 INFO L131 PetriNetUnfolder]: For 48029/48029 co-relation queries the response was YES. [2023-08-30 10:23:28,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29352 conditions, 6158 events. 3208/6158 cut-off events. For 48029/48029 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 45539 event pairs, 574 based on Foata normal form. 78/6162 useless extension candidates. Maximal degree in co-relation 29302. Up to 3257 conditions per place. [2023-08-30 10:23:28,771 INFO L137 encePairwiseOnDemand]: 561/576 looper letters, 305 selfloop transitions, 110 changer transitions 20/441 dead transitions. [2023-08-30 10:23:28,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 441 transitions, 5595 flow [2023-08-30 10:23:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 10:23:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 10:23:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2862 transitions. [2023-08-30 10:23:28,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3549107142857143 [2023-08-30 10:23:28,774 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2862 transitions. [2023-08-30 10:23:28,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2862 transitions. [2023-08-30 10:23:28,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:28,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2862 transitions. [2023-08-30 10:23:28,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 204.42857142857142) internal successors, (2862), 14 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:28,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:28,783 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:28,783 INFO L175 Difference]: Start difference. First operand has 142 places, 189 transitions, 2335 flow. Second operand 14 states and 2862 transitions. [2023-08-30 10:23:28,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 441 transitions, 5595 flow [2023-08-30 10:23:28,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 441 transitions, 5541 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 10:23:28,887 INFO L231 Difference]: Finished difference. Result has 163 places, 247 transitions, 3641 flow [2023-08-30 10:23:28,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3641, PETRI_PLACES=163, PETRI_TRANSITIONS=247} [2023-08-30 10:23:28,887 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 76 predicate places. [2023-08-30 10:23:28,887 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 247 transitions, 3641 flow [2023-08-30 10:23:28,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 191.28571428571428) internal successors, (4017), 21 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:28,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:28,888 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:28,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:29,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:29,089 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:29,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1328968160, now seen corresponding path program 1 times [2023-08-30 10:23:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987897801] [2023-08-30 10:23:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:29,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987897801] [2023-08-30 10:23:29,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987897801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:23:29,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:23:29,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:23:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985133000] [2023-08-30 10:23:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:23:29,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 10:23:29,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 10:23:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:23:29,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 576 [2023-08-30 10:23:29,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 247 transitions, 3641 flow. Second operand has 5 states, 5 states have (on average 240.4) internal successors, (1202), 5 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:29,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:29,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 576 [2023-08-30 10:23:29,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:29,879 INFO L130 PetriNetUnfolder]: 1568/3396 cut-off events. [2023-08-30 10:23:29,879 INFO L131 PetriNetUnfolder]: For 35098/35098 co-relation queries the response was YES. [2023-08-30 10:23:29,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17544 conditions, 3396 events. 1568/3396 cut-off events. For 35098/35098 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 24215 event pairs, 317 based on Foata normal form. 347/3657 useless extension candidates. Maximal degree in co-relation 17484. Up to 1537 conditions per place. [2023-08-30 10:23:29,903 INFO L137 encePairwiseOnDemand]: 562/576 looper letters, 220 selfloop transitions, 21 changer transitions 29/276 dead transitions. [2023-08-30 10:23:29,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 276 transitions, 4127 flow [2023-08-30 10:23:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:23:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:23:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1275 transitions. [2023-08-30 10:23:29,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2023-08-30 10:23:29,905 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1275 transitions. [2023-08-30 10:23:29,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1275 transitions. [2023-08-30 10:23:29,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:29,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1275 transitions. [2023-08-30 10:23:29,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:29,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:29,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 576.0) internal successors, (3456), 6 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:29,908 INFO L175 Difference]: Start difference. First operand has 163 places, 247 transitions, 3641 flow. Second operand 5 states and 1275 transitions. [2023-08-30 10:23:29,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 276 transitions, 4127 flow [2023-08-30 10:23:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 276 transitions, 3838 flow, removed 123 selfloop flow, removed 6 redundant places. [2023-08-30 10:23:29,981 INFO L231 Difference]: Finished difference. Result has 159 places, 171 transitions, 2005 flow [2023-08-30 10:23:29,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2005, PETRI_PLACES=159, PETRI_TRANSITIONS=171} [2023-08-30 10:23:29,982 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 72 predicate places. [2023-08-30 10:23:29,982 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 171 transitions, 2005 flow [2023-08-30 10:23:29,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.4) internal successors, (1202), 5 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:29,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:29,982 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:29,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 10:23:29,983 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:29,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:29,983 INFO L85 PathProgramCache]: Analyzing trace with hash 379202507, now seen corresponding path program 2 times [2023-08-30 10:23:29,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:29,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665955263] [2023-08-30 10:23:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:23:30,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665955263] [2023-08-30 10:23:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665955263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034676095] [2023-08-30 10:23:30,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:23:30,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:30,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:30,205 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:30,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 10:23:30,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:23:30,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:23:30,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 10:23:30,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:30,397 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:30,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:30,503 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-08-30 10:23:30,529 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 14 treesize of output 16 [2023-08-30 10:23:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:23:30,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:30,563 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1358) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483649)) is different from false [2023-08-30 10:23:30,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:30,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-30 10:23:30,574 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 31 treesize of output 23 [2023-08-30 10:23:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 2 not checked. [2023-08-30 10:23:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034676095] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:30,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-30 10:23:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082723807] [2023-08-30 10:23:30,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:30,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:23:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:23:30,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2023-08-30 10:23:30,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 576 [2023-08-30 10:23:30,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 171 transitions, 2005 flow. Second operand has 20 states, 20 states have (on average 215.4) internal successors, (4308), 20 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:30,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:30,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 576 [2023-08-30 10:23:30,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:31,449 INFO L130 PetriNetUnfolder]: 1509/3402 cut-off events. [2023-08-30 10:23:31,449 INFO L131 PetriNetUnfolder]: For 31273/31273 co-relation queries the response was YES. [2023-08-30 10:23:31,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18149 conditions, 3402 events. 1509/3402 cut-off events. For 31273/31273 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 25211 event pairs, 252 based on Foata normal form. 17/3346 useless extension candidates. Maximal degree in co-relation 18089. Up to 790 conditions per place. [2023-08-30 10:23:31,474 INFO L137 encePairwiseOnDemand]: 564/576 looper letters, 204 selfloop transitions, 55 changer transitions 6/272 dead transitions. [2023-08-30 10:23:31,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 272 transitions, 3487 flow [2023-08-30 10:23:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 10:23:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 10:23:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2895 transitions. [2023-08-30 10:23:31,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38661858974358976 [2023-08-30 10:23:31,477 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2895 transitions. [2023-08-30 10:23:31,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2895 transitions. [2023-08-30 10:23:31,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:31,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2895 transitions. [2023-08-30 10:23:31,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 222.69230769230768) internal successors, (2895), 13 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:31,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 576.0) internal successors, (8064), 14 states have internal predecessors, (8064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:31,484 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 576.0) internal successors, (8064), 14 states have internal predecessors, (8064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:31,484 INFO L175 Difference]: Start difference. First operand has 159 places, 171 transitions, 2005 flow. Second operand 13 states and 2895 transitions. [2023-08-30 10:23:31,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 272 transitions, 3487 flow [2023-08-30 10:23:31,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 272 transitions, 3468 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-30 10:23:31,555 INFO L231 Difference]: Finished difference. Result has 172 places, 179 transitions, 2229 flow [2023-08-30 10:23:31,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2229, PETRI_PLACES=172, PETRI_TRANSITIONS=179} [2023-08-30 10:23:31,556 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 85 predicate places. [2023-08-30 10:23:31,556 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 179 transitions, 2229 flow [2023-08-30 10:23:31,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 215.4) internal successors, (4308), 20 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:31,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:31,557 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:31,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:31,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:31,758 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:31,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash 379055468, now seen corresponding path program 2 times [2023-08-30 10:23:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683228985] [2023-08-30 10:23:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:23:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683228985] [2023-08-30 10:23:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683228985] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948081712] [2023-08-30 10:23:32,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:23:32,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:32,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:32,137 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:32,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 10:23:32,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:23:32,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:23:32,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 10:23:32,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:32,300 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-08-30 10:23:32,359 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:32,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:32,377 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-08-30 10:23:32,396 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-08-30 10:23:32,471 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 27 treesize of output 20 [2023-08-30 10:23:32,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:23:32,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:32,583 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int))) (or (< v_ArrVal_1440 (+ |c_t_funThread2of2ForFork0_#t~post37#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)))) is different from false [2023-08-30 10:23:32,593 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1440 (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:23:32,618 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1440 (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:23:32,644 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1439 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1440 Int) (v_ArrVal_1442 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1439))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1440)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1442) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|))) (< v_ArrVal_1440 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-30 10:23:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 10:23:32,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948081712] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:32,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:32,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-30 10:23:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660904593] [2023-08-30 10:23:32,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 10:23:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:32,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 10:23:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=244, Unknown=8, NotChecked=140, Total=462 [2023-08-30 10:23:32,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 576 [2023-08-30 10:23:32,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 179 transitions, 2229 flow. Second operand has 22 states, 22 states have (on average 196.27272727272728) internal successors, (4318), 22 states have internal predecessors, (4318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:32,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:32,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 576 [2023-08-30 10:23:32,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:33,795 INFO L130 PetriNetUnfolder]: 1532/3445 cut-off events. [2023-08-30 10:23:33,795 INFO L131 PetriNetUnfolder]: For 33640/33656 co-relation queries the response was YES. [2023-08-30 10:23:33,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18986 conditions, 3445 events. 1532/3445 cut-off events. For 33640/33656 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 25487 event pairs, 319 based on Foata normal form. 13/3385 useless extension candidates. Maximal degree in co-relation 18923. Up to 1688 conditions per place. [2023-08-30 10:23:33,820 INFO L137 encePairwiseOnDemand]: 564/576 looper letters, 157 selfloop transitions, 47 changer transitions 40/250 dead transitions. [2023-08-30 10:23:33,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 250 transitions, 3272 flow [2023-08-30 10:23:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 10:23:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 10:23:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2059 transitions. [2023-08-30 10:23:33,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35746527777777776 [2023-08-30 10:23:33,823 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2059 transitions. [2023-08-30 10:23:33,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2059 transitions. [2023-08-30 10:23:33,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:33,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2059 transitions. [2023-08-30 10:23:33,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 205.9) internal successors, (2059), 10 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:33,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:33,828 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:33,828 INFO L175 Difference]: Start difference. First operand has 172 places, 179 transitions, 2229 flow. Second operand 10 states and 2059 transitions. [2023-08-30 10:23:33,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 250 transitions, 3272 flow [2023-08-30 10:23:33,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 250 transitions, 3191 flow, removed 7 selfloop flow, removed 8 redundant places. [2023-08-30 10:23:33,899 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 2114 flow [2023-08-30 10:23:33,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2114, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2023-08-30 10:23:33,900 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 87 predicate places. [2023-08-30 10:23:33,900 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 2114 flow [2023-08-30 10:23:33,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 196.27272727272728) internal successors, (4318), 22 states have internal predecessors, (4318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:33,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:33,900 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:33,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:34,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:34,101 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:34,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash 586910029, now seen corresponding path program 1 times [2023-08-30 10:23:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102576590] [2023-08-30 10:23:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102576590] [2023-08-30 10:23:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102576590] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805744767] [2023-08-30 10:23:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:34,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:34,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:34,456 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:34,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-30 10:23:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:34,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 10:23:34,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:34,629 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-08-30 10:23:34,715 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:34,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:34,739 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-08-30 10:23:34,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:23:34,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:23:34,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:34,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:23:34,902 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:34,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:23:34,934 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-08-30 10:23:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:34,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:35,092 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1525 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int)) (or (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1526))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1528))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 2147483650)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1525) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)) 0)))) is different from false [2023-08-30 10:23:35,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:35,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:23:35,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:35,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:23:35,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:23:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805744767] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:37,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 10:23:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724782262] [2023-08-30 10:23:37,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:37,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 10:23:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:37,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 10:23:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=388, Unknown=3, NotChecked=40, Total=506 [2023-08-30 10:23:37,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 576 [2023-08-30 10:23:37,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 2114 flow. Second operand has 23 states, 23 states have (on average 194.34782608695653) internal successors, (4470), 23 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:37,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:37,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 576 [2023-08-30 10:23:37,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:41,353 INFO L130 PetriNetUnfolder]: 1369/3115 cut-off events. [2023-08-30 10:23:41,353 INFO L131 PetriNetUnfolder]: For 32479/32485 co-relation queries the response was YES. [2023-08-30 10:23:41,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17366 conditions, 3115 events. 1369/3115 cut-off events. For 32479/32485 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 22886 event pairs, 188 based on Foata normal form. 53/3168 useless extension candidates. Maximal degree in co-relation 17305. Up to 1153 conditions per place. [2023-08-30 10:23:41,377 INFO L137 encePairwiseOnDemand]: 560/576 looper letters, 225 selfloop transitions, 141 changer transitions 0/372 dead transitions. [2023-08-30 10:23:41,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 372 transitions, 5023 flow [2023-08-30 10:23:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 10:23:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 10:23:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6945 transitions. [2023-08-30 10:23:41,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3444940476190476 [2023-08-30 10:23:41,385 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 6945 transitions. [2023-08-30 10:23:41,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 6945 transitions. [2023-08-30 10:23:41,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:41,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 6945 transitions. [2023-08-30 10:23:41,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 198.42857142857142) internal successors, (6945), 35 states have internal predecessors, (6945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:41,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 576.0) internal successors, (20736), 36 states have internal predecessors, (20736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:41,409 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 576.0) internal successors, (20736), 36 states have internal predecessors, (20736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:41,409 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 2114 flow. Second operand 35 states and 6945 transitions. [2023-08-30 10:23:41,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 372 transitions, 5023 flow [2023-08-30 10:23:41,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 372 transitions, 4843 flow, removed 43 selfloop flow, removed 7 redundant places. [2023-08-30 10:23:41,519 INFO L231 Difference]: Finished difference. Result has 208 places, 254 transitions, 3833 flow [2023-08-30 10:23:41,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3833, PETRI_PLACES=208, PETRI_TRANSITIONS=254} [2023-08-30 10:23:41,520 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 121 predicate places. [2023-08-30 10:23:41,520 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 254 transitions, 3833 flow [2023-08-30 10:23:41,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 194.34782608695653) internal successors, (4470), 23 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:41,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:41,521 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:41,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-08-30 10:23:41,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-30 10:23:41,727 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:41,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1345661490, now seen corresponding path program 1 times [2023-08-30 10:23:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211985178] [2023-08-30 10:23:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:41,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211985178] [2023-08-30 10:23:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211985178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370511462] [2023-08-30 10:23:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:42,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:42,093 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:42,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-30 10:23:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:42,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:23:42,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:42,242 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-08-30 10:23:42,323 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:42,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:42,345 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-08-30 10:23:42,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:23:42,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:23:42,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:42,459 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-08-30 10:23:42,508 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-08-30 10:23:42,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:23:42,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:42,582 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:42,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:23:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:42,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:42,750 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1615 (Array Int Int)) (v_ArrVal_1612 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1614 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1615) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_87|)) 0)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1612))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1614))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) 2147483647))) is different from false [2023-08-30 10:23:42,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:42,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:23:42,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:42,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:23:42,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:23:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:23:45,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370511462] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:45,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:45,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 10:23:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95828186] [2023-08-30 10:23:45,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:45,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 10:23:45,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:45,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 10:23:45,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=360, Unknown=5, NotChecked=40, Total=506 [2023-08-30 10:23:45,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 576 [2023-08-30 10:23:45,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 254 transitions, 3833 flow. Second operand has 23 states, 23 states have (on average 194.34782608695653) internal successors, (4470), 23 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:45,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:45,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 576 [2023-08-30 10:23:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:47,029 WARN L839 $PredicateComparison]: unable to prove that (and (< (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647) (forall ((v_ArrVal_1615 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1614 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1615) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_87|)) 0)) (< (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1614)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) 2147483647)))) is different from false [2023-08-30 10:23:47,698 INFO L130 PetriNetUnfolder]: 1491/3351 cut-off events. [2023-08-30 10:23:47,698 INFO L131 PetriNetUnfolder]: For 40686/40692 co-relation queries the response was YES. [2023-08-30 10:23:47,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19702 conditions, 3351 events. 1491/3351 cut-off events. For 40686/40692 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 24758 event pairs, 191 based on Foata normal form. 36/3387 useless extension candidates. Maximal degree in co-relation 19629. Up to 1390 conditions per place. [2023-08-30 10:23:47,727 INFO L137 encePairwiseOnDemand]: 559/576 looper letters, 218 selfloop transitions, 146 changer transitions 0/370 dead transitions. [2023-08-30 10:23:47,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 370 transitions, 5775 flow [2023-08-30 10:23:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 10:23:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 10:23:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4010 transitions. [2023-08-30 10:23:47,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3480902777777778 [2023-08-30 10:23:47,732 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4010 transitions. [2023-08-30 10:23:47,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4010 transitions. [2023-08-30 10:23:47,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:47,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4010 transitions. [2023-08-30 10:23:47,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 200.5) internal successors, (4010), 20 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:47,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 576.0) internal successors, (12096), 21 states have internal predecessors, (12096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:47,745 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 576.0) internal successors, (12096), 21 states have internal predecessors, (12096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:47,745 INFO L175 Difference]: Start difference. First operand has 208 places, 254 transitions, 3833 flow. Second operand 20 states and 4010 transitions. [2023-08-30 10:23:47,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 370 transitions, 5775 flow [2023-08-30 10:23:47,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 370 transitions, 4972 flow, removed 361 selfloop flow, removed 5 redundant places. [2023-08-30 10:23:47,937 INFO L231 Difference]: Finished difference. Result has 226 places, 291 transitions, 4225 flow [2023-08-30 10:23:47,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=3134, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4225, PETRI_PLACES=226, PETRI_TRANSITIONS=291} [2023-08-30 10:23:47,937 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 139 predicate places. [2023-08-30 10:23:47,937 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 291 transitions, 4225 flow [2023-08-30 10:23:47,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 194.34782608695653) internal successors, (4470), 23 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:47,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:47,938 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:47,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:48,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-30 10:23:48,139 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:48,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -8509019, now seen corresponding path program 1 times [2023-08-30 10:23:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693916464] [2023-08-30 10:23:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693916464] [2023-08-30 10:23:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693916464] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68754196] [2023-08-30 10:23:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:48,505 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:48,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-30 10:23:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:48,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 10:23:48,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:48,645 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-08-30 10:23:48,703 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:48,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:48,723 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-08-30 10:23:48,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:23:48,786 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-08-30 10:23:48,820 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:48,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:23:48,863 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-08-30 10:23:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:23:48,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:49,028 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 15 treesize of output 13 [2023-08-30 10:23:49,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 10:23:49,038 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1700 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_89| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1698) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1700) |v_t_funThread1of2ForFork0_~p~0#1.offset_89|) 2147483650)))) is different from false [2023-08-30 10:23:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 10:23:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68754196] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:49,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:49,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-30 10:23:49,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173396198] [2023-08-30 10:23:49,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:49,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 10:23:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 10:23:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=309, Unknown=2, NotChecked=36, Total=420 [2023-08-30 10:23:49,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 576 [2023-08-30 10:23:49,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 291 transitions, 4225 flow. Second operand has 21 states, 21 states have (on average 194.57142857142858) internal successors, (4086), 21 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:49,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:49,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 576 [2023-08-30 10:23:49,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:50,785 INFO L130 PetriNetUnfolder]: 1602/3621 cut-off events. [2023-08-30 10:23:50,785 INFO L131 PetriNetUnfolder]: For 40659/40679 co-relation queries the response was YES. [2023-08-30 10:23:50,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21759 conditions, 3621 events. 1602/3621 cut-off events. For 40659/40679 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 27636 event pairs, 260 based on Foata normal form. 32/3650 useless extension candidates. Maximal degree in co-relation 21679. Up to 2219 conditions per place. [2023-08-30 10:23:50,817 INFO L137 encePairwiseOnDemand]: 560/576 looper letters, 283 selfloop transitions, 95 changer transitions 0/384 dead transitions. [2023-08-30 10:23:50,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 384 transitions, 6033 flow [2023-08-30 10:23:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 10:23:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 10:23:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2806 transitions. [2023-08-30 10:23:50,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3479662698412698 [2023-08-30 10:23:50,820 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2806 transitions. [2023-08-30 10:23:50,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2806 transitions. [2023-08-30 10:23:50,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:50,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2806 transitions. [2023-08-30 10:23:50,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 200.42857142857142) internal successors, (2806), 14 states have internal predecessors, (2806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:50,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:50,826 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 576.0) internal successors, (8640), 15 states have internal predecessors, (8640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:50,826 INFO L175 Difference]: Start difference. First operand has 226 places, 291 transitions, 4225 flow. Second operand 14 states and 2806 transitions. [2023-08-30 10:23:50,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 384 transitions, 6033 flow [2023-08-30 10:23:51,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 384 transitions, 5671 flow, removed 88 selfloop flow, removed 15 redundant places. [2023-08-30 10:23:51,017 INFO L231 Difference]: Finished difference. Result has 233 places, 326 transitions, 4867 flow [2023-08-30 10:23:51,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=3889, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4867, PETRI_PLACES=233, PETRI_TRANSITIONS=326} [2023-08-30 10:23:51,017 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 146 predicate places. [2023-08-30 10:23:51,017 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 326 transitions, 4867 flow [2023-08-30 10:23:51,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 194.57142857142858) internal successors, (4086), 21 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:51,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:51,018 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:51,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:51,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-30 10:23:51,219 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:51,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1290197809, now seen corresponding path program 2 times [2023-08-30 10:23:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908944669] [2023-08-30 10:23:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908944669] [2023-08-30 10:23:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908944669] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383241838] [2023-08-30 10:23:51,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:23:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:51,493 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:51,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-30 10:23:51,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:23:51,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:23:51,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 10:23:51,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:51,699 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-08-30 10:23:51,767 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:51,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:51,792 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-08-30 10:23:51,821 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-08-30 10:23:51,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:23:51,891 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:51,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:23:51,951 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-08-30 10:23:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:52,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:52,097 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 15 treesize of output 13 [2023-08-30 10:23:52,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 10:23:52,144 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 Int) (v_ArrVal_1781 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_91| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_91| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1781) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1785) |v_t_funThread1of2ForFork0_~p~0#1.offset_91|))))) is different from false [2023-08-30 10:23:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 10:23:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383241838] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:52,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 10:23:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298212150] [2023-08-30 10:23:52,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:52,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:23:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:23:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2023-08-30 10:23:52,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 576 [2023-08-30 10:23:52,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 326 transitions, 4867 flow. Second operand has 20 states, 20 states have (on average 195.6) internal successors, (3912), 20 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:52,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:52,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 576 [2023-08-30 10:23:52,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:54,593 INFO L130 PetriNetUnfolder]: 1802/4037 cut-off events. [2023-08-30 10:23:54,594 INFO L131 PetriNetUnfolder]: For 46708/46728 co-relation queries the response was YES. [2023-08-30 10:23:54,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25052 conditions, 4037 events. 1802/4037 cut-off events. For 46708/46728 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 31503 event pairs, 260 based on Foata normal form. 42/4076 useless extension candidates. Maximal degree in co-relation 24967. Up to 2333 conditions per place. [2023-08-30 10:23:54,631 INFO L137 encePairwiseOnDemand]: 560/576 looper letters, 324 selfloop transitions, 131 changer transitions 0/461 dead transitions. [2023-08-30 10:23:54,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 461 transitions, 7284 flow [2023-08-30 10:23:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 10:23:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 10:23:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5008 transitions. [2023-08-30 10:23:54,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3477777777777778 [2023-08-30 10:23:54,636 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5008 transitions. [2023-08-30 10:23:54,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5008 transitions. [2023-08-30 10:23:54,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:54,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5008 transitions. [2023-08-30 10:23:54,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 200.32) internal successors, (5008), 25 states have internal predecessors, (5008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:54,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 576.0) internal successors, (14976), 26 states have internal predecessors, (14976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:54,646 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 576.0) internal successors, (14976), 26 states have internal predecessors, (14976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:54,646 INFO L175 Difference]: Start difference. First operand has 233 places, 326 transitions, 4867 flow. Second operand 25 states and 5008 transitions. [2023-08-30 10:23:54,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 461 transitions, 7284 flow [2023-08-30 10:23:54,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 461 transitions, 7198 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-30 10:23:54,829 INFO L231 Difference]: Finished difference. Result has 262 places, 365 transitions, 5956 flow [2023-08-30 10:23:54,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=4793, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5956, PETRI_PLACES=262, PETRI_TRANSITIONS=365} [2023-08-30 10:23:54,830 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 175 predicate places. [2023-08-30 10:23:54,830 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 365 transitions, 5956 flow [2023-08-30 10:23:54,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 195.6) internal successors, (3912), 20 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:54,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:54,831 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:54,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:55,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:55,032 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:55,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1036075333, now seen corresponding path program 3 times [2023-08-30 10:23:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299526868] [2023-08-30 10:23:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:55,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299526868] [2023-08-30 10:23:55,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299526868] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494745480] [2023-08-30 10:23:55,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 10:23:55,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:55,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:55,289 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:55,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-30 10:23:55,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 10:23:55,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:23:55,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 10:23:55,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:55,470 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-08-30 10:23:55,528 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:55,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:55,545 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-08-30 10:23:55,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:23:55,637 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-08-30 10:23:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:55,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:55,854 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1866 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1866) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483650))) is different from false [2023-08-30 10:23:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 10:23:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494745480] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:55,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:55,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 18 [2023-08-30 10:23:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406523586] [2023-08-30 10:23:55,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:23:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:55,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:23:55,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=261, Unknown=1, NotChecked=34, Total=380 [2023-08-30 10:23:56,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 576 [2023-08-30 10:23:56,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 365 transitions, 5956 flow. Second operand has 20 states, 20 states have (on average 213.6) internal successors, (4272), 20 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:56,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:56,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 576 [2023-08-30 10:23:56,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:57,686 INFO L130 PetriNetUnfolder]: 1801/4053 cut-off events. [2023-08-30 10:23:57,686 INFO L131 PetriNetUnfolder]: For 52692/52706 co-relation queries the response was YES. [2023-08-30 10:23:57,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26187 conditions, 4053 events. 1801/4053 cut-off events. For 52692/52706 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 31627 event pairs, 328 based on Foata normal form. 3/4053 useless extension candidates. Maximal degree in co-relation 26093. Up to 2727 conditions per place. [2023-08-30 10:23:57,728 INFO L137 encePairwiseOnDemand]: 562/576 looper letters, 316 selfloop transitions, 88 changer transitions 0/410 dead transitions. [2023-08-30 10:23:57,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 410 transitions, 7211 flow [2023-08-30 10:23:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 10:23:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 10:23:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3269 transitions. [2023-08-30 10:23:57,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3783564814814815 [2023-08-30 10:23:57,732 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3269 transitions. [2023-08-30 10:23:57,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3269 transitions. [2023-08-30 10:23:57,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:57,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3269 transitions. [2023-08-30 10:23:57,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 217.93333333333334) internal successors, (3269), 15 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:57,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 576.0) internal successors, (9216), 16 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:57,739 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 576.0) internal successors, (9216), 16 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:57,739 INFO L175 Difference]: Start difference. First operand has 262 places, 365 transitions, 5956 flow. Second operand 15 states and 3269 transitions. [2023-08-30 10:23:57,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 410 transitions, 7211 flow [2023-08-30 10:23:57,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 410 transitions, 6986 flow, removed 51 selfloop flow, removed 11 redundant places. [2023-08-30 10:23:57,971 INFO L231 Difference]: Finished difference. Result has 269 places, 373 transitions, 6135 flow [2023-08-30 10:23:57,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=5720, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6135, PETRI_PLACES=269, PETRI_TRANSITIONS=373} [2023-08-30 10:23:57,972 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 182 predicate places. [2023-08-30 10:23:57,972 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 373 transitions, 6135 flow [2023-08-30 10:23:57,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 213.6) internal successors, (4272), 20 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:23:57,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:57,973 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:23:57,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-30 10:23:58,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:58,174 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:23:58,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1036075331, now seen corresponding path program 1 times [2023-08-30 10:23:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996884147] [2023-08-30 10:23:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:58,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996884147] [2023-08-30 10:23:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996884147] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380063812] [2023-08-30 10:23:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:58,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:58,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:58,537 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:23:58,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-30 10:23:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:58,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:23:58,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:58,729 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-08-30 10:23:58,821 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:58,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:23:58,857 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-08-30 10:23:58,888 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-08-30 10:23:58,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:23:58,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:23:58,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:59,007 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-08-30 10:23:59,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:23:59,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:23:59,084 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:59,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:23:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:23:59,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:59,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1955 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_95| Int) (v_ArrVal_1953 Int)) (or (< (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1953)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_95|) 2147483647) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1955) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_95| 4)) 0)))) is different from false [2023-08-30 10:23:59,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:59,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:23:59,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:59,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:23:59,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:24:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:24:01,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380063812] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:01,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:01,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 10:24:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543743407] [2023-08-30 10:24:01,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:01,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 10:24:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 10:24:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=358, Unknown=1, NotChecked=40, Total=506 [2023-08-30 10:24:01,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 576 [2023-08-30 10:24:01,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 373 transitions, 6135 flow. Second operand has 23 states, 23 states have (on average 194.34782608695653) internal successors, (4470), 23 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:01,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:01,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 576 [2023-08-30 10:24:01,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:03,889 INFO L130 PetriNetUnfolder]: 1804/4069 cut-off events. [2023-08-30 10:24:03,889 INFO L131 PetriNetUnfolder]: For 52331/52345 co-relation queries the response was YES. [2023-08-30 10:24:03,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26191 conditions, 4069 events. 1804/4069 cut-off events. For 52331/52345 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 31829 event pairs, 317 based on Foata normal form. 8/4074 useless extension candidates. Maximal degree in co-relation 26093. Up to 2549 conditions per place. [2023-08-30 10:24:03,934 INFO L137 encePairwiseOnDemand]: 563/576 looper letters, 309 selfloop transitions, 113 changer transitions 0/428 dead transitions. [2023-08-30 10:24:03,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 428 transitions, 7504 flow [2023-08-30 10:24:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 10:24:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 10:24:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3199 transitions. [2023-08-30 10:24:03,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3471137152777778 [2023-08-30 10:24:03,938 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3199 transitions. [2023-08-30 10:24:03,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3199 transitions. [2023-08-30 10:24:03,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:03,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3199 transitions. [2023-08-30 10:24:03,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 199.9375) internal successors, (3199), 16 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:03,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 576.0) internal successors, (9792), 17 states have internal predecessors, (9792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:03,945 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 576.0) internal successors, (9792), 17 states have internal predecessors, (9792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:03,945 INFO L175 Difference]: Start difference. First operand has 269 places, 373 transitions, 6135 flow. Second operand 16 states and 3199 transitions. [2023-08-30 10:24:03,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 428 transitions, 7504 flow [2023-08-30 10:24:04,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 428 transitions, 7289 flow, removed 18 selfloop flow, removed 11 redundant places. [2023-08-30 10:24:04,177 INFO L231 Difference]: Finished difference. Result has 277 places, 381 transitions, 6412 flow [2023-08-30 10:24:04,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=5836, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6412, PETRI_PLACES=277, PETRI_TRANSITIONS=381} [2023-08-30 10:24:04,177 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 190 predicate places. [2023-08-30 10:24:04,177 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 381 transitions, 6412 flow [2023-08-30 10:24:04,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 194.34782608695653) internal successors, (4470), 23 states have internal predecessors, (4470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:04,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:04,178 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:04,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-30 10:24:04,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-08-30 10:24:04,379 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:04,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 264256334, now seen corresponding path program 2 times [2023-08-30 10:24:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184102464] [2023-08-30 10:24:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 10:24:04,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:04,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184102464] [2023-08-30 10:24:04,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184102464] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:04,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216564305] [2023-08-30 10:24:04,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:24:04,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:04,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:04,737 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:24:04,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-30 10:24:04,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:24:04,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:24:04,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:24:04,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:04,939 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-08-30 10:24:05,096 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:05,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:24:05,139 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-08-30 10:24:05,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:24:05,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:24:05,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:24:05,349 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-08-30 10:24:05,445 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:05,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:24:05,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 18 treesize of output 13 [2023-08-30 10:24:05,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:24:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:05,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:05,746 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2044 Int) (v_ArrVal_2046 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2044)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2042) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)) 0)))) is different from false [2023-08-30 10:24:05,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:05,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:24:05,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:05,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:24:05,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:24:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 10:24:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216564305] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:08,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2023-08-30 10:24:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866246082] [2023-08-30 10:24:08,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:08,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 10:24:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 10:24:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=415, Unknown=15, NotChecked=42, Total=552 [2023-08-30 10:24:09,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 576 [2023-08-30 10:24:09,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 381 transitions, 6412 flow. Second operand has 24 states, 24 states have (on average 194.45833333333334) internal successors, (4667), 24 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:09,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:09,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 576 [2023-08-30 10:24:09,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:10,349 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2044 Int) (v_ArrVal_2046 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2044)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2044 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2046 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_97| v_ArrVal_2044)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|) 2147483650)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_97| |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2044 Int) (v_ArrVal_2046 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2044)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-30 10:24:11,422 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2046 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))) (< 0 (+ 2147483650 (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2044 Int) (v_ArrVal_2046 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2044)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_97|)) 0)))) (forall ((v_ArrVal_2044 Int) (v_ArrVal_2046 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2044)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2046) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-30 10:24:15,271 INFO L130 PetriNetUnfolder]: 2051/4725 cut-off events. [2023-08-30 10:24:15,271 INFO L131 PetriNetUnfolder]: For 57142/57162 co-relation queries the response was YES. [2023-08-30 10:24:15,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30431 conditions, 4725 events. 2051/4725 cut-off events. For 57142/57162 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 39058 event pairs, 286 based on Foata normal form. 16/4741 useless extension candidates. Maximal degree in co-relation 30331. Up to 2104 conditions per place. [2023-08-30 10:24:15,326 INFO L137 encePairwiseOnDemand]: 554/576 looper letters, 413 selfloop transitions, 244 changer transitions 0/663 dead transitions. [2023-08-30 10:24:15,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 663 transitions, 10783 flow [2023-08-30 10:24:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-30 10:24:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-30 10:24:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7387 transitions. [2023-08-30 10:24:15,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3466122372372372 [2023-08-30 10:24:15,331 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 7387 transitions. [2023-08-30 10:24:15,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 7387 transitions. [2023-08-30 10:24:15,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:15,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 7387 transitions. [2023-08-30 10:24:15,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 199.64864864864865) internal successors, (7387), 37 states have internal predecessors, (7387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:15,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 576.0) internal successors, (21888), 38 states have internal predecessors, (21888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:15,348 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 576.0) internal successors, (21888), 38 states have internal predecessors, (21888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:15,348 INFO L175 Difference]: Start difference. First operand has 277 places, 381 transitions, 6412 flow. Second operand 37 states and 7387 transitions. [2023-08-30 10:24:15,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 663 transitions, 10783 flow [2023-08-30 10:24:15,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 663 transitions, 10510 flow, removed 50 selfloop flow, removed 14 redundant places. [2023-08-30 10:24:15,684 INFO L231 Difference]: Finished difference. Result has 313 places, 484 transitions, 8567 flow [2023-08-30 10:24:15,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=6140, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=8567, PETRI_PLACES=313, PETRI_TRANSITIONS=484} [2023-08-30 10:24:15,685 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 226 predicate places. [2023-08-30 10:24:15,685 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 484 transitions, 8567 flow [2023-08-30 10:24:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 194.45833333333334) internal successors, (4667), 24 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:15,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:15,686 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:15,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-30 10:24:15,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-08-30 10:24:15,887 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:15,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash -556016170, now seen corresponding path program 4 times [2023-08-30 10:24:15,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:15,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14995047] [2023-08-30 10:24:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:24:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14995047] [2023-08-30 10:24:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14995047] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026898778] [2023-08-30 10:24:16,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 10:24:16,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:16,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:16,319 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:24:16,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-30 10:24:16,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 10:24:16,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:24:16,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 10:24:16,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:16,487 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-08-30 10:24:16,579 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:16,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:24:16,603 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-08-30 10:24:16,634 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-08-30 10:24:16,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:24:16,723 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:16,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:24:16,807 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-08-30 10:24:16,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:24:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:24:16,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:17,017 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 15 treesize of output 13 [2023-08-30 10:24:17,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 10:24:17,029 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2134 Int) (v_ArrVal_2136 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99| v_ArrVal_2134)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2136) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|))))) is different from false [2023-08-30 10:24:17,056 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2134 Int) (v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2131))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99| v_ArrVal_2134))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2136) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|))) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_99|))) is different from false [2023-08-30 10:24:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 10:24:17,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026898778] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:17,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:17,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-30 10:24:17,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821132687] [2023-08-30 10:24:17,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:17,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 10:24:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:17,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 10:24:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=305, Unknown=10, NotChecked=74, Total=462 [2023-08-30 10:24:17,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 576 [2023-08-30 10:24:17,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 484 transitions, 8567 flow. Second operand has 22 states, 22 states have (on average 194.54545454545453) internal successors, (4280), 22 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:17,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:17,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 576 [2023-08-30 10:24:17,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:18,261 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2136 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2136) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483650))) (forall ((v_ArrVal_2134 Int) (v_ArrVal_2136 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2134)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2136) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-08-30 10:24:19,787 INFO L130 PetriNetUnfolder]: 2088/4855 cut-off events. [2023-08-30 10:24:19,787 INFO L131 PetriNetUnfolder]: For 78876/78892 co-relation queries the response was YES. [2023-08-30 10:24:19,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36145 conditions, 4855 events. 2088/4855 cut-off events. For 78876/78892 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 40982 event pairs, 324 based on Foata normal form. 18/4867 useless extension candidates. Maximal degree in co-relation 36034. Up to 2928 conditions per place. [2023-08-30 10:24:19,849 INFO L137 encePairwiseOnDemand]: 555/576 looper letters, 422 selfloop transitions, 169 changer transitions 0/597 dead transitions. [2023-08-30 10:24:19,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 597 transitions, 11192 flow [2023-08-30 10:24:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 10:24:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 10:24:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4391 transitions. [2023-08-30 10:24:19,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346511994949495 [2023-08-30 10:24:19,853 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4391 transitions. [2023-08-30 10:24:19,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4391 transitions. [2023-08-30 10:24:19,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:19,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4391 transitions. [2023-08-30 10:24:19,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 199.5909090909091) internal successors, (4391), 22 states have internal predecessors, (4391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:19,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 576.0) internal successors, (13248), 23 states have internal predecessors, (13248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:19,863 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 576.0) internal successors, (13248), 23 states have internal predecessors, (13248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:19,864 INFO L175 Difference]: Start difference. First operand has 313 places, 484 transitions, 8567 flow. Second operand 22 states and 4391 transitions. [2023-08-30 10:24:19,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 597 transitions, 11192 flow [2023-08-30 10:24:20,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 597 transitions, 10930 flow, removed 47 selfloop flow, removed 14 redundant places. [2023-08-30 10:24:20,402 INFO L231 Difference]: Finished difference. Result has 327 places, 511 transitions, 9473 flow [2023-08-30 10:24:20,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=8316, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9473, PETRI_PLACES=327, PETRI_TRANSITIONS=511} [2023-08-30 10:24:20,403 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 240 predicate places. [2023-08-30 10:24:20,403 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 511 transitions, 9473 flow [2023-08-30 10:24:20,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 194.54545454545453) internal successors, (4280), 22 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:20,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:20,404 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:20,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-30 10:24:20,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:20,613 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:20,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 591047615, now seen corresponding path program 2 times [2023-08-30 10:24:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334376795] [2023-08-30 10:24:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:24:21,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334376795] [2023-08-30 10:24:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334376795] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:21,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43297311] [2023-08-30 10:24:21,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:24:21,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:21,316 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:24:21,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-30 10:24:21,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:24:21,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:24:21,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 10:24:21,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:21,487 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-08-30 10:24:21,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:21,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:24:21,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:24:21,580 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-08-30 10:24:21,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:24:21,654 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:21,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:24:21,704 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-08-30 10:24:21,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:24:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 10:24:21,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:21,789 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2226 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2226) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:24:21,875 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 15 treesize of output 13 [2023-08-30 10:24:21,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 10:24:21,932 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_101| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_101| Int) (v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2224 Int) (v_ArrVal_2221 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_101| |v_t_funThread2of2ForFork0_~p~0#1.offset_101|) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2221))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_101| v_ArrVal_2224))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2226) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_101|) 2147483647))) is different from false [2023-08-30 10:24:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 10:24:22,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43297311] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:22,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:22,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 22 [2023-08-30 10:24:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643487462] [2023-08-30 10:24:22,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:22,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 10:24:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 10:24:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=8, NotChecked=82, Total=552 [2023-08-30 10:24:22,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 576 [2023-08-30 10:24:22,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 511 transitions, 9473 flow. Second operand has 24 states, 24 states have (on average 187.41666666666666) internal successors, (4498), 24 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:22,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:22,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 576 [2023-08-30 10:24:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:24,207 INFO L130 PetriNetUnfolder]: 2104/4906 cut-off events. [2023-08-30 10:24:24,208 INFO L131 PetriNetUnfolder]: For 91795/91815 co-relation queries the response was YES. [2023-08-30 10:24:24,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38498 conditions, 4906 events. 2104/4906 cut-off events. For 91795/91815 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 41268 event pairs, 374 based on Foata normal form. 22/4922 useless extension candidates. Maximal degree in co-relation 38380. Up to 3385 conditions per place. [2023-08-30 10:24:24,266 INFO L137 encePairwiseOnDemand]: 562/576 looper letters, 435 selfloop transitions, 165 changer transitions 0/606 dead transitions. [2023-08-30 10:24:24,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 606 transitions, 12014 flow [2023-08-30 10:24:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 10:24:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 10:24:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2897 transitions. [2023-08-30 10:24:24,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3353009259259259 [2023-08-30 10:24:24,268 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2897 transitions. [2023-08-30 10:24:24,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2897 transitions. [2023-08-30 10:24:24,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:24,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2897 transitions. [2023-08-30 10:24:24,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 193.13333333333333) internal successors, (2897), 15 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:24,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 576.0) internal successors, (9216), 16 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:24,274 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 576.0) internal successors, (9216), 16 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:24,274 INFO L175 Difference]: Start difference. First operand has 327 places, 511 transitions, 9473 flow. Second operand 15 states and 2897 transitions. [2023-08-30 10:24:24,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 606 transitions, 12014 flow [2023-08-30 10:24:24,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 606 transitions, 11785 flow, removed 20 selfloop flow, removed 15 redundant places. [2023-08-30 10:24:24,710 INFO L231 Difference]: Finished difference. Result has 332 places, 546 transitions, 10532 flow [2023-08-30 10:24:24,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=9227, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10532, PETRI_PLACES=332, PETRI_TRANSITIONS=546} [2023-08-30 10:24:24,711 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 245 predicate places. [2023-08-30 10:24:24,711 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 546 transitions, 10532 flow [2023-08-30 10:24:24,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 187.41666666666666) internal successors, (4498), 24 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:24,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:24,712 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:24,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-30 10:24:24,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:24,912 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:24,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1270719124, now seen corresponding path program 1 times [2023-08-30 10:24:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579810543] [2023-08-30 10:24:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:25,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579810543] [2023-08-30 10:24:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579810543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:24:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:24:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 10:24:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670446150] [2023-08-30 10:24:25,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:24:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:24:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:24:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:24:25,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 576 [2023-08-30 10:24:25,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 546 transitions, 10532 flow. Second operand has 8 states, 8 states have (on average 242.75) internal successors, (1942), 8 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:25,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:25,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 576 [2023-08-30 10:24:25,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:26,900 INFO L130 PetriNetUnfolder]: 2247/5194 cut-off events. [2023-08-30 10:24:26,901 INFO L131 PetriNetUnfolder]: For 117073/117093 co-relation queries the response was YES. [2023-08-30 10:24:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43712 conditions, 5194 events. 2247/5194 cut-off events. For 117073/117093 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 44073 event pairs, 477 based on Foata normal form. 12/5200 useless extension candidates. Maximal degree in co-relation 43589. Up to 3263 conditions per place. [2023-08-30 10:24:26,966 INFO L137 encePairwiseOnDemand]: 564/576 looper letters, 452 selfloop transitions, 183 changer transitions 0/641 dead transitions. [2023-08-30 10:24:26,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 641 transitions, 13500 flow [2023-08-30 10:24:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 10:24:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 10:24:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2513 transitions. [2023-08-30 10:24:26,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362847222222222 [2023-08-30 10:24:26,968 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2513 transitions. [2023-08-30 10:24:26,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2513 transitions. [2023-08-30 10:24:26,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:26,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2513 transitions. [2023-08-30 10:24:26,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 251.3) internal successors, (2513), 10 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:26,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:26,974 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:26,974 INFO L175 Difference]: Start difference. First operand has 332 places, 546 transitions, 10532 flow. Second operand 10 states and 2513 transitions. [2023-08-30 10:24:26,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 641 transitions, 13500 flow [2023-08-30 10:24:27,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 641 transitions, 13211 flow, removed 47 selfloop flow, removed 2 redundant places. [2023-08-30 10:24:27,615 INFO L231 Difference]: Finished difference. Result has 343 places, 576 transitions, 11666 flow [2023-08-30 10:24:27,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=10320, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11666, PETRI_PLACES=343, PETRI_TRANSITIONS=576} [2023-08-30 10:24:27,616 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 256 predicate places. [2023-08-30 10:24:27,616 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 576 transitions, 11666 flow [2023-08-30 10:24:27,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 242.75) internal successors, (1942), 8 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:27,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:27,617 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:27,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-08-30 10:24:27,617 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:27,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1580007767, now seen corresponding path program 1 times [2023-08-30 10:24:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218944109] [2023-08-30 10:24:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:28,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218944109] [2023-08-30 10:24:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218944109] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:28,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505909794] [2023-08-30 10:24:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:28,390 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:24:28,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-30 10:24:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:28,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 10:24:28,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:28,560 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-08-30 10:24:28,617 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:28,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:24:28,633 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-08-30 10:24:28,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:24:28,692 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-08-30 10:24:28,726 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:28,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:24:28,775 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-08-30 10:24:28,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-08-30 10:24:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:28,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:29,034 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 15 treesize of output 13 [2023-08-30 10:24:29,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-30 10:24:29,043 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2367 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_103| Int)) (or (<= 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2366) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_103| v_ArrVal_2367) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 2147483648)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_103| |v_t_funThread2of2ForFork0_~p~0#1.offset_103|))) is different from false [2023-08-30 10:24:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 10:24:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505909794] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:29,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2023-08-30 10:24:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751472972] [2023-08-30 10:24:29,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:29,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 10:24:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 10:24:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=466, Unknown=3, NotChecked=44, Total=600 [2023-08-30 10:24:29,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 576 [2023-08-30 10:24:29,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 576 transitions, 11666 flow. Second operand has 25 states, 25 states have (on average 183.36) internal successors, (4584), 25 states have internal predecessors, (4584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:29,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:29,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 576 [2023-08-30 10:24:29,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:33,737 INFO L130 PetriNetUnfolder]: 2718/6199 cut-off events. [2023-08-30 10:24:33,737 INFO L131 PetriNetUnfolder]: For 147216/147252 co-relation queries the response was YES. [2023-08-30 10:24:33,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54180 conditions, 6199 events. 2718/6199 cut-off events. For 147216/147252 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 53977 event pairs, 340 based on Foata normal form. 50/6249 useless extension candidates. Maximal degree in co-relation 54053. Up to 3135 conditions per place. [2023-08-30 10:24:33,818 INFO L137 encePairwiseOnDemand]: 558/576 looper letters, 551 selfloop transitions, 304 changer transitions 17/878 dead transitions. [2023-08-30 10:24:33,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 878 transitions, 18609 flow [2023-08-30 10:24:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-30 10:24:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-30 10:24:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 7154 transitions. [2023-08-30 10:24:33,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32684576023391815 [2023-08-30 10:24:33,823 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 7154 transitions. [2023-08-30 10:24:33,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 7154 transitions. [2023-08-30 10:24:33,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:33,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 7154 transitions. [2023-08-30 10:24:33,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 188.26315789473685) internal successors, (7154), 38 states have internal predecessors, (7154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:33,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 576.0) internal successors, (22464), 39 states have internal predecessors, (22464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:33,838 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 576.0) internal successors, (22464), 39 states have internal predecessors, (22464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:33,838 INFO L175 Difference]: Start difference. First operand has 343 places, 576 transitions, 11666 flow. Second operand 38 states and 7154 transitions. [2023-08-30 10:24:33,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 878 transitions, 18609 flow [2023-08-30 10:24:34,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 878 transitions, 18257 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-08-30 10:24:34,654 INFO L231 Difference]: Finished difference. Result has 390 places, 696 transitions, 15187 flow [2023-08-30 10:24:34,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=11419, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=15187, PETRI_PLACES=390, PETRI_TRANSITIONS=696} [2023-08-30 10:24:34,655 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 303 predicate places. [2023-08-30 10:24:34,655 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 696 transitions, 15187 flow [2023-08-30 10:24:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 183.36) internal successors, (4584), 25 states have internal predecessors, (4584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:34,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:34,656 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:34,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-08-30 10:24:34,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:34,863 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:34,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 169730302, now seen corresponding path program 2 times [2023-08-30 10:24:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393940927] [2023-08-30 10:24:34,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393940927] [2023-08-30 10:24:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393940927] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872331207] [2023-08-30 10:24:35,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:24:35,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:35,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:35,230 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:24:35,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-30 10:24:35,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:24:35,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:24:35,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:24:35,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:35,460 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:35,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:24:35,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:24:35,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:24:35,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:24:35,584 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-08-30 10:24:35,613 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 14 treesize of output 16 [2023-08-30 10:24:35,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:35,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:24:35,703 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 19 treesize of output 18 [2023-08-30 10:24:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:35,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:37,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:37,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2023-08-30 10:24:37,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:37,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 203 [2023-08-30 10:24:37,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2023-08-30 10:24:37,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2023-08-30 10:24:38,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:38,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:24:38,198 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 39 treesize of output 27 [2023-08-30 10:24:38,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:38,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:24:38,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 10:24:38,215 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 10:24:38,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 12 [2023-08-30 10:24:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872331207] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:38,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-30 10:24:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356231194] [2023-08-30 10:24:38,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 10:24:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 10:24:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=764, Unknown=2, NotChecked=0, Total=870 [2023-08-30 10:24:41,585 WARN L539 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-08-30 10:24:43,655 WARN L539 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-08-30 10:24:46,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 576 [2023-08-30 10:24:46,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 696 transitions, 15187 flow. Second operand has 30 states, 30 states have (on average 183.2) internal successors, (5496), 30 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:46,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:46,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 576 [2023-08-30 10:24:46,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:50,097 INFO L130 PetriNetUnfolder]: 3302/7492 cut-off events. [2023-08-30 10:24:50,097 INFO L131 PetriNetUnfolder]: For 284323/284371 co-relation queries the response was YES. [2023-08-30 10:24:50,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74494 conditions, 7492 events. 3302/7492 cut-off events. For 284323/284371 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 66722 event pairs, 331 based on Foata normal form. 36/7520 useless extension candidates. Maximal degree in co-relation 74353. Up to 2095 conditions per place. [2023-08-30 10:24:50,225 INFO L137 encePairwiseOnDemand]: 557/576 looper letters, 762 selfloop transitions, 365 changer transitions 49/1182 dead transitions. [2023-08-30 10:24:50,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 1182 transitions, 26932 flow [2023-08-30 10:24:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-30 10:24:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-30 10:24:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 6060 transitions. [2023-08-30 10:24:50,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3287760416666667 [2023-08-30 10:24:50,230 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 6060 transitions. [2023-08-30 10:24:50,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 6060 transitions. [2023-08-30 10:24:50,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:50,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 6060 transitions. [2023-08-30 10:24:50,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 189.375) internal successors, (6060), 32 states have internal predecessors, (6060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:50,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 576.0) internal successors, (19008), 33 states have internal predecessors, (19008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:50,252 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 576.0) internal successors, (19008), 33 states have internal predecessors, (19008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:50,252 INFO L175 Difference]: Start difference. First operand has 390 places, 696 transitions, 15187 flow. Second operand 32 states and 6060 transitions. [2023-08-30 10:24:50,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 1182 transitions, 26932 flow [2023-08-30 10:24:52,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1182 transitions, 26589 flow, removed 147 selfloop flow, removed 7 redundant places. [2023-08-30 10:24:52,034 INFO L231 Difference]: Finished difference. Result has 430 places, 833 transitions, 19458 flow [2023-08-30 10:24:52,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=14905, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=19458, PETRI_PLACES=430, PETRI_TRANSITIONS=833} [2023-08-30 10:24:52,035 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 343 predicate places. [2023-08-30 10:24:52,035 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 833 transitions, 19458 flow [2023-08-30 10:24:52,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 183.2) internal successors, (5496), 30 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:52,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:52,036 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:24:52,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-30 10:24:52,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-08-30 10:24:52,246 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:24:52,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1839147102, now seen corresponding path program 1 times [2023-08-30 10:24:52,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:52,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714200091] [2023-08-30 10:24:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714200091] [2023-08-30 10:24:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714200091] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280667736] [2023-08-30 10:24:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:53,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:53,175 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:24:53,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-30 10:24:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:53,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 10:24:53,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:53,399 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-08-30 10:24:53,476 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:53,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:24:53,496 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-08-30 10:24:53,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:24:53,616 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 24 treesize of output 17 [2023-08-30 10:24:53,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-30 10:24:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:24:53,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:53,933 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2561 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2561))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:24:53,949 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2561 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2561) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|))) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:24:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 10:24:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280667736] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:54,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-30 10:24:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606938170] [2023-08-30 10:24:54,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:54,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 10:24:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 10:24:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=649, Unknown=2, NotChecked=106, Total=870 [2023-08-30 10:24:54,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 576 [2023-08-30 10:24:54,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 833 transitions, 19458 flow. Second operand has 30 states, 30 states have (on average 183.2) internal successors, (5496), 30 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:54,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:54,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 576 [2023-08-30 10:24:54,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:24:58,857 INFO L130 PetriNetUnfolder]: 3326/7606 cut-off events. [2023-08-30 10:24:58,857 INFO L131 PetriNetUnfolder]: For 440404/440474 co-relation queries the response was YES. [2023-08-30 10:24:58,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85022 conditions, 7606 events. 3326/7606 cut-off events. For 440404/440474 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 68510 event pairs, 438 based on Foata normal form. 68/7674 useless extension candidates. Maximal degree in co-relation 84864. Up to 4487 conditions per place. [2023-08-30 10:24:58,996 INFO L137 encePairwiseOnDemand]: 560/576 looper letters, 625 selfloop transitions, 325 changer transitions 0/956 dead transitions. [2023-08-30 10:24:58,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 956 transitions, 24244 flow [2023-08-30 10:24:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 10:24:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 10:24:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4495 transitions. [2023-08-30 10:24:58,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32515914351851855 [2023-08-30 10:24:58,999 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4495 transitions. [2023-08-30 10:24:58,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4495 transitions. [2023-08-30 10:24:59,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:59,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4495 transitions. [2023-08-30 10:24:59,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 187.29166666666666) internal successors, (4495), 24 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:59,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 576.0) internal successors, (14400), 25 states have internal predecessors, (14400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:59,012 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 576.0) internal successors, (14400), 25 states have internal predecessors, (14400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:24:59,012 INFO L175 Difference]: Start difference. First operand has 430 places, 833 transitions, 19458 flow. Second operand 24 states and 4495 transitions. [2023-08-30 10:24:59,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 956 transitions, 24244 flow [2023-08-30 10:25:02,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 956 transitions, 23554 flow, removed 332 selfloop flow, removed 8 redundant places. [2023-08-30 10:25:02,027 INFO L231 Difference]: Finished difference. Result has 448 places, 866 transitions, 20825 flow [2023-08-30 10:25:02,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=19109, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=20825, PETRI_PLACES=448, PETRI_TRANSITIONS=866} [2023-08-30 10:25:02,029 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 361 predicate places. [2023-08-30 10:25:02,029 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 866 transitions, 20825 flow [2023-08-30 10:25:02,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 183.2) internal successors, (5496), 30 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:02,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:25:02,030 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:25:02,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-30 10:25:02,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-30 10:25:02,230 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:25:02,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:25:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash -141699818, now seen corresponding path program 3 times [2023-08-30 10:25:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:25:02,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797052100] [2023-08-30 10:25:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:25:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:25:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:25:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:25:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797052100] [2023-08-30 10:25:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797052100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:25:02,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:25:02,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 10:25:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53220453] [2023-08-30 10:25:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:25:02,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:25:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:25:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:25:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:25:02,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 576 [2023-08-30 10:25:02,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 866 transitions, 20825 flow. Second operand has 8 states, 8 states have (on average 242.75) internal successors, (1942), 8 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:02,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:25:02,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 576 [2023-08-30 10:25:02,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:25:05,465 INFO L130 PetriNetUnfolder]: 3441/8066 cut-off events. [2023-08-30 10:25:05,465 INFO L131 PetriNetUnfolder]: For 410470/410542 co-relation queries the response was YES. [2023-08-30 10:25:05,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86912 conditions, 8066 events. 3441/8066 cut-off events. For 410470/410542 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 74727 event pairs, 604 based on Foata normal form. 16/8074 useless extension candidates. Maximal degree in co-relation 86752. Up to 4112 conditions per place. [2023-08-30 10:25:05,597 INFO L137 encePairwiseOnDemand]: 564/576 looper letters, 742 selfloop transitions, 244 changer transitions 2/994 dead transitions. [2023-08-30 10:25:05,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 994 transitions, 25102 flow [2023-08-30 10:25:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 10:25:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 10:25:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2274 transitions. [2023-08-30 10:25:05,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4386574074074074 [2023-08-30 10:25:05,599 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2274 transitions. [2023-08-30 10:25:05,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2274 transitions. [2023-08-30 10:25:05,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:25:05,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2274 transitions. [2023-08-30 10:25:05,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 252.66666666666666) internal successors, (2274), 9 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:05,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 576.0) internal successors, (5760), 10 states have internal predecessors, (5760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:05,603 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 576.0) internal successors, (5760), 10 states have internal predecessors, (5760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:05,603 INFO L175 Difference]: Start difference. First operand has 448 places, 866 transitions, 20825 flow. Second operand 9 states and 2274 transitions. [2023-08-30 10:25:05,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 994 transitions, 25102 flow [2023-08-30 10:25:08,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 994 transitions, 24771 flow, removed 57 selfloop flow, removed 11 redundant places. [2023-08-30 10:25:08,479 INFO L231 Difference]: Finished difference. Result has 448 places, 875 transitions, 21433 flow [2023-08-30 10:25:08,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=20455, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21433, PETRI_PLACES=448, PETRI_TRANSITIONS=875} [2023-08-30 10:25:08,480 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 361 predicate places. [2023-08-30 10:25:08,480 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 875 transitions, 21433 flow [2023-08-30 10:25:08,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 242.75) internal successors, (1942), 8 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:08,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:25:08,481 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:25:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-30 10:25:08,481 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:25:08,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:25:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 498115173, now seen corresponding path program 1 times [2023-08-30 10:25:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:25:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064033374] [2023-08-30 10:25:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:25:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:25:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:25:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:25:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064033374] [2023-08-30 10:25:08,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064033374] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:25:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254559007] [2023-08-30 10:25:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:25:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:25:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:25:08,813 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:25:08,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-30 10:25:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:25:09,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 10:25:09,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:25:09,044 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-08-30 10:25:09,141 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:25:09,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:25:09,161 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-08-30 10:25:09,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:25:09,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:25:09,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:25:09,272 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-08-30 10:25:09,305 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-08-30 10:25:09,336 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:25:09,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:25:09,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-08-30 10:25:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:09,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:25:09,656 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2705 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2708))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2705) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_109|)) 0)))) is different from false [2023-08-30 10:25:09,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:25:09,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:25:09,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:25:09,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:25:09,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:25:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254559007] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:25:12,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:25:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-30 10:25:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813059622] [2023-08-30 10:25:12,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:25:12,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 10:25:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:25:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 10:25:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=628, Unknown=7, NotChecked=52, Total=812 [2023-08-30 10:25:12,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 576 [2023-08-30 10:25:12,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 875 transitions, 21433 flow. Second operand has 29 states, 29 states have (on average 188.27586206896552) internal successors, (5460), 29 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:12,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:25:12,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 576 [2023-08-30 10:25:12,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:25:13,383 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse2 (@diff .cse1 .cse3))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_159| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_159|) 0)))) (or (<= 1 (select .cse1 .cse2)) (= .cse3 .cse1)) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_159| Int)) (or (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2706 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_109| |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_159| v_ArrVal_2706) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_2708) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) 2147483649)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_159|) 0)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) .cse0 (exists ((v_ArrVal_2708 Int) (v_ArrVal_2709 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse4 (store .cse3 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2708))) (and (<= (+ (select .cse4 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1) v_ArrVal_2709) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)) (= (store .cse4 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2709) (select |c_#memory_int| 4))))) (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2706 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_109| |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) (< 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_2708) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|))))) (= .cse3 (store .cse1 .cse2 0)) (< 0 (+ 2147483649 |c_t_funThread2of2ForFork0_#t~post37#1|))))) is different from false [2023-08-30 10:25:13,959 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse1 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse0 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse3 (@diff .cse2 .cse4))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_159| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_159|) 0)))) (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int)) (or (not (= (select .cse1 (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_109|)) 0)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2708)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|))))) (or (<= 1 (select .cse2 .cse3)) (= .cse4 .cse2)) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_159| Int)) (or (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2706 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_109| |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_159| v_ArrVal_2706) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_2708) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) 2147483649)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_159|) 0)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2706 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706))) (store .cse5 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2708))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|))) (not (= (select .cse1 (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_109|)) 0)))) .cse0 (exists ((v_ArrVal_2708 Int) (v_ArrVal_2709 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse6 (store .cse4 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2708))) (and (<= (+ (select .cse6 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1) v_ArrVal_2709) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)) (= (store .cse6 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2709) (select |c_#memory_int| 4))))) (forall ((v_ArrVal_2708 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_109| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2706 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_109| |v_t_funThread2of2ForFork0_~p~0#1.offset_109|) (< 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109| v_ArrVal_2708) |v_t_funThread2of2ForFork0_~p~0#1.offset_109|))))) (= .cse4 (store .cse2 .cse3 0)) (< 0 (+ 2147483649 |c_t_funThread2of2ForFork0_#t~post37#1|))))) is different from false [2023-08-30 10:25:24,308 INFO L130 PetriNetUnfolder]: 3703/8682 cut-off events. [2023-08-30 10:25:24,309 INFO L131 PetriNetUnfolder]: For 437147/437147 co-relation queries the response was YES. [2023-08-30 10:25:24,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94178 conditions, 8682 events. 3703/8682 cut-off events. For 437147/437147 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 81586 event pairs, 370 based on Foata normal form. 42/8724 useless extension candidates. Maximal degree in co-relation 94015. Up to 4021 conditions per place. [2023-08-30 10:25:24,462 INFO L137 encePairwiseOnDemand]: 555/576 looper letters, 635 selfloop transitions, 567 changer transitions 25/1233 dead transitions. [2023-08-30 10:25:24,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 1233 transitions, 31896 flow [2023-08-30 10:25:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-30 10:25:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-30 10:25:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 10902 transitions. [2023-08-30 10:25:24,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33205409356725146 [2023-08-30 10:25:24,468 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 10902 transitions. [2023-08-30 10:25:24,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 10902 transitions. [2023-08-30 10:25:24,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:25:24,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 10902 transitions. [2023-08-30 10:25:24,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 191.26315789473685) internal successors, (10902), 57 states have internal predecessors, (10902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:24,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 576.0) internal successors, (33408), 58 states have internal predecessors, (33408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:24,505 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 576.0) internal successors, (33408), 58 states have internal predecessors, (33408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:24,506 INFO L175 Difference]: Start difference. First operand has 448 places, 875 transitions, 21433 flow. Second operand 57 states and 10902 transitions. [2023-08-30 10:25:24,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 1233 transitions, 31896 flow [2023-08-30 10:25:27,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 1233 transitions, 31788 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-30 10:25:27,847 INFO L231 Difference]: Finished difference. Result has 522 places, 1020 transitions, 26579 flow [2023-08-30 10:25:27,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=21245, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=871, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=26579, PETRI_PLACES=522, PETRI_TRANSITIONS=1020} [2023-08-30 10:25:27,848 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 435 predicate places. [2023-08-30 10:25:27,848 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 1020 transitions, 26579 flow [2023-08-30 10:25:27,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 188.27586206896552) internal successors, (5460), 29 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:27,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:25:27,849 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:25:27,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-30 10:25:28,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:25:28,050 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:25:28,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:25:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 120567218, now seen corresponding path program 2 times [2023-08-30 10:25:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:25:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725083588] [2023-08-30 10:25:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:25:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:25:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:25:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:25:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725083588] [2023-08-30 10:25:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725083588] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:25:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256953777] [2023-08-30 10:25:28,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:25:28,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:25:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:25:28,393 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:25:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-30 10:25:28,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:25:28,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:25:28,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 10:25:28,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:25:28,602 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-08-30 10:25:28,647 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:25:28,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:25:28,655 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-08-30 10:25:28,734 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 24 treesize of output 17 [2023-08-30 10:25:28,809 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 28 treesize of output 28 [2023-08-30 10:25:28,872 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 29 treesize of output 24 [2023-08-30 10:25:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:28,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:25:29,020 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2805 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2805))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:25:29,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2805 (Array Int Int))) (< (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2805))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset| .cse1))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:25:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256953777] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:25:29,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:25:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 26 [2023-08-30 10:25:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250473453] [2023-08-30 10:25:29,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:25:29,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 10:25:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:25:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 10:25:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=537, Unknown=18, NotChecked=98, Total=756 [2023-08-30 10:25:29,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 576 [2023-08-30 10:25:29,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 1020 transitions, 26579 flow. Second operand has 28 states, 28 states have (on average 207.17857142857142) internal successors, (5801), 28 states have internal predecessors, (5801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:29,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:25:29,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 576 [2023-08-30 10:25:29,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:25:38,144 INFO L130 PetriNetUnfolder]: 3699/8790 cut-off events. [2023-08-30 10:25:38,145 INFO L131 PetriNetUnfolder]: For 547792/547806 co-relation queries the response was YES. [2023-08-30 10:25:38,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101852 conditions, 8790 events. 3699/8790 cut-off events. For 547792/547806 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 83682 event pairs, 443 based on Foata normal form. 99/8889 useless extension candidates. Maximal degree in co-relation 101669. Up to 3941 conditions per place. [2023-08-30 10:25:38,303 INFO L137 encePairwiseOnDemand]: 562/576 looper letters, 771 selfloop transitions, 399 changer transitions 0/1176 dead transitions. [2023-08-30 10:25:38,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1176 transitions, 32207 flow [2023-08-30 10:25:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 10:25:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 10:25:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4863 transitions. [2023-08-30 10:25:38,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36707427536231885 [2023-08-30 10:25:38,308 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4863 transitions. [2023-08-30 10:25:38,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4863 transitions. [2023-08-30 10:25:38,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:25:38,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4863 transitions. [2023-08-30 10:25:38,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 211.43478260869566) internal successors, (4863), 23 states have internal predecessors, (4863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:38,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 576.0) internal successors, (13824), 24 states have internal predecessors, (13824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:38,318 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 576.0) internal successors, (13824), 24 states have internal predecessors, (13824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:38,318 INFO L175 Difference]: Start difference. First operand has 522 places, 1020 transitions, 26579 flow. Second operand 23 states and 4863 transitions. [2023-08-30 10:25:38,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 1176 transitions, 32207 flow [2023-08-30 10:25:41,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 1176 transitions, 31118 flow, removed 262 selfloop flow, removed 19 redundant places. [2023-08-30 10:25:41,993 INFO L231 Difference]: Finished difference. Result has 528 places, 1055 transitions, 27402 flow [2023-08-30 10:25:41,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=25390, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=27402, PETRI_PLACES=528, PETRI_TRANSITIONS=1055} [2023-08-30 10:25:41,994 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 441 predicate places. [2023-08-30 10:25:41,994 INFO L495 AbstractCegarLoop]: Abstraction has has 528 places, 1055 transitions, 27402 flow [2023-08-30 10:25:41,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 207.17857142857142) internal successors, (5801), 28 states have internal predecessors, (5801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:41,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:25:41,995 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:25:41,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-08-30 10:25:42,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2023-08-30 10:25:42,195 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:25:42,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:25:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1175842975, now seen corresponding path program 2 times [2023-08-30 10:25:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:25:42,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170482924] [2023-08-30 10:25:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:25:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:25:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:25:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:25:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170482924] [2023-08-30 10:25:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170482924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:25:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759896659] [2023-08-30 10:25:42,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:25:42,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:25:42,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:25:42,557 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:25:42,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-08-30 10:25:42,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:25:42,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:25:42,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 10:25:42,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:25:42,768 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-08-30 10:25:42,870 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:25:42,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:25:42,893 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-08-30 10:25:42,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:25:42,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:25:42,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:25:43,018 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-08-30 10:25:43,105 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 27 treesize of output 20 [2023-08-30 10:25:43,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:25:43,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:25:43,191 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:25:43,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:25:43,292 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-08-30 10:25:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:43,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:25:43,482 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_113| Int) (v_ArrVal_2905 Int) (v_ArrVal_2907 Int) (v_ArrVal_2906 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2906) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_113|)) 0)) (< v_ArrVal_2905 (+ |c_t_funThread1of2ForFork0_#t~post37#1| 1)) (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2905)))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_113| v_ArrVal_2907))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)))) is different from false [2023-08-30 10:25:43,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:25:43,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:25:43,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:25:43,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:25:43,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:25:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:25:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759896659] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:25:46,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:25:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-30 10:25:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827849697] [2023-08-30 10:25:46,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:25:46,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 10:25:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:25:46,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 10:25:46,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=637, Unknown=9, NotChecked=52, Total=812 [2023-08-30 10:25:46,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 576 [2023-08-30 10:25:46,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 1055 transitions, 27402 flow. Second operand has 29 states, 29 states have (on average 188.27586206896552) internal successors, (5460), 29 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:25:46,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:25:46,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 576 [2023-08-30 10:25:46,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:25:55,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:25:57,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:25:59,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:01,460 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-08-30 10:26:03,480 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-08-30 10:26:07,620 WARN L539 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-08-30 10:26:09,782 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-08-30 10:26:11,818 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-08-30 10:26:13,854 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-08-30 10:26:15,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-08-30 10:26:17,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:19,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:21,975 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-08-30 10:26:33,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-08-30 10:26:39,954 WARN L539 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-08-30 10:26:48,422 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-08-30 10:26:50,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:52,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:26:54,862 WARN L539 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-08-30 10:26:57,126 WARN L539 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-08-30 10:26:59,165 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-08-30 10:27:01,195 WARN L539 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-08-30 10:27:03,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:05,272 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-08-30 10:27:07,292 WARN L539 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-08-30 10:27:09,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:11,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:13,376 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-08-30 10:27:15,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:17,887 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-08-30 10:27:22,219 WARN L539 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-08-30 10:27:24,230 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-08-30 10:27:26,878 WARN L539 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-08-30 10:27:29,477 WARN L539 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-08-30 10:27:31,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:33,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:35,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:37,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:39,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:41,758 WARN L539 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-08-30 10:27:44,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:27:46,230 WARN L539 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-08-30 10:27:48,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:27:50,937 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-08-30 10:27:57,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:59,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-08-30 10:28:02,001 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-08-30 10:28:04,237 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-08-30 10:28:08,564 WARN L539 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-08-30 10:28:13,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:28:15,690 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-08-30 10:28:17,708 WARN L539 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-08-30 10:28:19,728 WARN L539 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-08-30 10:28:21,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:28:23,793 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-08-30 10:28:25,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-08-30 10:28:27,968 WARN L539 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-08-30 10:28:29,991 WARN L539 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-08-30 10:28:47,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:28:49,629 WARN L539 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-08-30 10:28:51,700 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-08-30 10:28:53,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:29:00,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:02,412 WARN L539 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-08-30 10:29:04,503 WARN L539 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-08-30 10:29:06,587 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-08-30 10:29:08,942 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-08-30 10:29:10,954 WARN L539 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-08-30 10:29:13,456 WARN L539 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-08-30 10:29:15,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:18,366 WARN L539 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-08-30 10:29:20,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:21,565 INFO L130 PetriNetUnfolder]: 4049/9651 cut-off events. [2023-08-30 10:29:21,565 INFO L131 PetriNetUnfolder]: For 586127/586141 co-relation queries the response was YES. [2023-08-30 10:29:21,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112246 conditions, 9651 events. 4049/9651 cut-off events. For 586127/586141 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 93757 event pairs, 427 based on Foata normal form. 26/9677 useless extension candidates. Maximal degree in co-relation 112061. Up to 4658 conditions per place. [2023-08-30 10:29:21,964 INFO L137 encePairwiseOnDemand]: 551/576 looper letters, 828 selfloop transitions, 602 changer transitions 35/1471 dead transitions. [2023-08-30 10:29:21,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 1471 transitions, 40155 flow [2023-08-30 10:29:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-30 10:29:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-30 10:29:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 7920 transitions. [2023-08-30 10:29:21,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3353658536585366 [2023-08-30 10:29:21,970 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 7920 transitions. [2023-08-30 10:29:21,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 7920 transitions. [2023-08-30 10:29:21,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:29:21,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 7920 transitions. [2023-08-30 10:29:21,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 193.17073170731706) internal successors, (7920), 41 states have internal predecessors, (7920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:21,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 576.0) internal successors, (24192), 42 states have internal predecessors, (24192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:21,989 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 576.0) internal successors, (24192), 42 states have internal predecessors, (24192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:21,990 INFO L175 Difference]: Start difference. First operand has 528 places, 1055 transitions, 27402 flow. Second operand 41 states and 7920 transitions. [2023-08-30 10:29:21,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 1471 transitions, 40155 flow [2023-08-30 10:29:26,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1471 transitions, 38943 flow, removed 42 selfloop flow, removed 13 redundant places. [2023-08-30 10:29:26,930 INFO L231 Difference]: Finished difference. Result has 573 places, 1217 transitions, 32740 flow [2023-08-30 10:29:26,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=26305, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=422, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=32740, PETRI_PLACES=573, PETRI_TRANSITIONS=1217} [2023-08-30 10:29:26,931 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 486 predicate places. [2023-08-30 10:29:26,932 INFO L495 AbstractCegarLoop]: Abstraction has has 573 places, 1217 transitions, 32740 flow [2023-08-30 10:29:26,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 188.27586206896552) internal successors, (5460), 29 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:26,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:29:26,932 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:29:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-08-30 10:29:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:29:27,133 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:29:27,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:29:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1580009102, now seen corresponding path program 1 times [2023-08-30 10:29:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:29:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521016051] [2023-08-30 10:29:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:29:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:29:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:29:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:29:27,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:29:27,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521016051] [2023-08-30 10:29:27,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521016051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:29:27,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:29:27,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 10:29:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969953764] [2023-08-30 10:29:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:29:27,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:29:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:29:27,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:29:27,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:29:27,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 576 [2023-08-30 10:29:27,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 1217 transitions, 32740 flow. Second operand has 8 states, 8 states have (on average 244.75) internal successors, (1958), 8 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:27,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:29:27,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 576 [2023-08-30 10:29:27,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:29:32,575 INFO L130 PetriNetUnfolder]: 3993/9504 cut-off events. [2023-08-30 10:29:32,575 INFO L131 PetriNetUnfolder]: For 698099/698109 co-relation queries the response was YES. [2023-08-30 10:29:32,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117821 conditions, 9504 events. 3993/9504 cut-off events. For 698099/698109 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 92046 event pairs, 650 based on Foata normal form. 6/9502 useless extension candidates. Maximal degree in co-relation 117621. Up to 3631 conditions per place. [2023-08-30 10:29:32,740 INFO L137 encePairwiseOnDemand]: 562/576 looper letters, 967 selfloop transitions, 419 changer transitions 16/1408 dead transitions. [2023-08-30 10:29:32,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 1408 transitions, 39512 flow [2023-08-30 10:29:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 10:29:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 10:29:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2803 transitions. [2023-08-30 10:29:32,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44239267676767674 [2023-08-30 10:29:32,743 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2803 transitions. [2023-08-30 10:29:32,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2803 transitions. [2023-08-30 10:29:32,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:29:32,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2803 transitions. [2023-08-30 10:29:32,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 254.8181818181818) internal successors, (2803), 11 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:32,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 576.0) internal successors, (6912), 12 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:32,749 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 576.0) internal successors, (6912), 12 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:32,749 INFO L175 Difference]: Start difference. First operand has 573 places, 1217 transitions, 32740 flow. Second operand 11 states and 2803 transitions. [2023-08-30 10:29:32,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 1408 transitions, 39512 flow [2023-08-30 10:29:37,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 1408 transitions, 38201 flow, removed 329 selfloop flow, removed 13 redundant places. [2023-08-30 10:29:37,743 INFO L231 Difference]: Finished difference. Result has 575 places, 1239 transitions, 33494 flow [2023-08-30 10:29:37,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=31424, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=33494, PETRI_PLACES=575, PETRI_TRANSITIONS=1239} [2023-08-30 10:29:37,745 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 488 predicate places. [2023-08-30 10:29:37,745 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 1239 transitions, 33494 flow [2023-08-30 10:29:37,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 244.75) internal successors, (1958), 8 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:37,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:29:37,746 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:29:37,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-08-30 10:29:37,746 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:29:37,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:29:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1580009201, now seen corresponding path program 2 times [2023-08-30 10:29:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:29:37,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274010839] [2023-08-30 10:29:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:29:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:29:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:29:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:29:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:29:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274010839] [2023-08-30 10:29:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274010839] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:29:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596092335] [2023-08-30 10:29:38,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:29:38,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:29:38,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:29:38,099 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:29:38,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-08-30 10:29:38,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:29:38,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:29:38,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:29:38,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:29:38,346 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-08-30 10:29:38,410 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:29:38,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:29:38,433 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-08-30 10:29:38,486 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-08-30 10:29:38,574 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 27 treesize of output 20 [2023-08-30 10:29:38,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-08-30 10:29:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:29:38,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:29:43,082 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3046))) (let ((.cse2 (select .cse3 |c_~#a~0.base|))) (let ((.cse1 (store .cse3 |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048)))) (let ((.cse0 (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (< v_ArrVal_3049 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_3048 2147483648) 0) (< 0 (+ (select (select (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_3048 (+ (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))))) is different from false [2023-08-30 10:29:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-30 10:29:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596092335] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:29:43,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:29:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-30 10:29:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754941507] [2023-08-30 10:29:43,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:29:43,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 10:29:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:29:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 10:29:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=586, Unknown=6, NotChecked=50, Total=756 [2023-08-30 10:29:43,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 576 [2023-08-30 10:29:43,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 1239 transitions, 33494 flow. Second operand has 28 states, 28 states have (on average 207.28571428571428) internal successors, (5804), 28 states have internal predecessors, (5804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:29:43,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:29:43,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 576 [2023-08-30 10:29:43,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:29:46,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:48,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:50,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:52,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:54,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-08-30 10:29:56,667 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-08-30 10:30:06,801 WARN L539 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-08-30 10:30:08,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:15,446 WARN L539 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-08-30 10:30:17,685 WARN L539 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-08-30 10:30:19,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:23,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 [1] [2023-08-30 10:30:25,832 WARN L539 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-08-30 10:30:27,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:29,860 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-08-30 10:30:31,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-08-30 10:30:33,950 WARN L539 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-08-30 10:30:36,008 WARN L539 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-08-30 10:30:38,404 WARN L839 $PredicateComparison]: unable to prove that (and (< 0 (+ (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3046) |c_~#a~0.base|))) (let ((.cse0 (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048))) (or (< 0 (+ (select (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3049 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_3048 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse2 (store |c_#memory_int| |c_~#a~0.base| (store .cse4 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048)))) (let ((.cse3 (select .cse2 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (< 0 (+ (select (select (store .cse2 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse3 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3048 (+ (select .cse4 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_3049 (+ (select .cse3 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_162| Int)) (or (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse5 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_162| v_ArrVal_3046) |c_~#a~0.base|))) (let ((.cse6 (store .cse5 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048))) (or (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3048 (+ (select .cse5 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (store .cse6 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_3049 (+ (select .cse6 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_162|) 0))))) is different from false [2023-08-30 10:30:40,434 WARN L539 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-08-30 10:30:42,580 WARN L539 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-08-30 10:30:44,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:46,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:48,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:50,652 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-08-30 10:30:52,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:54,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:56,849 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-08-30 10:30:58,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:31:10,283 WARN L539 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-08-30 10:31:12,310 WARN L539 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-08-30 10:31:14,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:31:16,807 WARN L539 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-08-30 10:31:19,244 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-08-30 10:31:21,270 WARN L539 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-08-30 10:31:23,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:31:26,060 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-08-30 10:31:28,270 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| 4))) (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3046) |c_~#a~0.base|))) (let ((.cse0 (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048))) (or (< 0 (+ (select (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3049 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_3048 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse2 (store |c_#memory_int| |c_~#a~0.base| (store .cse4 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048)))) (let ((.cse3 (select .cse2 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (< 0 (+ (select (select (store .cse2 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse3 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3048 (+ (select .cse4 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_3049 (+ (select .cse3 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))))) (<= (select .cse5 |c_t_funThread1of2ForFork0_~p~0#1.offset|) |c_t_funThread1of2ForFork0_#t~post37#1|) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (exists ((v_ArrVal_3048 Int)) (let ((.cse6 ((as const (Array Int Int)) 0))) (and (= (store .cse6 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048) .cse5) (<= (+ (select .cse6 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1) v_ArrVal_3048)))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_162| Int)) (or (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse7 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_162| v_ArrVal_3046) |c_~#a~0.base|))) (let ((.cse8 (store .cse7 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048))) (or (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3048 (+ (select .cse7 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (store .cse8 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_3049 (+ (select .cse8 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_162|) 0)))))) is different from false [2023-08-30 10:31:30,471 WARN L539 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-08-30 10:31:39,291 WARN L539 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-08-30 10:31:39,492 WARN L839 $PredicateComparison]: unable to prove that (and (< 0 (+ (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3049 Int) (v_ArrVal_3048 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3046) |c_~#a~0.base|))) (let ((.cse0 (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_3048))) (or (< 0 (+ (select (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_3049) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_3048 2147483648) 0) (< v_ArrVal_3049 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_3048 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))))) is different from false [2023-08-30 10:31:41,604 WARN L539 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-08-30 10:31:47,790 WARN L539 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-08-30 10:31:50,082 WARN L539 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-08-30 10:31:52,092 WARN L539 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-08-30 10:31:54,187 WARN L539 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-08-30 10:31:56,447 WARN L539 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-08-30 10:31:58,456 WARN L539 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-08-30 10:32:00,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:02,791 WARN L539 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-08-30 10:32:09,370 WARN L539 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-08-30 10:32:11,375 WARN L539 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-08-30 10:32:13,400 WARN L539 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-08-30 10:32:15,685 INFO L130 PetriNetUnfolder]: 4057/9714 cut-off events. [2023-08-30 10:32:15,686 INFO L131 PetriNetUnfolder]: For 669945/670037 co-relation queries the response was YES. [2023-08-30 10:32:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119020 conditions, 9714 events. 4057/9714 cut-off events. For 669945/670037 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 94754 event pairs, 505 based on Foata normal form. 8/9714 useless extension candidates. Maximal degree in co-relation 118818. Up to 6946 conditions per place. [2023-08-30 10:32:15,853 INFO L137 encePairwiseOnDemand]: 555/576 looper letters, 1062 selfloop transitions, 342 changer transitions 7/1417 dead transitions. [2023-08-30 10:32:15,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 1417 transitions, 40495 flow [2023-08-30 10:32:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 10:32:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 10:32:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 7175 transitions. [2023-08-30 10:32:15,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663705065359477 [2023-08-30 10:32:15,858 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 7175 transitions. [2023-08-30 10:32:15,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 7175 transitions. [2023-08-30 10:32:15,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:32:15,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 7175 transitions. [2023-08-30 10:32:15,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 211.02941176470588) internal successors, (7175), 34 states have internal predecessors, (7175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:15,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 576.0) internal successors, (20160), 35 states have internal predecessors, (20160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:15,873 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 576.0) internal successors, (20160), 35 states have internal predecessors, (20160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:15,873 INFO L175 Difference]: Start difference. First operand has 575 places, 1239 transitions, 33494 flow. Second operand 34 states and 7175 transitions. [2023-08-30 10:32:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 1417 transitions, 40495 flow [2023-08-30 10:32:20,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 1417 transitions, 40146 flow, removed 68 selfloop flow, removed 5 redundant places. [2023-08-30 10:32:20,107 INFO L231 Difference]: Finished difference. Result has 621 places, 1302 transitions, 36172 flow [2023-08-30 10:32:20,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=33115, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=36172, PETRI_PLACES=621, PETRI_TRANSITIONS=1302} [2023-08-30 10:32:20,109 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 534 predicate places. [2023-08-30 10:32:20,109 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 1302 transitions, 36172 flow [2023-08-30 10:32:20,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 207.28571428571428) internal successors, (5804), 28 states have internal predecessors, (5804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:20,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:32:20,110 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:32:20,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-08-30 10:32:20,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2023-08-30 10:32:20,310 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:32:20,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:32:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1466159112, now seen corresponding path program 2 times [2023-08-30 10:32:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:32:20,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852667481] [2023-08-30 10:32:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:32:20,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:32:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:32:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 10:32:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:32:20,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852667481] [2023-08-30 10:32:20,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852667481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:32:20,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:32:20,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 10:32:20,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698958741] [2023-08-30 10:32:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:32:20,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:32:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:32:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:32:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:32:20,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 576 [2023-08-30 10:32:20,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 1302 transitions, 36172 flow. Second operand has 8 states, 8 states have (on average 242.625) internal successors, (1941), 8 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:20,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:32:20,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 576 [2023-08-30 10:32:20,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:32:26,550 INFO L130 PetriNetUnfolder]: 4117/9858 cut-off events. [2023-08-30 10:32:26,550 INFO L131 PetriNetUnfolder]: For 699682/699706 co-relation queries the response was YES. [2023-08-30 10:32:26,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123409 conditions, 9858 events. 4117/9858 cut-off events. For 699682/699706 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 96487 event pairs, 646 based on Foata normal form. 6/9856 useless extension candidates. Maximal degree in co-relation 123191. Up to 4814 conditions per place. [2023-08-30 10:32:26,745 INFO L137 encePairwiseOnDemand]: 561/576 looper letters, 1049 selfloop transitions, 419 changer transitions 25/1499 dead transitions. [2023-08-30 10:32:26,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 1499 transitions, 43240 flow [2023-08-30 10:32:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 10:32:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 10:32:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2538 transitions. [2023-08-30 10:32:26,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440625 [2023-08-30 10:32:26,747 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2538 transitions. [2023-08-30 10:32:26,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2538 transitions. [2023-08-30 10:32:26,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:32:26,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2538 transitions. [2023-08-30 10:32:26,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 253.8) internal successors, (2538), 10 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:26,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:26,752 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 576.0) internal successors, (6336), 11 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:26,752 INFO L175 Difference]: Start difference. First operand has 621 places, 1302 transitions, 36172 flow. Second operand 10 states and 2538 transitions. [2023-08-30 10:32:26,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 1499 transitions, 43240 flow [2023-08-30 10:32:31,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 1499 transitions, 42917 flow, removed 96 selfloop flow, removed 9 redundant places. [2023-08-30 10:32:31,633 INFO L231 Difference]: Finished difference. Result has 626 places, 1323 transitions, 37789 flow [2023-08-30 10:32:31,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=35848, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=398, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=37789, PETRI_PLACES=626, PETRI_TRANSITIONS=1323} [2023-08-30 10:32:31,635 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, 539 predicate places. [2023-08-30 10:32:31,635 INFO L495 AbstractCegarLoop]: Abstraction has has 626 places, 1323 transitions, 37789 flow [2023-08-30 10:32:31,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 242.625) internal successors, (1941), 8 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:31,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:32:31,636 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:32:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-08-30 10:32:31,636 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2023-08-30 10:32:31,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:32:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1208748701, now seen corresponding path program 3 times [2023-08-30 10:32:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:32:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201189882] [2023-08-30 10:32:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:32:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:32:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:32:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:32:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:32:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201189882] [2023-08-30 10:32:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201189882] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:32:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145120706] [2023-08-30 10:32:32,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 10:32:32,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:32:32,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:32:32,344 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:32:32,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-08-30 10:32:32,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 10:32:32,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:32:32,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 10:32:32,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:32:32,551 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-08-30 10:32:32,655 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:32:32,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-30 10:32:32,685 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-08-30 10:32:32,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:32:32,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 10:32:32,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:32:32,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 10:32:32,886 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:32:32,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 10:32:32,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-08-30 10:32:33,018 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-08-30 10:32:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:32:33,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:32:33,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:32:33,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:32:33,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:32:33,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:32:33,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-30 10:32:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 10:32:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145120706] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:32:37,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:32:37,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-08-30 10:32:37,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308212222] [2023-08-30 10:32:37,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:32:37,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 10:32:37,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:32:37,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 10:32:37,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=766, Unknown=1, NotChecked=0, Total=870 [2023-08-30 10:32:39,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:41,880 WARN L539 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-08-30 10:32: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 [1] [2023-08-30 10:32:50,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:52,085 WARN L539 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-08-30 10:32:54,172 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-08-30 10:32:55,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 576 [2023-08-30 10:32:55,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 1323 transitions, 37789 flow. Second operand has 30 states, 30 states have (on average 183.2) internal successors, (5496), 30 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:32:55,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:32:55,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 576 [2023-08-30 10:32:55,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:33:21,226 WARN L222 SmtUtils]: Spent 25.14s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:33:46,566 WARN L222 SmtUtils]: Spent 24.89s on a formula simplification. DAG size of input: 140 DAG size of output: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:33:48,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:34:07,643 WARN L222 SmtUtils]: Spent 14.35s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:34:18,338 WARN L222 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 113 DAG size of output: 110 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:34:43,464 WARN L222 SmtUtils]: Spent 24.79s on a formula simplification. DAG size of input: 132 DAG size of output: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:34:57,339 WARN L222 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:34:59,489 WARN L539 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-08-30 10:35:01,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:35:03,643 WARN L539 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-08-30 10:35:13,360 WARN L222 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 114 DAG size of output: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:35:21,872 WARN L222 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 49 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:35:35,292 WARN L539 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-08-30 10:35:37,528 WARN L539 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] Killed by 15