./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_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_74-tricky_address1_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 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --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:19:23,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 10:19:23,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 10:19:23,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 10:19:23,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 10:19:23,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 10:19:23,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 10:19:23,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 10:19:23,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 10:19:23,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 10:19:23,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 10:19:23,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 10:19:23,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 10:19:23,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 10:19:23,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 10:19:23,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 10:19:23,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 10:19:23,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 10:19:23,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 10:19:23,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 10:19:23,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 10:19:23,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 10:19:23,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 10:19:23,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 10:19:23,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 10:19:23,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 10:19:23,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 10:19:23,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 10:19:23,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 10:19:23,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 10:19:23,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 10:19:23,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 10:19:23,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 10:19:23,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 10:19:23,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 10:19:23,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 10:19:23,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 10:19:23,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 10:19:23,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 10:19:23,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 10:19:23,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 10:19:23,221 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:19:23,241 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 10:19:23,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 10:19:23,241 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 10:19:23,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 10:19:23,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 10:19:23,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 10:19:23,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 10:19:23,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 10:19:23,244 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 10:19:23,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 10:19:23,244 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 10:19:23,244 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 10:19:23,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 10:19:23,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 10:19:23,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 10:19:23,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 10:19:23,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 10:19:23,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 10:19:23,246 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 10:19:23,246 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 10:19:23,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 10:19:23,246 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 10:19:23,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 10:19:23,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 10:19:23,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 10:19:23,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 10:19:23,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 10:19:23,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 10:19:23,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 10:19:23,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 10:19:23,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 10:19:23,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 10:19:23,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 10:19:23,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 10:19:23,249 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 10:19:23,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 10:19:23,249 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 10:19:23,250 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 -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 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:19:23,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 10:19:23,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 10:19:23,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 10:19:23,548 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 10:19:23,548 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 10:19:23,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-30 10:19:24,727 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 10:19:25,023 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 10:19:25,024 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-30 10:19:25,036 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f29dc61/af2d704ac7ed4ffebb2cd1277a74ebf5/FLAG6db1cbd9b [2023-08-30 10:19:25,049 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f29dc61/af2d704ac7ed4ffebb2cd1277a74ebf5 [2023-08-30 10:19:25,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 10:19:25,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 10:19:25,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 10:19:25,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 10:19:25,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 10:19:25,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532165df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25, skipping insertion in model container [2023-08-30 10:19:25,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 10:19:25,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 10:19:25,538 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_74-tricky_address1_racefree.i[41323,41336] [2023-08-30 10:19:25,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 10:19:25,603 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 10:19:25,662 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_74-tricky_address1_racefree.i[41323,41336] [2023-08-30 10:19:25,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 10:19:25,738 INFO L208 MainTranslator]: Completed translation [2023-08-30 10:19:25,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25 WrapperNode [2023-08-30 10:19:25,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 10:19:25,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 10:19:25,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 10:19:25,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 10:19:25,745 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:19:25" (1/1) ... [2023-08-30 10:19:25,768 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:19:25" (1/1) ... [2023-08-30 10:19:25,806 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 204 [2023-08-30 10:19:25,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 10:19:25,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 10:19:25,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 10:19:25,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 10:19:25,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 10:19:25,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 10:19:25,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 10:19:25,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 10:19:25,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (1/1) ... [2023-08-30 10:19:25,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 10:19:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:25,894 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:19:25,918 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:19:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 10:19:25,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 10:19:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 10:19:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 10:19:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 10:19:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 10:19:25,930 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 10:19:25,931 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 10:19:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 10:19:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 10:19:25,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 10:19:25,932 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:19:26,063 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 10:19:26,064 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 10:19:26,404 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 10:19:26,412 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 10:19:26,412 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-30 10:19:26,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:19:26 BoogieIcfgContainer [2023-08-30 10:19:26,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 10:19:26,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 10:19:26,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 10:19:26,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 10:19:26,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 10:19:25" (1/3) ... [2023-08-30 10:19:26,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6917d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:19:26, skipping insertion in model container [2023-08-30 10:19:26,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 10:19:25" (2/3) ... [2023-08-30 10:19:26,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a6917d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 10:19:26, skipping insertion in model container [2023-08-30 10:19:26,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 10:19:26" (3/3) ... [2023-08-30 10:19:26,426 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-30 10:19:26,432 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 10:19:26,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 10:19:26,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-30 10:19:26,440 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 10:19:26,529 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 10:19:26,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 216 transitions, 440 flow [2023-08-30 10:19:26,669 INFO L130 PetriNetUnfolder]: 45/293 cut-off events. [2023-08-30 10:19:26,669 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 10:19:26,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 293 events. 45/293 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 998 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-30 10:19:26,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 216 transitions, 440 flow [2023-08-30 10:19:26,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 213 transitions, 434 flow [2023-08-30 10:19:26,690 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:19:26,698 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 213 transitions, 434 flow [2023-08-30 10:19:26,700 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 213 transitions, 434 flow [2023-08-30 10:19:26,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 213 transitions, 434 flow [2023-08-30 10:19:26,742 INFO L130 PetriNetUnfolder]: 44/290 cut-off events. [2023-08-30 10:19:26,743 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 10:19:26,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 290 events. 44/290 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 988 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-30 10:19:26,752 INFO L119 LiptonReduction]: Number of co-enabled transitions 13050 [2023-08-30 10:19:29,618 INFO L134 LiptonReduction]: Checked pairs total: 22816 [2023-08-30 10:19:29,618 INFO L136 LiptonReduction]: Total number of compositions: 191 [2023-08-30 10:19:29,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 10:19:29,635 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;@14b0c5fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:19:29,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-30 10:19:29,637 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 10:19:29,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:19:29,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:29,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 10:19:29,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:29,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash 27119, now seen corresponding path program 1 times [2023-08-30 10:19:29,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:29,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229716679] [2023-08-30 10:19:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:29,848 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:19:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229716679] [2023-08-30 10:19:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229716679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 10:19:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193150383] [2023-08-30 10:19:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:29,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:19:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:19:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:19:29,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 407 [2023-08-30 10:19:29,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 79 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:29,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:29,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 407 [2023-08-30 10:19:29,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:30,102 INFO L130 PetriNetUnfolder]: 454/971 cut-off events. [2023-08-30 10:19:30,102 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:19:30,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 971 events. 454/971 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5409 event pairs, 414 based on Foata normal form. 131/816 useless extension candidates. Maximal degree in co-relation 1806. Up to 898 conditions per place. [2023-08-30 10:19:30,107 INFO L137 encePairwiseOnDemand]: 380/407 looper letters, 48 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-30 10:19:30,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 222 flow [2023-08-30 10:19:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:19:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:19:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-08-30 10:19:30,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506961506961507 [2023-08-30 10:19:30,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-08-30 10:19:30,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-08-30 10:19:30,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:30,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-08-30 10:19:30,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 407.0) internal successors, (1628), 4 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 407.0) internal successors, (1628), 4 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,140 INFO L175 Difference]: Start difference. First operand has 58 places, 79 transitions, 166 flow. Second operand 3 states and 619 transitions. [2023-08-30 10:19:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 222 flow [2023-08-30 10:19:30,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:19:30,145 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 134 flow [2023-08-30 10:19:30,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, 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=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-08-30 10:19:30,149 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2023-08-30 10:19:30,149 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 134 flow [2023-08-30 10:19:30,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:30,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 10:19:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 10:19:30,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:30,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash 842574, now seen corresponding path program 1 times [2023-08-30 10:19:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828402665] [2023-08-30 10:19:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:30,241 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:19:30,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828402665] [2023-08-30 10:19:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828402665] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824785230] [2023-08-30 10:19:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:30,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:30,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:30,248 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:19:30,249 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:19:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:30,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 10:19:30,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:30,331 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:19:30,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 10:19:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824785230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:30,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 10:19:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 10:19:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923057596] [2023-08-30 10:19:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:30,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:19:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:19:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:19:30,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 407 [2023-08-30 10:19:30,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:30,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 407 [2023-08-30 10:19:30,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:30,545 INFO L130 PetriNetUnfolder]: 454/970 cut-off events. [2023-08-30 10:19:30,545 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:19:30,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882 conditions, 970 events. 454/970 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5406 event pairs, 414 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 1870. Up to 896 conditions per place. [2023-08-30 10:19:30,550 INFO L137 encePairwiseOnDemand]: 404/407 looper letters, 47 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-30 10:19:30,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 228 flow [2023-08-30 10:19:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:19:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:19:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 774 transitions. [2023-08-30 10:19:30,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47542997542997545 [2023-08-30 10:19:30,553 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 774 transitions. [2023-08-30 10:19:30,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 774 transitions. [2023-08-30 10:19:30,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:30,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 774 transitions. [2023-08-30 10:19:30,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.5) internal successors, (774), 4 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 407.0) internal successors, (2035), 5 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 407.0) internal successors, (2035), 5 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,561 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 134 flow. Second operand 4 states and 774 transitions. [2023-08-30 10:19:30,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 228 flow [2023-08-30 10:19:30,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 224 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:30,564 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 130 flow [2023-08-30 10:19:30,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-30 10:19:30,565 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2023-08-30 10:19:30,565 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 130 flow [2023-08-30 10:19:30,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:30,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 10:19:30,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 10:19:30,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:30,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:30,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash -666401115, now seen corresponding path program 1 times [2023-08-30 10:19:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675939378] [2023-08-30 10:19:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:30,844 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:19:30,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675939378] [2023-08-30 10:19:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675939378] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:30,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719778880] [2023-08-30 10:19:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:30,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:30,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:30,848 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:19:30,850 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:19:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:30,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:19:30,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:30,926 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:19:30,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:30,947 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:19:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719778880] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:30,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 10:19:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010263003] [2023-08-30 10:19:30,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:30,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:19:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:19:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:19:30,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 407 [2023-08-30 10:19:30,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 130 flow. Second operand has 7 states, 7 states have (on average 181.57142857142858) internal successors, (1271), 7 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:30,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:30,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 407 [2023-08-30 10:19:30,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:31,122 INFO L130 PetriNetUnfolder]: 454/973 cut-off events. [2023-08-30 10:19:31,123 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-30 10:19:31,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 973 events. 454/973 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5410 event pairs, 414 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 1879. Up to 897 conditions per place. [2023-08-30 10:19:31,127 INFO L137 encePairwiseOnDemand]: 404/407 looper letters, 47 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-30 10:19:31,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 246 flow [2023-08-30 10:19:31,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:19:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:19:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2023-08-30 10:19:31,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46478296478296477 [2023-08-30 10:19:31,130 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2023-08-30 10:19:31,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2023-08-30 10:19:31,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:31,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2023-08-30 10:19:31,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,139 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 130 flow. Second operand 6 states and 1135 transitions. [2023-08-30 10:19:31,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 246 flow [2023-08-30 10:19:31,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:19:31,141 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 163 flow [2023-08-30 10:19:31,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-30 10:19:31,142 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-08-30 10:19:31,142 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 163 flow [2023-08-30 10:19:31,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 181.57142857142858) internal successors, (1271), 7 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:31,143 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2023-08-30 10:19:31,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 10:19:31,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-30 10:19:31,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:31,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash -708808540, now seen corresponding path program 2 times [2023-08-30 10:19:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:31,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171506523] [2023-08-30 10:19:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:31,437 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:19:31,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:31,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171506523] [2023-08-30 10:19:31,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171506523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:31,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:31,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:19:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453455389] [2023-08-30 10:19:31,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:31,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:19:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:31,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:19:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:19:31,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 407 [2023-08-30 10:19:31,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:31,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 407 [2023-08-30 10:19:31,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:31,577 INFO L130 PetriNetUnfolder]: 399/886 cut-off events. [2023-08-30 10:19:31,577 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 10:19:31,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 886 events. 399/886 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5295 event pairs, 0 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 1726. Up to 787 conditions per place. [2023-08-30 10:19:31,581 INFO L137 encePairwiseOnDemand]: 402/407 looper letters, 67 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-30 10:19:31,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 335 flow [2023-08-30 10:19:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:19:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:19:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-08-30 10:19:31,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004095004095004 [2023-08-30 10:19:31,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-08-30 10:19:31,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-08-30 10:19:31,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:31,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-08-30 10:19:31,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 407.0) internal successors, (1628), 4 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 407.0) internal successors, (1628), 4 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,589 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 163 flow. Second operand 3 states and 611 transitions. [2023-08-30 10:19:31,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 335 flow [2023-08-30 10:19:31,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 321 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:31,592 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 153 flow [2023-08-30 10:19:31,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-08-30 10:19:31,593 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-08-30 10:19:31,593 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 153 flow [2023-08-30 10:19:31,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:31,594 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:31,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 10:19:31,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:31,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 740072570, now seen corresponding path program 1 times [2023-08-30 10:19:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50072224] [2023-08-30 10:19:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:31,681 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:19:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50072224] [2023-08-30 10:19:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50072224] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676265692] [2023-08-30 10:19:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:31,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:31,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:31,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 10:19:31,709 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:19:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:31,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:19:31,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:31,784 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:19:31,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:31,840 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:19:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676265692] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:31,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 10:19:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434756962] [2023-08-30 10:19:31,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:31,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:19:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:31,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:19:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 10:19:31,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 407 [2023-08-30 10:19:31,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 153 flow. Second operand has 13 states, 13 states have (on average 181.46153846153845) internal successors, (2359), 13 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:31,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:31,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 407 [2023-08-30 10:19:31,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:32,028 INFO L130 PetriNetUnfolder]: 418/876 cut-off events. [2023-08-30 10:19:32,028 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-30 10:19:32,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 876 events. 418/876 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4691 event pairs, 378 based on Foata normal form. 6/670 useless extension candidates. Maximal degree in co-relation 1769. Up to 804 conditions per place. [2023-08-30 10:19:32,032 INFO L137 encePairwiseOnDemand]: 404/407 looper letters, 45 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2023-08-30 10:19:32,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 63 transitions, 301 flow [2023-08-30 10:19:32,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:19:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:19:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2222 transitions. [2023-08-30 10:19:32,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45495495495495497 [2023-08-30 10:19:32,038 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2222 transitions. [2023-08-30 10:19:32,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2222 transitions. [2023-08-30 10:19:32,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:32,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2222 transitions. [2023-08-30 10:19:32,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 185.16666666666666) internal successors, (2222), 12 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 407.0) internal successors, (5291), 13 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,051 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 407.0) internal successors, (5291), 13 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,051 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 153 flow. Second operand 12 states and 2222 transitions. [2023-08-30 10:19:32,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 63 transitions, 301 flow [2023-08-30 10:19:32,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 63 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:19:32,054 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 233 flow [2023-08-30 10:19:32,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=233, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2023-08-30 10:19:32,055 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2023-08-30 10:19:32,055 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 233 flow [2023-08-30 10:19:32,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 181.46153846153845) internal successors, (2359), 13 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:32,056 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:32,065 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:19:32,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:32,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:32,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash 12516570, now seen corresponding path program 2 times [2023-08-30 10:19:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178428530] [2023-08-30 10:19:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:32,523 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:19:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178428530] [2023-08-30 10:19:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178428530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:32,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:19:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948397227] [2023-08-30 10:19:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:19:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:19:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:19:32,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 407 [2023-08-30 10:19:32,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:32,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 407 [2023-08-30 10:19:32,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:32,902 INFO L130 PetriNetUnfolder]: 402/926 cut-off events. [2023-08-30 10:19:32,902 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-30 10:19:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 926 events. 402/926 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5360 event pairs, 90 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1873. Up to 580 conditions per place. [2023-08-30 10:19:32,906 INFO L137 encePairwiseOnDemand]: 395/407 looper letters, 101 selfloop transitions, 10 changer transitions 5/123 dead transitions. [2023-08-30 10:19:32,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 123 transitions, 597 flow [2023-08-30 10:19:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:19:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:19:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1150 transitions. [2023-08-30 10:19:32,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47092547092547093 [2023-08-30 10:19:32,910 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1150 transitions. [2023-08-30 10:19:32,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1150 transitions. [2023-08-30 10:19:32,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:32,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1150 transitions. [2023-08-30 10:19:32,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 191.66666666666666) internal successors, (1150), 6 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,917 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,917 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 233 flow. Second operand 6 states and 1150 transitions. [2023-08-30 10:19:32,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 123 transitions, 597 flow [2023-08-30 10:19:32,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 123 transitions, 549 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 10:19:32,921 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 265 flow [2023-08-30 10:19:32,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2023-08-30 10:19:32,922 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2023-08-30 10:19:32,922 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 265 flow [2023-08-30 10:19:32,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:32,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:32,923 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:32,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 10:19:32,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:32,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1812012625, now seen corresponding path program 1 times [2023-08-30 10:19:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271920595] [2023-08-30 10:19:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:33,114 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:19:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271920595] [2023-08-30 10:19:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271920595] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598493174] [2023-08-30 10:19:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:33,117 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:19:33,126 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:19:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:33,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 10:19:33,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:33,239 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:19:33,326 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:19:33,327 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:19:33,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:19:33,400 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:19:33,411 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:19:33,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:33,438 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_168 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_168) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:19:33,463 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_168 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_168) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:19:33,591 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:19:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598493174] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:33,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-30 10:19:33,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831868999] [2023-08-30 10:19:33,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:33,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:19:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:33,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:19:33,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=84, Unknown=2, NotChecked=38, Total=156 [2023-08-30 10:19:33,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 407 [2023-08-30 10:19:33,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 265 flow. Second operand has 13 states, 13 states have (on average 151.15384615384616) internal successors, (1965), 13 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:33,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:33,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 407 [2023-08-30 10:19:33,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:33,954 INFO L130 PetriNetUnfolder]: 401/920 cut-off events. [2023-08-30 10:19:33,954 INFO L131 PetriNetUnfolder]: For 299/305 co-relation queries the response was YES. [2023-08-30 10:19:33,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 920 events. 401/920 cut-off events. For 299/305 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5305 event pairs, 103 based on Foata normal form. 4/770 useless extension candidates. Maximal degree in co-relation 2089. Up to 580 conditions per place. [2023-08-30 10:19:33,959 INFO L137 encePairwiseOnDemand]: 398/407 looper letters, 98 selfloop transitions, 9 changer transitions 0/114 dead transitions. [2023-08-30 10:19:33,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 579 flow [2023-08-30 10:19:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:19:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:19:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 992 transitions. [2023-08-30 10:19:33,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4062244062244062 [2023-08-30 10:19:33,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 992 transitions. [2023-08-30 10:19:33,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 992 transitions. [2023-08-30 10:19:33,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:33,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 992 transitions. [2023-08-30 10:19:33,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:33,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:33,969 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:33,969 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 265 flow. Second operand 6 states and 992 transitions. [2023-08-30 10:19:33,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 579 flow [2023-08-30 10:19:33,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 114 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:33,973 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 289 flow [2023-08-30 10:19:33,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2023-08-30 10:19:33,974 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2023-08-30 10:19:33,974 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 289 flow [2023-08-30 10:19:33,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 151.15384615384616) internal successors, (1965), 13 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:33,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:33,975 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:33,983 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:19:34,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:34,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:34,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1540622577, now seen corresponding path program 1 times [2023-08-30 10:19:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336218727] [2023-08-30 10:19:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:34,312 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:19:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336218727] [2023-08-30 10:19:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336218727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:34,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:19:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539962939] [2023-08-30 10:19:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:34,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:19:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:19:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:19:34,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 407 [2023-08-30 10:19:34,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:34,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:34,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 407 [2023-08-30 10:19:34,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:34,485 INFO L130 PetriNetUnfolder]: 401/966 cut-off events. [2023-08-30 10:19:34,485 INFO L131 PetriNetUnfolder]: For 505/506 co-relation queries the response was YES. [2023-08-30 10:19:34,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 966 events. 401/966 cut-off events. For 505/506 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5619 event pairs, 168 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 2268. Up to 519 conditions per place. [2023-08-30 10:19:34,491 INFO L137 encePairwiseOnDemand]: 399/407 looper letters, 83 selfloop transitions, 11 changer transitions 1/102 dead transitions. [2023-08-30 10:19:34,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 102 transitions, 562 flow [2023-08-30 10:19:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:19:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:19:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2023-08-30 10:19:34,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028665028665029 [2023-08-30 10:19:34,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 614 transitions. [2023-08-30 10:19:34,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 614 transitions. [2023-08-30 10:19:34,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:34,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 614 transitions. [2023-08-30 10:19:34,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:34,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 407.0) internal successors, (1628), 4 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:34,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 407.0) internal successors, (1628), 4 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:34,510 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 289 flow. Second operand 3 states and 614 transitions. [2023-08-30 10:19:34,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 102 transitions, 562 flow [2023-08-30 10:19:34,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 10:19:34,514 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 346 flow [2023-08-30 10:19:34,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2023-08-30 10:19:34,515 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-08-30 10:19:34,515 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 346 flow [2023-08-30 10:19:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:34,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:34,516 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 10:19:34,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:34,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1540622512, now seen corresponding path program 1 times [2023-08-30 10:19:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507905156] [2023-08-30 10:19:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:34,821 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:19:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:34,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507905156] [2023-08-30 10:19:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507905156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 10:19:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156479998] [2023-08-30 10:19:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:34,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:19:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:19:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:19:35,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 407 [2023-08-30 10:19:35,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 170.5) internal successors, (1364), 8 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:35,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:35,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 407 [2023-08-30 10:19:35,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:35,528 INFO L130 PetriNetUnfolder]: 440/1066 cut-off events. [2023-08-30 10:19:35,529 INFO L131 PetriNetUnfolder]: For 990/996 co-relation queries the response was YES. [2023-08-30 10:19:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2723 conditions, 1066 events. 440/1066 cut-off events. For 990/996 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6506 event pairs, 63 based on Foata normal form. 26/984 useless extension candidates. Maximal degree in co-relation 2693. Up to 500 conditions per place. [2023-08-30 10:19:35,534 INFO L137 encePairwiseOnDemand]: 393/407 looper letters, 156 selfloop transitions, 25 changer transitions 5/193 dead transitions. [2023-08-30 10:19:35,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 193 transitions, 1063 flow [2023-08-30 10:19:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 10:19:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 10:19:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2031 transitions. [2023-08-30 10:19:35,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4536519991065446 [2023-08-30 10:19:35,539 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2031 transitions. [2023-08-30 10:19:35,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2031 transitions. [2023-08-30 10:19:35,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:35,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2031 transitions. [2023-08-30 10:19:35,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 184.63636363636363) internal successors, (2031), 11 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:35,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 407.0) internal successors, (4884), 12 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:35,550 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 407.0) internal successors, (4884), 12 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:35,550 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 346 flow. Second operand 11 states and 2031 transitions. [2023-08-30 10:19:35,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 193 transitions, 1063 flow [2023-08-30 10:19:35,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 193 transitions, 1021 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 10:19:35,557 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 469 flow [2023-08-30 10:19:35,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=469, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2023-08-30 10:19:35,558 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 45 predicate places. [2023-08-30 10:19:35,558 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 469 flow [2023-08-30 10:19:35,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 170.5) internal successors, (1364), 8 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:35,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:35,559 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:35,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 10:19:35,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:35,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 301071637, now seen corresponding path program 1 times [2023-08-30 10:19:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987006543] [2023-08-30 10:19:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:35,852 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:19:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987006543] [2023-08-30 10:19:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987006543] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806558842] [2023-08-30 10:19:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:35,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:35,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:35,857 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:19:35,880 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:19:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 10:19:35,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:35,972 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:19:36,043 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:19:36,043 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:19:36,053 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:19:36,134 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:19:36,188 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:19:36,208 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:19:36,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:36,234 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_317) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648))) is different from false [2023-08-30 10:19:36,253 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_316 Int)) (or (< v_ArrVal_316 (+ |c_t_funThread1of1ForFork0_#t~post36#1| 1)) (< 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_316)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_317) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)))) is different from false [2023-08-30 10:19:36,266 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_316 Int)) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_316)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_317) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_316 (+ 1 (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-30 10:19:36,300 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_316 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_316)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_317) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_316 (+ (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:19:36,332 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_316 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_314))) (let ((.cse0 (select .cse1 |c_~#a~0.base|))) (or (< v_ArrVal_316 (+ (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (select (store (store .cse1 |c_~#a~0.base| (store .cse0 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_316)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_317) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)))))) is different from false [2023-08-30 10:19:36,537 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:19:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806558842] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:36,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-30 10:19:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490532245] [2023-08-30 10:19:36,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:36,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 10:19:36,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:36,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 10:19:36,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=145, Unknown=5, NotChecked=140, Total=342 [2023-08-30 10:19:36,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 407 [2023-08-30 10:19:36,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 469 flow. Second operand has 19 states, 19 states have (on average 144.89473684210526) internal successors, (2753), 19 states have internal predecessors, (2753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:36,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:36,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 407 [2023-08-30 10:19:36,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:37,726 INFO L130 PetriNetUnfolder]: 449/1088 cut-off events. [2023-08-30 10:19:37,726 INFO L131 PetriNetUnfolder]: For 1327/1337 co-relation queries the response was YES. [2023-08-30 10:19:37,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 1088 events. 449/1088 cut-off events. For 1327/1337 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6631 event pairs, 52 based on Foata normal form. 8/986 useless extension candidates. Maximal degree in co-relation 2999. Up to 386 conditions per place. [2023-08-30 10:19:37,733 INFO L137 encePairwiseOnDemand]: 392/407 looper letters, 192 selfloop transitions, 37 changer transitions 7/243 dead transitions. [2023-08-30 10:19:37,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 243 transitions, 1390 flow [2023-08-30 10:19:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 10:19:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 10:19:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2937 transitions. [2023-08-30 10:19:37,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37980085348506404 [2023-08-30 10:19:37,740 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2937 transitions. [2023-08-30 10:19:37,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2937 transitions. [2023-08-30 10:19:37,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:37,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2937 transitions. [2023-08-30 10:19:37,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 154.57894736842104) internal successors, (2937), 19 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:37,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 407.0) internal successors, (8140), 20 states have internal predecessors, (8140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:37,757 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 407.0) internal successors, (8140), 20 states have internal predecessors, (8140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:37,757 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 469 flow. Second operand 19 states and 2937 transitions. [2023-08-30 10:19:37,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 243 transitions, 1390 flow [2023-08-30 10:19:37,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 243 transitions, 1363 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 10:19:37,767 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 665 flow [2023-08-30 10:19:37,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=665, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2023-08-30 10:19:37,768 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 65 predicate places. [2023-08-30 10:19:37,768 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 665 flow [2023-08-30 10:19:37,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 144.89473684210526) internal successors, (2753), 19 states have internal predecessors, (2753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:37,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:37,769 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:37,779 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:19:37,975 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,SelfDestructingSolverStorable9 [2023-08-30 10:19:37,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:37,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1936443344, now seen corresponding path program 1 times [2023-08-30 10:19:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:37,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171284076] [2023-08-30 10:19:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:38,030 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:19:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:38,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171284076] [2023-08-30 10:19:38,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171284076] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:38,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431356138] [2023-08-30 10:19:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:38,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:38,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:38,033 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:19:38,040 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:19:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:38,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:19:38,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:38,146 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:19:38,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:38,157 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:19:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431356138] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:38,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 10:19:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592867263] [2023-08-30 10:19:38,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:38,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:19:38,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:19:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:19:38,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 407 [2023-08-30 10:19:38,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 99 transitions, 665 flow. Second operand has 7 states, 7 states have (on average 183.14285714285714) internal successors, (1282), 7 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:38,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:38,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 407 [2023-08-30 10:19:38,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:38,225 INFO L130 PetriNetUnfolder]: 19/96 cut-off events. [2023-08-30 10:19:38,225 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2023-08-30 10:19:38,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 96 events. 19/96 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 268 event pairs, 0 based on Foata normal form. 16/109 useless extension candidates. Maximal degree in co-relation 350. Up to 55 conditions per place. [2023-08-30 10:19:38,226 INFO L137 encePairwiseOnDemand]: 404/407 looper letters, 30 selfloop transitions, 2 changer transitions 18/53 dead transitions. [2023-08-30 10:19:38,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 53 transitions, 422 flow [2023-08-30 10:19:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:19:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:19:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 757 transitions. [2023-08-30 10:19:38,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46498771498771496 [2023-08-30 10:19:38,229 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 757 transitions. [2023-08-30 10:19:38,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 757 transitions. [2023-08-30 10:19:38,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:38,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 757 transitions. [2023-08-30 10:19:38,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:38,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 407.0) internal successors, (2035), 5 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:38,243 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 407.0) internal successors, (2035), 5 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:38,243 INFO L175 Difference]: Start difference. First operand has 123 places, 99 transitions, 665 flow. Second operand 4 states and 757 transitions. [2023-08-30 10:19:38,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 53 transitions, 422 flow [2023-08-30 10:19:38,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 291 flow, removed 11 selfloop flow, removed 29 redundant places. [2023-08-30 10:19:38,245 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 135 flow [2023-08-30 10:19:38,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=135, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2023-08-30 10:19:38,246 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2023-08-30 10:19:38,247 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 135 flow [2023-08-30 10:19:38,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 183.14285714285714) internal successors, (1282), 7 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:38,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:38,247 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:38,255 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:19:38,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:38,453 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-08-30 10:19:38,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1225396886, now seen corresponding path program 1 times [2023-08-30 10:19:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896662967] [2023-08-30 10:19:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:38,657 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:19:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896662967] [2023-08-30 10:19:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896662967] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:38,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127593674] [2023-08-30 10:19:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:38,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:38,660 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:19:38,662 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:19:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:38,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 10:19:38,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:38,797 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:19:38,798 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:19:38,837 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:19:38,870 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:19:38,880 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:19:38,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:38,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:19:38,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-30 10:19:38,923 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 29 treesize of output 21 [2023-08-30 10:19:38,959 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:19:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127593674] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:38,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:38,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-30 10:19:38,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156794211] [2023-08-30 10:19:38,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:38,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 10:19:38,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:38,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 10:19:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=137, Unknown=1, NotChecked=0, Total=182 [2023-08-30 10:19:39,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 407 [2023-08-30 10:19:39,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 135 flow. Second operand has 14 states, 14 states have (on average 173.5) internal successors, (2429), 14 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:39,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:39,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 407 [2023-08-30 10:19:39,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:39,427 INFO L130 PetriNetUnfolder]: 9/56 cut-off events. [2023-08-30 10:19:39,427 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-30 10:19:39,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 56 events. 9/56 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 160. Up to 17 conditions per place. [2023-08-30 10:19:39,428 INFO L137 encePairwiseOnDemand]: 402/407 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2023-08-30 10:19:39,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 30 transitions, 192 flow [2023-08-30 10:19:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:19:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:19:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1042 transitions. [2023-08-30 10:19:39,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266994266994267 [2023-08-30 10:19:39,430 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1042 transitions. [2023-08-30 10:19:39,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1042 transitions. [2023-08-30 10:19:39,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:39,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1042 transitions. [2023-08-30 10:19:39,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:39,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:39,436 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 407.0) internal successors, (2849), 7 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:39,436 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 135 flow. Second operand 6 states and 1042 transitions. [2023-08-30 10:19:39,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 30 transitions, 192 flow [2023-08-30 10:19:39,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 30 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 10:19:39,438 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2023-08-30 10:19:39,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=407, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=6, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2023-08-30 10:19:39,438 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-08-30 10:19:39,438 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2023-08-30 10:19:39,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 173.5) internal successors, (2429), 14 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:39,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-08-30 10:19:39,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-30 10:19:39,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-08-30 10:19:39,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-08-30 10:19:39,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-08-30 10:19:39,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-30 10:19:39,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-30 10:19:39,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-30 10:19:39,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-30 10:19:39,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-30 10:19:39,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-30 10:19:39,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-30 10:19:39,452 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:19:39,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:39,650 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:39,652 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 (1/2) [2023-08-30 10:19:39,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 216 transitions, 440 flow [2023-08-30 10:19:39,679 INFO L130 PetriNetUnfolder]: 45/293 cut-off events. [2023-08-30 10:19:39,679 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 10:19:39,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 293 events. 45/293 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 998 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-30 10:19:39,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 216 transitions, 440 flow [2023-08-30 10:19:39,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 205 transitions, 415 flow [2023-08-30 10:19:39,682 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:19:39,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 205 transitions, 415 flow [2023-08-30 10:19:39,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 205 transitions, 415 flow [2023-08-30 10:19:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 205 transitions, 415 flow [2023-08-30 10:19:39,699 INFO L130 PetriNetUnfolder]: 44/282 cut-off events. [2023-08-30 10:19:39,699 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:19:39,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 282 events. 44/282 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 944 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-30 10:19:39,705 INFO L119 LiptonReduction]: Number of co-enabled transitions 13050 [2023-08-30 10:19:42,119 INFO L134 LiptonReduction]: Checked pairs total: 22286 [2023-08-30 10:19:42,119 INFO L136 LiptonReduction]: Total number of compositions: 179 [2023-08-30 10:19:42,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 10:19:42,121 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;@14b0c5fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:19:42,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 10:19:42,124 INFO L130 PetriNetUnfolder]: 11/44 cut-off events. [2023-08-30 10:19:42,124 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:19:42,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:42,124 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 10:19:42,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:19:42,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2050580531, now seen corresponding path program 1 times [2023-08-30 10:19:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122043596] [2023-08-30 10:19:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:42,146 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:19:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122043596] [2023-08-30 10:19:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122043596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:42,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:19:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299314279] [2023-08-30 10:19:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:42,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:19:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:19:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:19:42,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 395 [2023-08-30 10:19:42,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 75 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:42,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 395 [2023-08-30 10:19:42,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:42,264 INFO L130 PetriNetUnfolder]: 454/967 cut-off events. [2023-08-30 10:19:42,264 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:19:42,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 967 events. 454/967 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5361 event pairs, 414 based on Foata normal form. 131/814 useless extension candidates. Maximal degree in co-relation 1806. Up to 894 conditions per place. [2023-08-30 10:19:42,266 INFO L137 encePairwiseOnDemand]: 369/395 looper letters, 26 selfloop transitions, 2 changer transitions 21/53 dead transitions. [2023-08-30 10:19:42,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 203 flow [2023-08-30 10:19:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:19:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:19:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2023-08-30 10:19:42,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172995780590718 [2023-08-30 10:19:42,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 613 transitions. [2023-08-30 10:19:42,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 613 transitions. [2023-08-30 10:19:42,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:42,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 613 transitions. [2023-08-30 10:19:42,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,273 INFO L175 Difference]: Start difference. First operand has 53 places, 75 transitions, 155 flow. Second operand 3 states and 613 transitions. [2023-08-30 10:19:42,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 203 flow [2023-08-30 10:19:42,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:19:42,274 INFO L231 Difference]: Finished difference. Result has 55 places, 32 transitions, 79 flow [2023-08-30 10:19:42,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2023-08-30 10:19:42,275 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-30 10:19:42,276 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 79 flow [2023-08-30 10:19:42,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:42,276 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:42,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 10:19:42,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:19:42,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash -289370782, now seen corresponding path program 1 times [2023-08-30 10:19:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:42,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614930586] [2023-08-30 10:19:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:42,305 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:19:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:42,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614930586] [2023-08-30 10:19:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614930586] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308683623] [2023-08-30 10:19:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:42,309 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:19:42,316 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:19:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:42,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:19:42,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:42,404 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:19:42,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:42,413 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:19:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308683623] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:42,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 10:19:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057279551] [2023-08-30 10:19:42,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:42,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:19:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:19:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:19:42,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 395 [2023-08-30 10:19:42,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 79 flow. Second operand has 7 states, 7 states have (on average 181.57142857142858) internal successors, (1271), 7 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:42,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 395 [2023-08-30 10:19:42,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:42,477 INFO L130 PetriNetUnfolder]: 97/233 cut-off events. [2023-08-30 10:19:42,477 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:19:42,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 233 events. 97/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 859 event pairs, 90 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 451. Up to 210 conditions per place. [2023-08-30 10:19:42,478 INFO L137 encePairwiseOnDemand]: 392/395 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2023-08-30 10:19:42,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 153 flow [2023-08-30 10:19:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:19:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:19:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1114 transitions. [2023-08-30 10:19:42,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470042194092827 [2023-08-30 10:19:42,481 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1114 transitions. [2023-08-30 10:19:42,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1114 transitions. [2023-08-30 10:19:42,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:42,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1114 transitions. [2023-08-30 10:19:42,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.66666666666666) internal successors, (1114), 6 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,488 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 79 flow. Second operand 6 states and 1114 transitions. [2023-08-30 10:19:42,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 153 flow [2023-08-30 10:19:42,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 149 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:42,489 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 111 flow [2023-08-30 10:19:42,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, 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:19:42,489 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 10:19:42,490 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 111 flow [2023-08-30 10:19:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 181.57142857142858) internal successors, (1271), 7 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:42,490 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-30 10:19:42,497 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:19:42,696 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,SelfDestructingSolverStorable13 [2023-08-30 10:19:42,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:19:42,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -114117645, now seen corresponding path program 2 times [2023-08-30 10:19:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751461499] [2023-08-30 10:19:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:42,758 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:19:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:42,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751461499] [2023-08-30 10:19:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751461499] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543317835] [2023-08-30 10:19:42,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:19:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:42,760 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:19:42,762 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:19:42,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:19:42,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:19:42,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:19:42,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:42,856 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:19:42,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:42,899 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:19:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543317835] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:42,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:42,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 10:19:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353010478] [2023-08-30 10:19:42,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:42,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:19:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:19:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 10:19:42,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 395 [2023-08-30 10:19:42,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 111 flow. Second operand has 13 states, 13 states have (on average 181.30769230769232) internal successors, (2357), 13 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:42,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:42,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 395 [2023-08-30 10:19:42,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:43,009 INFO L130 PetriNetUnfolder]: 97/239 cut-off events. [2023-08-30 10:19:43,009 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 10:19:43,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 239 events. 97/239 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 859 event pairs, 90 based on Foata normal form. 6/157 useless extension candidates. Maximal degree in co-relation 442. Up to 210 conditions per place. [2023-08-30 10:19:43,010 INFO L137 encePairwiseOnDemand]: 392/395 looper letters, 26 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2023-08-30 10:19:43,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 221 flow [2023-08-30 10:19:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:19:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:19:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2203 transitions. [2023-08-30 10:19:43,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647679324894515 [2023-08-30 10:19:43,017 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2203 transitions. [2023-08-30 10:19:43,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2203 transitions. [2023-08-30 10:19:43,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:43,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2203 transitions. [2023-08-30 10:19:43,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 183.58333333333334) internal successors, (2203), 12 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:43,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 395.0) internal successors, (5135), 13 states have internal predecessors, (5135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:43,028 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 395.0) internal successors, (5135), 13 states have internal predecessors, (5135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:43,029 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 111 flow. Second operand 12 states and 2203 transitions. [2023-08-30 10:19:43,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 221 flow [2023-08-30 10:19:43,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 207 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:43,030 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 181 flow [2023-08-30 10:19:43,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, 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:19:43,031 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-30 10:19:43,031 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 181 flow [2023-08-30 10:19:43,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 181.30769230769232) internal successors, (2357), 13 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:43,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:43,032 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-30 10:19:43,040 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:19:43,237 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,SelfDestructingSolverStorable14 [2023-08-30 10:19:43,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 10:19:43,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1557271149, now seen corresponding path program 3 times [2023-08-30 10:19:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003441325] [2023-08-30 10:19:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 10:19:43,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 10:19:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 10:19:43,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 10:19:43,289 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 10:19:43,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 10:19:43,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 10:19:43,290 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 10:19:43,291 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 10:19:43,291 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 10:19:43,291 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 10:19:43,323 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 10:19:43,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 293 transitions, 604 flow [2023-08-30 10:19:43,380 INFO L130 PetriNetUnfolder]: 75/483 cut-off events. [2023-08-30 10:19:43,380 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 10:19:43,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 483 events. 75/483 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2032 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 295. Up to 12 conditions per place. [2023-08-30 10:19:43,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 293 transitions, 604 flow [2023-08-30 10:19:43,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 293 transitions, 604 flow [2023-08-30 10:19:43,387 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 10:19:43,387 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 293 transitions, 604 flow [2023-08-30 10:19:43,387 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 253 places, 293 transitions, 604 flow [2023-08-30 10:19:43,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 293 transitions, 604 flow [2023-08-30 10:19:43,428 INFO L130 PetriNetUnfolder]: 75/483 cut-off events. [2023-08-30 10:19:43,428 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 10:19:43,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 483 events. 75/483 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2032 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 295. Up to 12 conditions per place. [2023-08-30 10:19:43,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 40200 [2023-08-30 10:19:46,585 INFO L134 LiptonReduction]: Checked pairs total: 72665 [2023-08-30 10:19:46,586 INFO L136 LiptonReduction]: Total number of compositions: 255 [2023-08-30 10:19:46,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 10:19:46,587 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;@14b0c5fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 10:19:46,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-30 10:19:46,588 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 10:19:46,588 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 10:19:46,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:46,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 10:19:46,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:19:46,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:46,589 INFO L85 PathProgramCache]: Analyzing trace with hash 52884, now seen corresponding path program 1 times [2023-08-30 10:19:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180749430] [2023-08-30 10:19:46,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:46,604 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:19:46,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180749430] [2023-08-30 10:19:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180749430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:46,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 10:19:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835360024] [2023-08-30 10:19:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:46,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:19:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:19:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:19:46,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 548 [2023-08-30 10:19:46,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 115 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:46,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:46,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 548 [2023-08-30 10:19:46,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:48,617 INFO L130 PetriNetUnfolder]: 18251/28784 cut-off events. [2023-08-30 10:19:48,617 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2023-08-30 10:19:48,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55609 conditions, 28784 events. 18251/28784 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 214164 event pairs, 17105 based on Foata normal form. 4164/24475 useless extension candidates. Maximal degree in co-relation 24652. Up to 26707 conditions per place. [2023-08-30 10:19:48,804 INFO L137 encePairwiseOnDemand]: 512/548 looper letters, 70 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2023-08-30 10:19:48,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 84 transitions, 330 flow [2023-08-30 10:19:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:19:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:19:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2023-08-30 10:19:48,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085158150851582 [2023-08-30 10:19:48,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2023-08-30 10:19:48,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2023-08-30 10:19:48,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:48,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2023-08-30 10:19:48,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:48,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:48,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:48,815 INFO L175 Difference]: Start difference. First operand has 83 places, 115 transitions, 248 flow. Second operand 3 states and 836 transitions. [2023-08-30 10:19:48,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 84 transitions, 330 flow [2023-08-30 10:19:48,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:19:48,817 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 198 flow [2023-08-30 10:19:48,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:19:48,818 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2023-08-30 10:19:48,818 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 198 flow [2023-08-30 10:19:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:48,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:48,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 10:19:48,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 10:19:48,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:19:48,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1642502, now seen corresponding path program 1 times [2023-08-30 10:19:48,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:48,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747705943] [2023-08-30 10:19:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:48,842 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:19:48,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:48,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747705943] [2023-08-30 10:19:48,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747705943] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:48,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473271310] [2023-08-30 10:19:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:48,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:48,844 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:19:48,847 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:19:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:48,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 10:19:48,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:48,927 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:19:48,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 10:19:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473271310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 10:19:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 10:19:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318674892] [2023-08-30 10:19:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:48,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:19:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:19:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:19:48,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 548 [2023-08-30 10:19:48,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:48,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:48,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 548 [2023-08-30 10:19:48,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:50,646 INFO L130 PetriNetUnfolder]: 18251/28783 cut-off events. [2023-08-30 10:19:50,647 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2023-08-30 10:19:50,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55614 conditions, 28783 events. 18251/28783 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 214110 event pairs, 17105 based on Foata normal form. 0/20311 useless extension candidates. Maximal degree in co-relation 55601. Up to 26705 conditions per place. [2023-08-30 10:19:50,755 INFO L137 encePairwiseOnDemand]: 545/548 looper letters, 69 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-30 10:19:50,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 336 flow [2023-08-30 10:19:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:19:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:19:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1044 transitions. [2023-08-30 10:19:50,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762773722627737 [2023-08-30 10:19:50,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1044 transitions. [2023-08-30 10:19:50,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1044 transitions. [2023-08-30 10:19:50,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:50,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1044 transitions. [2023-08-30 10:19:50,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:50,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 548.0) internal successors, (2740), 5 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:50,763 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 548.0) internal successors, (2740), 5 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:50,763 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 198 flow. Second operand 4 states and 1044 transitions. [2023-08-30 10:19:50,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 336 flow [2023-08-30 10:19:50,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 83 transitions, 332 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:50,765 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 194 flow [2023-08-30 10:19:50,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:19:50,765 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 3 predicate places. [2023-08-30 10:19:50,766 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 194 flow [2023-08-30 10:19:50,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:50,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:50,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:50,778 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:19:50,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 10:19:50,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:19:50,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:50,978 INFO L85 PathProgramCache]: Analyzing trace with hash 874584475, now seen corresponding path program 1 times [2023-08-30 10:19:50,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:50,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459723512] [2023-08-30 10:19:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:51,009 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:19:51,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459723512] [2023-08-30 10:19:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459723512] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445416206] [2023-08-30 10:19:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:51,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:51,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:51,011 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:19:51,032 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:19:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:51,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:19:51,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:51,104 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:19:51,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:51,113 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:19:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445416206] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:51,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 10:19:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169154930] [2023-08-30 10:19:51,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:51,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:19:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:19:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:19:51,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 548 [2023-08-30 10:19:51,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 243.57142857142858) internal successors, (1705), 7 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:51,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:51,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 548 [2023-08-30 10:19:51,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:52,719 INFO L130 PetriNetUnfolder]: 18251/28786 cut-off events. [2023-08-30 10:19:52,719 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2023-08-30 10:19:52,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55623 conditions, 28786 events. 18251/28786 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 214220 event pairs, 17105 based on Foata normal form. 0/20314 useless extension candidates. Maximal degree in co-relation 55610. Up to 26706 conditions per place. [2023-08-30 10:19:52,808 INFO L137 encePairwiseOnDemand]: 545/548 looper letters, 69 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-08-30 10:19:52,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 354 flow [2023-08-30 10:19:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 10:19:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 10:19:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1529 transitions. [2023-08-30 10:19:52,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650243309002433 [2023-08-30 10:19:52,811 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1529 transitions. [2023-08-30 10:19:52,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1529 transitions. [2023-08-30 10:19:52,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:52,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1529 transitions. [2023-08-30 10:19:52,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.83333333333334) internal successors, (1529), 6 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:52,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:52,818 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:52,818 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 194 flow. Second operand 6 states and 1529 transitions. [2023-08-30 10:19:52,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 354 flow [2023-08-30 10:19:52,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 86 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:19:52,820 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 227 flow [2023-08-30 10:19:52,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:19:52,821 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 9 predicate places. [2023-08-30 10:19:52,821 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 227 flow [2023-08-30 10:19:52,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 243.57142857142858) internal successors, (1705), 7 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:52,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:52,822 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:52,831 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:19:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:53,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:19:53,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1708027305, now seen corresponding path program 2 times [2023-08-30 10:19:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643636673] [2023-08-30 10:19:53,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:53,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:53,053 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:19:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643636673] [2023-08-30 10:19:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643636673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:19:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976263427] [2023-08-30 10:19:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:53,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:19:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:53,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:19:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:19:53,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 548 [2023-08-30 10:19:53,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:53,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:53,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 548 [2023-08-30 10:19:53,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:54,692 INFO L130 PetriNetUnfolder]: 17908/28330 cut-off events. [2023-08-30 10:19:54,692 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2023-08-30 10:19:54,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55110 conditions, 28330 events. 17908/28330 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 214801 event pairs, 8177 based on Foata normal form. 0/19878 useless extension candidates. Maximal degree in co-relation 55093. Up to 26596 conditions per place. [2023-08-30 10:19:54,792 INFO L137 encePairwiseOnDemand]: 543/548 looper letters, 92 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2023-08-30 10:19:54,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 106 transitions, 455 flow [2023-08-30 10:19:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:19:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:19:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2023-08-30 10:19:54,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 10:19:54,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 822 transitions. [2023-08-30 10:19:54,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 822 transitions. [2023-08-30 10:19:54,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:54,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 822 transitions. [2023-08-30 10:19:54,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:54,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:54,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:54,799 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 227 flow. Second operand 3 states and 822 transitions. [2023-08-30 10:19:54,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 106 transitions, 455 flow [2023-08-30 10:19:54,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 106 transitions, 441 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:54,802 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 229 flow [2023-08-30 10:19:54,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:19:54,802 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2023-08-30 10:19:54,802 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 229 flow [2023-08-30 10:19:54,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:54,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:54,803 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:54,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 10:19:54,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:19:54,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1788809949, now seen corresponding path program 1 times [2023-08-30 10:19:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:54,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846436826] [2023-08-30 10:19:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:54,855 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:19:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846436826] [2023-08-30 10:19:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846436826] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:19:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965020884] [2023-08-30 10:19:54,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:54,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:19:54,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:19:54,857 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:19:54,884 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:19:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:54,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 10:19:54,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:19:54,970 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:19:54,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:19:55,014 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:19:55,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965020884] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:19:55,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:19:55,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 10:19:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791923786] [2023-08-30 10:19:55,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:19:55,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:19:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:19:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 10:19:55,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 548 [2023-08-30 10:19:55,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 229 flow. Second operand has 13 states, 13 states have (on average 243.46153846153845) internal successors, (3165), 13 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:55,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:55,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 548 [2023-08-30 10:19:55,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:56,659 INFO L130 PetriNetUnfolder]: 18313/28500 cut-off events. [2023-08-30 10:19:56,659 INFO L131 PetriNetUnfolder]: For 911/911 co-relation queries the response was YES. [2023-08-30 10:19:56,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56697 conditions, 28500 events. 18313/28500 cut-off events. For 911/911 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 209613 event pairs, 17069 based on Foata normal form. 6/20409 useless extension candidates. Maximal degree in co-relation 56679. Up to 26613 conditions per place. [2023-08-30 10:19:56,753 INFO L137 encePairwiseOnDemand]: 545/548 looper letters, 70 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2023-08-30 10:19:56,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 427 flow [2023-08-30 10:19:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 10:19:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 10:19:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2990 transitions. [2023-08-30 10:19:56,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45468369829683697 [2023-08-30 10:19:56,758 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2990 transitions. [2023-08-30 10:19:56,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2990 transitions. [2023-08-30 10:19:56,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:19:56,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2990 transitions. [2023-08-30 10:19:56,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 249.16666666666666) internal successors, (2990), 12 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:56,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 548.0) internal successors, (7124), 13 states have internal predecessors, (7124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:56,768 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 548.0) internal successors, (7124), 13 states have internal predecessors, (7124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:56,768 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 229 flow. Second operand 12 states and 2990 transitions. [2023-08-30 10:19:56,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 427 flow [2023-08-30 10:19:56,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 93 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:19:56,772 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 311 flow [2023-08-30 10:19:56,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:19:56,773 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 27 predicate places. [2023-08-30 10:19:56,773 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 311 flow [2023-08-30 10:19:56,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 243.46153846153845) internal successors, (3165), 13 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:56,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:19:56,774 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:19:56,779 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:19:56,979 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,SelfDestructingSolverStorable20 [2023-08-30 10:19:56,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:19:56,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:19:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 749338653, now seen corresponding path program 2 times [2023-08-30 10:19:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:19:56,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99080933] [2023-08-30 10:19:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:19:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:19:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:19:57,112 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:19:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:19:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99080933] [2023-08-30 10:19:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99080933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:19:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:19:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:19:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198033594] [2023-08-30 10:19:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:19:57,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 10:19:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:19:57,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 10:19:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 10:19:57,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 548 [2023-08-30 10:19:57,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:19:57,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:19:57,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 548 [2023-08-30 10:19:57,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:19:59,882 INFO L130 PetriNetUnfolder]: 23365/37618 cut-off events. [2023-08-30 10:19:59,882 INFO L131 PetriNetUnfolder]: For 1250/1250 co-relation queries the response was YES. [2023-08-30 10:19:59,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75373 conditions, 37618 events. 23365/37618 cut-off events. For 1250/1250 co-relation queries the response was YES. Maximal size of possible extension queue 1509. Compared 307725 event pairs, 6174 based on Foata normal form. 0/27828 useless extension candidates. Maximal degree in co-relation 75347. Up to 22836 conditions per place. [2023-08-30 10:20:00,010 INFO L137 encePairwiseOnDemand]: 533/548 looper letters, 233 selfloop transitions, 25 changer transitions 0/270 dead transitions. [2023-08-30 10:20:00,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 270 transitions, 1237 flow [2023-08-30 10:20:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 10:20:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 10:20:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1884 transitions. [2023-08-30 10:20:00,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49113660062565173 [2023-08-30 10:20:00,012 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1884 transitions. [2023-08-30 10:20:00,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1884 transitions. [2023-08-30 10:20:00,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:00,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1884 transitions. [2023-08-30 10:20:00,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 269.14285714285717) internal successors, (1884), 7 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:00,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 548.0) internal successors, (4384), 8 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:00,016 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 548.0) internal successors, (4384), 8 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:00,016 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 311 flow. Second operand 7 states and 1884 transitions. [2023-08-30 10:20:00,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 270 transitions, 1237 flow [2023-08-30 10:20:00,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 270 transitions, 1189 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 10:20:00,021 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 427 flow [2023-08-30 10:20:00,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:20:00,022 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 32 predicate places. [2023-08-30 10:20:00,022 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 427 flow [2023-08-30 10:20:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:00,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:00,023 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:20:00,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 10:20:00,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:00,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1604855514, now seen corresponding path program 1 times [2023-08-30 10:20:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060583634] [2023-08-30 10:20:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:20:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060583634] [2023-08-30 10:20:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060583634] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014410790] [2023-08-30 10:20:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:00,066 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:20:00,069 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:20:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:00,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 10:20:00,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:00,185 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:20:00,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 10:20:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014410790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:20:00,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 10:20:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-30 10:20:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005721894] [2023-08-30 10:20:00,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:20:00,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:20:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:00,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:20:00,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:20:00,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 548 [2023-08-30 10:20:00,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 245.25) internal successors, (981), 4 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:00,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:00,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 548 [2023-08-30 10:20:00,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:02,758 INFO L130 PetriNetUnfolder]: 22470/36074 cut-off events. [2023-08-30 10:20:02,759 INFO L131 PetriNetUnfolder]: For 9790/9790 co-relation queries the response was YES. [2023-08-30 10:20:02,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82763 conditions, 36074 events. 22470/36074 cut-off events. For 9790/9790 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 287624 event pairs, 17000 based on Foata normal form. 0/28391 useless extension candidates. Maximal degree in co-relation 82734. Up to 34121 conditions per place. [2023-08-30 10:20:02,899 INFO L137 encePairwiseOnDemand]: 545/548 looper letters, 119 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2023-08-30 10:20:02,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 133 transitions, 712 flow [2023-08-30 10:20:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:20:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:20:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1060 transitions. [2023-08-30 10:20:02,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835766423357664 [2023-08-30 10:20:02,900 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1060 transitions. [2023-08-30 10:20:02,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1060 transitions. [2023-08-30 10:20:02,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:02,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1060 transitions. [2023-08-30 10:20:02,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:02,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 548.0) internal successors, (2740), 5 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:02,903 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 548.0) internal successors, (2740), 5 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:02,903 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 427 flow. Second operand 4 states and 1060 transitions. [2023-08-30 10:20:02,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 133 transitions, 712 flow [2023-08-30 10:20:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 712 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 10:20:02,934 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 427 flow [2023-08-30 10:20:02,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2023-08-30 10:20:02,935 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 34 predicate places. [2023-08-30 10:20:02,935 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 427 flow [2023-08-30 10:20:02,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 245.25) internal successors, (981), 4 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:02,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:02,936 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 10:20:02,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 10:20:03,141 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,SelfDestructingSolverStorable22 [2023-08-30 10:20:03,141 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:03,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1604855569, now seen corresponding path program 1 times [2023-08-30 10:20:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:03,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512990763] [2023-08-30 10:20:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:03,171 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:20:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512990763] [2023-08-30 10:20:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512990763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:20:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:20:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:20:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754178393] [2023-08-30 10:20:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:20:03,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:20:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:03,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:20:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:20:03,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 548 [2023-08-30 10:20:03,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:03,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:03,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 548 [2023-08-30 10:20:03,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:05,485 INFO L130 PetriNetUnfolder]: 21570/34584 cut-off events. [2023-08-30 10:20:05,485 INFO L131 PetriNetUnfolder]: For 8251/8252 co-relation queries the response was YES. [2023-08-30 10:20:05,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79315 conditions, 34584 events. 21570/34584 cut-off events. For 8251/8252 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 275395 event pairs, 6977 based on Foata normal form. 0/27705 useless extension candidates. Maximal degree in co-relation 79285. Up to 30473 conditions per place. [2023-08-30 10:20:05,632 INFO L137 encePairwiseOnDemand]: 544/548 looper letters, 141 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2023-08-30 10:20:05,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 159 transitions, 853 flow [2023-08-30 10:20:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:20:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:20:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-08-30 10:20:05,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054744525547445 [2023-08-30 10:20:05,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-08-30 10:20:05,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-08-30 10:20:05,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:05,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-08-30 10:20:05,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:05,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:05,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:05,636 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 427 flow. Second operand 3 states and 831 transitions. [2023-08-30 10:20:05,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 159 transitions, 853 flow [2023-08-30 10:20:05,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 159 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 10:20:05,655 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 446 flow [2023-08-30 10:20:05,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, 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:20:05,656 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 34 predicate places. [2023-08-30 10:20:05,656 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 446 flow [2023-08-30 10:20:05,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:05,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:05,656 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:20:05,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 10:20:05,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:05,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1090035324, now seen corresponding path program 1 times [2023-08-30 10:20:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107878905] [2023-08-30 10:20:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:05,792 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:20:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107878905] [2023-08-30 10:20:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107878905] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836308303] [2023-08-30 10:20:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:05,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:05,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:05,797 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:20:05,811 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:20:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:05,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 10:20:05,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:05,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:20:05,991 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:05,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:20:06,007 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:20:06,041 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:20:06,057 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:20:06,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:06,075 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_795) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-30 10:20:06,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_795) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-30 10:20:06,167 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:20:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836308303] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:06,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-30 10:20:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059070050] [2023-08-30 10:20:06,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:06,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:20:06,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:06,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:20:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=84, Unknown=2, NotChecked=38, Total=156 [2023-08-30 10:20:06,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 548 [2023-08-30 10:20:06,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 446 flow. Second operand has 13 states, 13 states have (on average 207.15384615384616) internal successors, (2693), 13 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:06,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:06,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 548 [2023-08-30 10:20:06,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:09,554 INFO L130 PetriNetUnfolder]: 22933/37120 cut-off events. [2023-08-30 10:20:09,554 INFO L131 PetriNetUnfolder]: For 14819/14865 co-relation queries the response was YES. [2023-08-30 10:20:09,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86353 conditions, 37120 events. 22933/37120 cut-off events. For 14819/14865 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 301310 event pairs, 7189 based on Foata normal form. 177/29879 useless extension candidates. Maximal degree in co-relation 86323. Up to 19913 conditions per place. [2023-08-30 10:20:09,715 INFO L137 encePairwiseOnDemand]: 534/548 looper letters, 326 selfloop transitions, 50 changer transitions 3/391 dead transitions. [2023-08-30 10:20:09,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 391 transitions, 2022 flow [2023-08-30 10:20:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 10:20:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 10:20:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3234 transitions. [2023-08-30 10:20:09,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215328467153285 [2023-08-30 10:20:09,720 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3234 transitions. [2023-08-30 10:20:09,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3234 transitions. [2023-08-30 10:20:09,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:09,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3234 transitions. [2023-08-30 10:20:09,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:09,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 548.0) internal successors, (8220), 15 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:09,730 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 548.0) internal successors, (8220), 15 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:09,730 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 446 flow. Second operand 14 states and 3234 transitions. [2023-08-30 10:20:09,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 391 transitions, 2022 flow [2023-08-30 10:20:09,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 391 transitions, 2001 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 10:20:09,794 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 762 flow [2023-08-30 10:20:09,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=762, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2023-08-30 10:20:09,795 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 52 predicate places. [2023-08-30 10:20:09,795 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 762 flow [2023-08-30 10:20:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 207.15384615384616) internal successors, (2693), 13 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:09,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:09,796 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:20:09,800 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:20:09,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:09,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:09,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -899996988, now seen corresponding path program 1 times [2023-08-30 10:20:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486243886] [2023-08-30 10:20:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:10,124 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:20:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486243886] [2023-08-30 10:20:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486243886] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140885291] [2023-08-30 10:20:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:10,126 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:20:10,129 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:20:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:10,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 10:20:10,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:10,251 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:20:10,298 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:10,298 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:20:10,313 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:20:10,338 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:20:10,364 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:20:10,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:10,397 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_860 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_860) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483650))) is different from false [2023-08-30 10:20:10,473 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:20:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140885291] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:10,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:10,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-30 10:20:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717022574] [2023-08-30 10:20:10,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:10,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 10:20:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 10:20:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=97, Unknown=1, NotChecked=20, Total=156 [2023-08-30 10:20:10,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 548 [2023-08-30 10:20:10,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 762 flow. Second operand has 13 states, 13 states have (on average 207.3846153846154) internal successors, (2696), 13 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:10,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:10,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 548 [2023-08-30 10:20:10,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:13,961 INFO L130 PetriNetUnfolder]: 23602/38576 cut-off events. [2023-08-30 10:20:13,961 INFO L131 PetriNetUnfolder]: For 35792/35832 co-relation queries the response was YES. [2023-08-30 10:20:14,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97272 conditions, 38576 events. 23602/38576 cut-off events. For 35792/35832 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 315906 event pairs, 5930 based on Foata normal form. 0/31821 useless extension candidates. Maximal degree in co-relation 97234. Up to 21791 conditions per place. [2023-08-30 10:20:14,368 INFO L137 encePairwiseOnDemand]: 533/548 looper letters, 260 selfloop transitions, 59 changer transitions 2/333 dead transitions. [2023-08-30 10:20:14,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 333 transitions, 2082 flow [2023-08-30 10:20:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 10:20:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 10:20:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2109 transitions. [2023-08-30 10:20:14,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276155717761557 [2023-08-30 10:20:14,372 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2109 transitions. [2023-08-30 10:20:14,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2109 transitions. [2023-08-30 10:20:14,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:14,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2109 transitions. [2023-08-30 10:20:14,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 234.33333333333334) internal successors, (2109), 9 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:14,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 548.0) internal successors, (5480), 10 states have internal predecessors, (5480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:14,378 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 548.0) internal successors, (5480), 10 states have internal predecessors, (5480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:14,379 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 762 flow. Second operand 9 states and 2109 transitions. [2023-08-30 10:20:14,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 333 transitions, 2082 flow [2023-08-30 10:20:14,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 333 transitions, 2023 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-30 10:20:14,528 INFO L231 Difference]: Finished difference. Result has 147 places, 166 transitions, 1103 flow [2023-08-30 10:20:14,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1103, PETRI_PLACES=147, PETRI_TRANSITIONS=166} [2023-08-30 10:20:14,529 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 64 predicate places. [2023-08-30 10:20:14,529 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 166 transitions, 1103 flow [2023-08-30 10:20:14,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 207.3846153846154) internal successors, (2696), 13 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:14,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:14,530 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:20:14,534 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:20:14,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-30 10:20:14,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:14,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash -851284214, now seen corresponding path program 1 times [2023-08-30 10:20:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:14,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644058459] [2023-08-30 10:20:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:14,806 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:20:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644058459] [2023-08-30 10:20:14,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644058459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:20:14,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:20:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 10:20:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590711251] [2023-08-30 10:20:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:20:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 10:20:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 10:20:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 10:20:14,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 548 [2023-08-30 10:20:14,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 166 transitions, 1103 flow. Second operand has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:14,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:14,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 548 [2023-08-30 10:20:14,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:19,642 INFO L130 PetriNetUnfolder]: 32971/53580 cut-off events. [2023-08-30 10:20:19,643 INFO L131 PetriNetUnfolder]: For 65310/65322 co-relation queries the response was YES. [2023-08-30 10:20:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144890 conditions, 53580 events. 32971/53580 cut-off events. For 65310/65322 co-relation queries the response was YES. Maximal size of possible extension queue 2238. Compared 454661 event pairs, 12910 based on Foata normal form. 0/45011 useless extension candidates. Maximal degree in co-relation 144845. Up to 24891 conditions per place. [2023-08-30 10:20:19,990 INFO L137 encePairwiseOnDemand]: 538/548 looper letters, 328 selfloop transitions, 44 changer transitions 1/385 dead transitions. [2023-08-30 10:20:19,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 385 transitions, 3134 flow [2023-08-30 10:20:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:20:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:20:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1384 transitions. [2023-08-30 10:20:19,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051094890510949 [2023-08-30 10:20:19,993 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1384 transitions. [2023-08-30 10:20:19,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1384 transitions. [2023-08-30 10:20:19,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:19,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1384 transitions. [2023-08-30 10:20:19,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 276.8) internal successors, (1384), 5 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:19,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 548.0) internal successors, (3288), 6 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:19,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 548.0) internal successors, (3288), 6 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:19,998 INFO L175 Difference]: Start difference. First operand has 147 places, 166 transitions, 1103 flow. Second operand 5 states and 1384 transitions. [2023-08-30 10:20:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 385 transitions, 3134 flow [2023-08-30 10:20:20,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 385 transitions, 3077 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 10:20:20,443 INFO L231 Difference]: Finished difference. Result has 154 places, 194 transitions, 1569 flow [2023-08-30 10:20:20,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1569, PETRI_PLACES=154, PETRI_TRANSITIONS=194} [2023-08-30 10:20:20,444 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 71 predicate places. [2023-08-30 10:20:20,444 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 194 transitions, 1569 flow [2023-08-30 10:20:20,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:20,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:20,444 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 10:20:20,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 10:20:20,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:20,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -851284215, now seen corresponding path program 1 times [2023-08-30 10:20:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234703556] [2023-08-30 10:20:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:20,615 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:20:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234703556] [2023-08-30 10:20:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234703556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:20:20,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:20:20,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 10:20:20,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914854087] [2023-08-30 10:20:20,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:20:20,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 10:20:20,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:20,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 10:20:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 10:20:20,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 548 [2023-08-30 10:20:20,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 194 transitions, 1569 flow. Second operand has 8 states, 8 states have (on average 230.5) internal successors, (1844), 8 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:20,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:20,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 548 [2023-08-30 10:20:20,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:27,272 INFO L130 PetriNetUnfolder]: 38407/62455 cut-off events. [2023-08-30 10:20:27,273 INFO L131 PetriNetUnfolder]: For 117977/118042 co-relation queries the response was YES. [2023-08-30 10:20:27,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185388 conditions, 62455 events. 38407/62455 cut-off events. For 117977/118042 co-relation queries the response was YES. Maximal size of possible extension queue 2639. Compared 543370 event pairs, 11472 based on Foata normal form. 581/55036 useless extension candidates. Maximal degree in co-relation 185339. Up to 37567 conditions per place. [2023-08-30 10:20:27,944 INFO L137 encePairwiseOnDemand]: 531/548 looper letters, 462 selfloop transitions, 113 changer transitions 0/587 dead transitions. [2023-08-30 10:20:27,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 587 transitions, 4538 flow [2023-08-30 10:20:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 10:20:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 10:20:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3649 transitions. [2023-08-30 10:20:27,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756256517205422 [2023-08-30 10:20:27,947 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3649 transitions. [2023-08-30 10:20:27,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3649 transitions. [2023-08-30 10:20:27,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:27,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3649 transitions. [2023-08-30 10:20:27,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 260.64285714285717) internal successors, (3649), 14 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:27,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 548.0) internal successors, (8220), 15 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:27,956 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 548.0) internal successors, (8220), 15 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:27,956 INFO L175 Difference]: Start difference. First operand has 154 places, 194 transitions, 1569 flow. Second operand 14 states and 3649 transitions. [2023-08-30 10:20:27,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 587 transitions, 4538 flow [2023-08-30 10:20:28,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 587 transitions, 4534 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-30 10:20:28,803 INFO L231 Difference]: Finished difference. Result has 172 places, 248 transitions, 2556 flow [2023-08-30 10:20:28,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2556, PETRI_PLACES=172, PETRI_TRANSITIONS=248} [2023-08-30 10:20:28,803 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 89 predicate places. [2023-08-30 10:20:28,803 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 248 transitions, 2556 flow [2023-08-30 10:20:28,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 230.5) internal successors, (1844), 8 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:28,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:28,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:20:28,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 10:20:28,804 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:28,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1724774150, now seen corresponding path program 1 times [2023-08-30 10:20:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509909345] [2023-08-30 10:20:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:29,007 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:20:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509909345] [2023-08-30 10:20:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509909345] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011074470] [2023-08-30 10:20:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:29,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:29,009 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:20:29,023 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:20:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:29,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 10:20:29,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:29,155 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:20:29,201 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:29,202 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:20:29,208 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:20:29,273 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:20:29,314 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:20:29,333 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:20:29,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:29,372 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 Int)) (or (< 0 (+ (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_1008)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1009) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1008 (+ |c_t_funThread1of2ForFork0_#t~post36#1| 1)))) is different from false [2023-08-30 10:20:29,384 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (< 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_1008)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1009) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1008 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:20:29,411 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< v_ArrVal_1008 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1009) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648))))) is different from false [2023-08-30 10:20:29,431 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1008 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_1006))) (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_1008)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1009) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1008 (+ (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-30 10:20:29,583 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:20:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011074470] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:29,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-30 10:20:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400356816] [2023-08-30 10:20:29,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 10:20:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 10:20:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=163, Unknown=7, NotChecked=116, Total=342 [2023-08-30 10:20:29,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 548 [2023-08-30 10:20:29,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 248 transitions, 2556 flow. Second operand has 19 states, 19 states have (on average 200.94736842105263) internal successors, (3818), 19 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:29,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:29,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 548 [2023-08-30 10:20:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:38,988 INFO L130 PetriNetUnfolder]: 42992/70128 cut-off events. [2023-08-30 10:20:38,989 INFO L131 PetriNetUnfolder]: For 195213/195287 co-relation queries the response was YES. [2023-08-30 10:20:39,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229198 conditions, 70128 events. 42992/70128 cut-off events. For 195213/195287 co-relation queries the response was YES. Maximal size of possible extension queue 2964. Compared 622226 event pairs, 9424 based on Foata normal form. 832/62116 useless extension candidates. Maximal degree in co-relation 229142. Up to 31739 conditions per place. [2023-08-30 10:20:39,547 INFO L137 encePairwiseOnDemand]: 531/548 looper letters, 661 selfloop transitions, 228 changer transitions 2/903 dead transitions. [2023-08-30 10:20:39,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 903 transitions, 7600 flow [2023-08-30 10:20:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 10:20:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 10:20:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4861 transitions. [2023-08-30 10:20:39,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4224018074383038 [2023-08-30 10:20:39,551 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4861 transitions. [2023-08-30 10:20:39,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4861 transitions. [2023-08-30 10:20:39,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:39,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4861 transitions. [2023-08-30 10:20:39,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 231.47619047619048) internal successors, (4861), 21 states have internal predecessors, (4861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:39,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 548.0) internal successors, (12056), 22 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:39,563 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 548.0) internal successors, (12056), 22 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:39,563 INFO L175 Difference]: Start difference. First operand has 172 places, 248 transitions, 2556 flow. Second operand 21 states and 4861 transitions. [2023-08-30 10:20:39,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 903 transitions, 7600 flow [2023-08-30 10:20:42,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 903 transitions, 7401 flow, removed 66 selfloop flow, removed 3 redundant places. [2023-08-30 10:20:42,166 INFO L231 Difference]: Finished difference. Result has 199 places, 372 transitions, 4627 flow [2023-08-30 10:20:42,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=2424, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4627, PETRI_PLACES=199, PETRI_TRANSITIONS=372} [2023-08-30 10:20:42,167 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 116 predicate places. [2023-08-30 10:20:42,167 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 372 transitions, 4627 flow [2023-08-30 10:20:42,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 200.94736842105263) internal successors, (3818), 19 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:42,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:42,168 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:20:42,175 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:20:42,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-30 10:20:42,373 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:42,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1932486981, now seen corresponding path program 1 times [2023-08-30 10:20:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241403884] [2023-08-30 10:20:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:42,409 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:20:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241403884] [2023-08-30 10:20:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241403884] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589725504] [2023-08-30 10:20:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:42,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:42,412 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:20:42,423 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:20:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:42,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 10:20:42,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:42,556 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:20:42,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:42,570 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:20:42,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589725504] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:42,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:42,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 10:20:42,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468265692] [2023-08-30 10:20:42,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:42,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 10:20:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:42,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 10:20:42,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 10:20:42,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 548 [2023-08-30 10:20:42,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 372 transitions, 4627 flow. Second operand has 7 states, 7 states have (on average 245.28571428571428) internal successors, (1717), 7 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:42,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:42,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 548 [2023-08-30 10:20:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:43,720 INFO L130 PetriNetUnfolder]: 3977/7327 cut-off events. [2023-08-30 10:20:43,720 INFO L131 PetriNetUnfolder]: For 51727/51731 co-relation queries the response was YES. [2023-08-30 10:20:43,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33441 conditions, 7327 events. 3977/7327 cut-off events. For 51727/51731 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 56197 event pairs, 1019 based on Foata normal form. 837/7487 useless extension candidates. Maximal degree in co-relation 33374. Up to 5055 conditions per place. [2023-08-30 10:20:43,763 INFO L137 encePairwiseOnDemand]: 545/548 looper letters, 286 selfloop transitions, 4 changer transitions 14/313 dead transitions. [2023-08-30 10:20:43,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 313 transitions, 4336 flow [2023-08-30 10:20:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 10:20:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 10:20:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1306 transitions. [2023-08-30 10:20:43,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47664233576642334 [2023-08-30 10:20:43,765 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1306 transitions. [2023-08-30 10:20:43,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1306 transitions. [2023-08-30 10:20:43,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:43,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1306 transitions. [2023-08-30 10:20:43,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:43,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 548.0) internal successors, (3288), 6 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:43,769 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 548.0) internal successors, (3288), 6 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:43,770 INFO L175 Difference]: Start difference. First operand has 199 places, 372 transitions, 4627 flow. Second operand 5 states and 1306 transitions. [2023-08-30 10:20:43,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 313 transitions, 4336 flow [2023-08-30 10:20:43,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 313 transitions, 3877 flow, removed 159 selfloop flow, removed 16 redundant places. [2023-08-30 10:20:43,950 INFO L231 Difference]: Finished difference. Result has 150 places, 175 transitions, 1860 flow [2023-08-30 10:20:43,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1860, PETRI_PLACES=150, PETRI_TRANSITIONS=175} [2023-08-30 10:20:43,951 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 67 predicate places. [2023-08-30 10:20:43,951 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 175 transitions, 1860 flow [2023-08-30 10:20:43,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 245.28571428571428) internal successors, (1717), 7 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:43,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:43,952 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:20:43,956 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:20:44,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:44,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:44,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:44,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1816198903, now seen corresponding path program 1 times [2023-08-30 10:20:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:44,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176759824] [2023-08-30 10:20:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:44,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:44,362 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:20:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176759824] [2023-08-30 10:20:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176759824] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033965990] [2023-08-30 10:20:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:44,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:44,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:44,365 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:20:44,392 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:20:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:44,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 10:20:44,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:44,543 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:44,543 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:20:44,605 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:20:44,628 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:20:44,648 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:20:44,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:44,668 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1156 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1156) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483649)) is different from false [2023-08-30 10:20:44,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:20:44,676 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:20:44,678 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:20:44,757 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:20:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033965990] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:44,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-30 10:20:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006130404] [2023-08-30 10:20:44,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:44,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:20:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:44,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:20:44,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2023-08-30 10:20:44,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 548 [2023-08-30 10:20:44,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 175 transitions, 1860 flow. Second operand has 20 states, 20 states have (on average 201.1) internal successors, (4022), 20 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:44,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:44,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 548 [2023-08-30 10:20:44,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:46,435 INFO L130 PetriNetUnfolder]: 4036/7578 cut-off events. [2023-08-30 10:20:46,435 INFO L131 PetriNetUnfolder]: For 49131/49134 co-relation queries the response was YES. [2023-08-30 10:20:46,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32658 conditions, 7578 events. 4036/7578 cut-off events. For 49131/49134 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 59596 event pairs, 988 based on Foata normal form. 65/6936 useless extension candidates. Maximal degree in co-relation 32602. Up to 1771 conditions per place. [2023-08-30 10:20:46,472 INFO L137 encePairwiseOnDemand]: 516/548 looper letters, 202 selfloop transitions, 117 changer transitions 55/383 dead transitions. [2023-08-30 10:20:46,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 383 transitions, 3964 flow [2023-08-30 10:20:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 10:20:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 10:20:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4227 transitions. [2023-08-30 10:20:46,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3856751824817518 [2023-08-30 10:20:46,477 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4227 transitions. [2023-08-30 10:20:46,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4227 transitions. [2023-08-30 10:20:46,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:46,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4227 transitions. [2023-08-30 10:20:46,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 211.35) internal successors, (4227), 20 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:46,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 548.0) internal successors, (11508), 21 states have internal predecessors, (11508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:46,490 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 548.0) internal successors, (11508), 21 states have internal predecessors, (11508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:46,490 INFO L175 Difference]: Start difference. First operand has 150 places, 175 transitions, 1860 flow. Second operand 20 states and 4227 transitions. [2023-08-30 10:20:46,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 383 transitions, 3964 flow [2023-08-30 10:20:46,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 383 transitions, 3859 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-30 10:20:46,635 INFO L231 Difference]: Finished difference. Result has 169 places, 204 transitions, 2494 flow [2023-08-30 10:20:46,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2494, PETRI_PLACES=169, PETRI_TRANSITIONS=204} [2023-08-30 10:20:46,635 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 86 predicate places. [2023-08-30 10:20:46,635 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 204 transitions, 2494 flow [2023-08-30 10:20:46,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 201.1) internal successors, (4022), 20 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:46,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:46,636 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:20:46,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-30 10:20:46,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:46,840 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:46,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash 125329443, now seen corresponding path program 1 times [2023-08-30 10:20:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:46,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696214725] [2023-08-30 10:20:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:46,923 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:20:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696214725] [2023-08-30 10:20:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696214725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:20:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:20:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 10:20:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134747162] [2023-08-30 10:20:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:20:46,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 10:20:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 10:20:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 10:20:46,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 548 [2023-08-30 10:20:46,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 204 transitions, 2494 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:46,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:46,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 548 [2023-08-30 10:20:46,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:47,625 INFO L130 PetriNetUnfolder]: 2831/5518 cut-off events. [2023-08-30 10:20:47,625 INFO L131 PetriNetUnfolder]: For 41720/41759 co-relation queries the response was YES. [2023-08-30 10:20:47,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26998 conditions, 5518 events. 2831/5518 cut-off events. For 41720/41759 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 42377 event pairs, 1194 based on Foata normal form. 6/5048 useless extension candidates. Maximal degree in co-relation 26939. Up to 3495 conditions per place. [2023-08-30 10:20:47,656 INFO L137 encePairwiseOnDemand]: 541/548 looper letters, 194 selfloop transitions, 61 changer transitions 0/264 dead transitions. [2023-08-30 10:20:47,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 264 transitions, 3769 flow [2023-08-30 10:20:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 10:20:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 10:20:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2023-08-30 10:20:47,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738442822384428 [2023-08-30 10:20:47,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2023-08-30 10:20:47,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2023-08-30 10:20:47,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:47,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2023-08-30 10:20:47,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:47,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:47,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:47,660 INFO L175 Difference]: Start difference. First operand has 169 places, 204 transitions, 2494 flow. Second operand 3 states and 779 transitions. [2023-08-30 10:20:47,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 264 transitions, 3769 flow [2023-08-30 10:20:47,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 264 transitions, 3478 flow, removed 96 selfloop flow, removed 9 redundant places. [2023-08-30 10:20:47,777 INFO L231 Difference]: Finished difference. Result has 160 places, 222 transitions, 2829 flow [2023-08-30 10:20:47,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2829, PETRI_PLACES=160, PETRI_TRANSITIONS=222} [2023-08-30 10:20:47,778 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 77 predicate places. [2023-08-30 10:20:47,778 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 222 transitions, 2829 flow [2023-08-30 10:20:47,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:47,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:47,778 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:20:47,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 10:20:47,779 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:47,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 125329402, now seen corresponding path program 1 times [2023-08-30 10:20:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437104169] [2023-08-30 10:20:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:47,956 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:20:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437104169] [2023-08-30 10:20:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437104169] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304332845] [2023-08-30 10:20:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:47,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:47,959 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:20:47,989 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:20:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:48,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 10:20:48,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:48,115 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:20:48,160 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:48,161 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:20:48,175 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:20:48,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 10:20:48,256 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:20:48,287 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:20:48,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:48,349 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1270 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1270) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-30 10:20:48,428 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:20:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304332845] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:48,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-30 10:20:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108153358] [2023-08-30 10:20:48,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:48,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 10:20:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 10:20:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2023-08-30 10:20:48,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 548 [2023-08-30 10:20:48,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 222 transitions, 2829 flow. Second operand has 19 states, 19 states have (on average 205.10526315789474) internal successors, (3897), 19 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:48,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:48,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 548 [2023-08-30 10:20:48,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:49,668 INFO L130 PetriNetUnfolder]: 2934/5794 cut-off events. [2023-08-30 10:20:49,668 INFO L131 PetriNetUnfolder]: For 48733/48805 co-relation queries the response was YES. [2023-08-30 10:20:49,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29503 conditions, 5794 events. 2934/5794 cut-off events. For 48733/48805 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 44794 event pairs, 590 based on Foata normal form. 168/5878 useless extension candidates. Maximal degree in co-relation 29448. Up to 3164 conditions per place. [2023-08-30 10:20:49,698 INFO L137 encePairwiseOnDemand]: 535/548 looper letters, 298 selfloop transitions, 121 changer transitions 11/439 dead transitions. [2023-08-30 10:20:49,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 439 transitions, 6150 flow [2023-08-30 10:20:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 10:20:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 10:20:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2385 transitions. [2023-08-30 10:20:49,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3956536164565362 [2023-08-30 10:20:49,701 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2385 transitions. [2023-08-30 10:20:49,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2385 transitions. [2023-08-30 10:20:49,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:49,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2385 transitions. [2023-08-30 10:20:49,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 216.8181818181818) internal successors, (2385), 11 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:49,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 548.0) internal successors, (6576), 12 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:49,708 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 548.0) internal successors, (6576), 12 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:49,708 INFO L175 Difference]: Start difference. First operand has 160 places, 222 transitions, 2829 flow. Second operand 11 states and 2385 transitions. [2023-08-30 10:20:49,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 439 transitions, 6150 flow [2023-08-30 10:20:49,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 439 transitions, 5948 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-08-30 10:20:49,841 INFO L231 Difference]: Finished difference. Result has 175 places, 291 transitions, 4315 flow [2023-08-30 10:20:49,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4315, PETRI_PLACES=175, PETRI_TRANSITIONS=291} [2023-08-30 10:20:49,842 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 92 predicate places. [2023-08-30 10:20:49,842 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 291 transitions, 4315 flow [2023-08-30 10:20:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 205.10526315789474) internal successors, (3897), 19 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:49,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:49,843 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:20:49,847 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:20:50,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:50,044 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:50,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1953982804, now seen corresponding path program 1 times [2023-08-30 10:20:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143191140] [2023-08-30 10:20:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:50,137 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:20:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143191140] [2023-08-30 10:20:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143191140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 10:20:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 10:20:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 10:20:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827163432] [2023-08-30 10:20:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 10:20:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 10:20:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 10:20:50,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 10:20:50,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 548 [2023-08-30 10:20:50,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 291 transitions, 4315 flow. Second operand has 5 states, 5 states have (on average 226.2) internal successors, (1131), 5 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:20:50,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:50,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 548 [2023-08-30 10:20:50,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:50,699 INFO L130 PetriNetUnfolder]: 1491/3195 cut-off events. [2023-08-30 10:20:50,699 INFO L131 PetriNetUnfolder]: For 28502/28502 co-relation queries the response was YES. [2023-08-30 10:20:50,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16596 conditions, 3195 events. 1491/3195 cut-off events. For 28502/28502 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 22540 event pairs, 386 based on Foata normal form. 324/3431 useless extension candidates. Maximal degree in co-relation 16542. Up to 1711 conditions per place. [2023-08-30 10:20:50,716 INFO L137 encePairwiseOnDemand]: 535/548 looper letters, 182 selfloop transitions, 20 changer transitions 18/226 dead transitions. [2023-08-30 10:20:50,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 226 transitions, 3409 flow [2023-08-30 10:20:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 10:20:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 10:20:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 970 transitions. [2023-08-30 10:20:50,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425182481751825 [2023-08-30 10:20:50,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 970 transitions. [2023-08-30 10:20:50,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 970 transitions. [2023-08-30 10:20:50,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:50,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 970 transitions. [2023-08-30 10:20:50,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 242.5) internal successors, (970), 4 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:50,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 548.0) internal successors, (2740), 5 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:50,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 548.0) internal successors, (2740), 5 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:50,726 INFO L175 Difference]: Start difference. First operand has 175 places, 291 transitions, 4315 flow. Second operand 4 states and 970 transitions. [2023-08-30 10:20:50,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 226 transitions, 3409 flow [2023-08-30 10:20:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 226 transitions, 3109 flow, removed 113 selfloop flow, removed 11 redundant places. [2023-08-30 10:20:50,789 INFO L231 Difference]: Finished difference. Result has 160 places, 161 transitions, 1926 flow [2023-08-30 10:20:50,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1926, PETRI_PLACES=160, PETRI_TRANSITIONS=161} [2023-08-30 10:20:50,789 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 77 predicate places. [2023-08-30 10:20:50,789 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 161 transitions, 1926 flow [2023-08-30 10:20:50,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.2) internal successors, (1131), 5 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:20:50,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:50,790 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:20:50,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-30 10:20:50,790 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:50,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1400464510, now seen corresponding path program 2 times [2023-08-30 10:20:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:50,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004768867] [2023-08-30 10:20:50,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:50,997 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:20:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:50,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004768867] [2023-08-30 10:20:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004768867] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350851786] [2023-08-30 10:20:50,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:20:50,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:50,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:51,001 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:20:51,011 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:20:51,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:20:51,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:20:51,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 10:20:51,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:51,197 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:51,198 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:20:51,267 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:20:51,292 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:20:51,304 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:20:51,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:51,318 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1390) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483649)) is different from false [2023-08-30 10:20:51,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:20:51,328 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:20:51,330 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 29 treesize of output 21 [2023-08-30 10:20:51,386 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:20:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350851786] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:51,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-08-30 10:20:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964127011] [2023-08-30 10:20:51,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 10:20:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 10:20:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=217, Unknown=1, NotChecked=30, Total=306 [2023-08-30 10:20:51,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 548 [2023-08-30 10:20:51,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 161 transitions, 1926 flow. Second operand has 18 states, 18 states have (on average 205.33333333333334) internal successors, (3696), 18 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:51,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:51,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 548 [2023-08-30 10:20:51,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:52,029 INFO L130 PetriNetUnfolder]: 1334/3087 cut-off events. [2023-08-30 10:20:52,029 INFO L131 PetriNetUnfolder]: For 23174/23211 co-relation queries the response was YES. [2023-08-30 10:20:52,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16273 conditions, 3087 events. 1334/3087 cut-off events. For 23174/23211 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 23106 event pairs, 250 based on Foata normal form. 23/3027 useless extension candidates. Maximal degree in co-relation 16223. Up to 1137 conditions per place. [2023-08-30 10:20:52,049 INFO L137 encePairwiseOnDemand]: 537/548 looper letters, 197 selfloop transitions, 45 changer transitions 8/259 dead transitions. [2023-08-30 10:20:52,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 259 transitions, 3437 flow [2023-08-30 10:20:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 10:20:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 10:20:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2345 transitions. [2023-08-30 10:20:52,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3890179163901792 [2023-08-30 10:20:52,052 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2345 transitions. [2023-08-30 10:20:52,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2345 transitions. [2023-08-30 10:20:52,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:52,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2345 transitions. [2023-08-30 10:20:52,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 213.1818181818182) internal successors, (2345), 11 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:52,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 548.0) internal successors, (6576), 12 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:52,059 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 548.0) internal successors, (6576), 12 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:52,059 INFO L175 Difference]: Start difference. First operand has 160 places, 161 transitions, 1926 flow. Second operand 11 states and 2345 transitions. [2023-08-30 10:20:52,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 259 transitions, 3437 flow [2023-08-30 10:20:52,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 259 transitions, 3414 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-30 10:20:52,106 INFO L231 Difference]: Finished difference. Result has 172 places, 170 transitions, 2196 flow [2023-08-30 10:20:52,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2196, PETRI_PLACES=172, PETRI_TRANSITIONS=170} [2023-08-30 10:20:52,107 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 89 predicate places. [2023-08-30 10:20:52,107 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 170 transitions, 2196 flow [2023-08-30 10:20:52,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 205.33333333333334) internal successors, (3696), 18 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:52,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:52,108 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:20:52,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-30 10:20:52,313 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,SelfDestructingSolverStorable34 [2023-08-30 10:20:52,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:52,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1400261811, now seen corresponding path program 2 times [2023-08-30 10:20:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47755640] [2023-08-30 10:20:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:52,520 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:20:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47755640] [2023-08-30 10:20:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47755640] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636774914] [2023-08-30 10:20:52,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:20:52,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:52,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:52,521 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:20:52,523 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:20:52,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:20:52,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:20:52,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-30 10:20:52,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:52,668 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:20:52,713 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:52,714 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:20:52,721 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:20:52,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:20:52,804 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:20:52,831 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:20:52,857 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:20:52,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:52,872 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1474 (Array Int Int))) (< 0 (+ 2147483648 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1474) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-30 10:20:52,882 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1472 Int) (v_ArrVal_1474 (Array Int Int))) (or (< 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_1472)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1474) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1472 (+ |c_t_funThread2of2ForFork0_#t~mem35#1| 1)))) is different from false [2023-08-30 10:20:52,890 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1472 Int) (v_ArrVal_1474 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (or (< v_ArrVal_1472 (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 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_1472)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1474) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648))))) is different from false [2023-08-30 10:20:52,913 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1472 Int) (v_ArrVal_1474 (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_1472)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1474) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1472 (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-30 10:20:52,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1472 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1471))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1474) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_1472 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-30 10:20:53,093 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:20:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636774914] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:53,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-30 10:20:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504835613] [2023-08-30 10:20:53,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:53,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 10:20:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 10:20:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=144, Unknown=5, NotChecked=140, Total=342 [2023-08-30 10:20:53,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 548 [2023-08-30 10:20:53,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 170 transitions, 2196 flow. Second operand has 19 states, 19 states have (on average 204.94736842105263) internal successors, (3894), 19 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:53,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:53,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 548 [2023-08-30 10:20:53,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:20:53,913 INFO L130 PetriNetUnfolder]: 1321/3061 cut-off events. [2023-08-30 10:20:53,913 INFO L131 PetriNetUnfolder]: For 26089/26126 co-relation queries the response was YES. [2023-08-30 10:20:53,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16870 conditions, 3061 events. 1321/3061 cut-off events. For 26089/26126 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 22985 event pairs, 273 based on Foata normal form. 21/3004 useless extension candidates. Maximal degree in co-relation 16817. Up to 1504 conditions per place. [2023-08-30 10:20:53,930 INFO L137 encePairwiseOnDemand]: 536/548 looper letters, 135 selfloop transitions, 50 changer transitions 42/236 dead transitions. [2023-08-30 10:20:53,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 236 transitions, 3167 flow [2023-08-30 10:20:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 10:20:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 10:20:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2139 transitions. [2023-08-30 10:20:53,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903284671532847 [2023-08-30 10:20:53,932 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2139 transitions. [2023-08-30 10:20:53,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2139 transitions. [2023-08-30 10:20:53,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:20:53,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2139 transitions. [2023-08-30 10:20:53,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 213.9) internal successors, (2139), 10 states have internal predecessors, (2139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:53,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:53,939 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:53,939 INFO L175 Difference]: Start difference. First operand has 172 places, 170 transitions, 2196 flow. Second operand 10 states and 2139 transitions. [2023-08-30 10:20:53,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 236 transitions, 3167 flow [2023-08-30 10:20:54,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 236 transitions, 3110 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-30 10:20:54,004 INFO L231 Difference]: Finished difference. Result has 176 places, 157 transitions, 2117 flow [2023-08-30 10:20:54,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2117, PETRI_PLACES=176, PETRI_TRANSITIONS=157} [2023-08-30 10:20:54,004 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 93 predicate places. [2023-08-30 10:20:54,004 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 157 transitions, 2117 flow [2023-08-30 10:20:54,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 204.94736842105263) internal successors, (3894), 19 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:54,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:20:54,005 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:20:54,011 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:20:54,205 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,SelfDestructingSolverStorable35 [2023-08-30 10:20:54,206 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:20:54,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:20:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1133869353, now seen corresponding path program 1 times [2023-08-30 10:20:54,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:20:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677139498] [2023-08-30 10:20:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:20:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:54,418 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:20:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:20:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677139498] [2023-08-30 10:20:54,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677139498] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:20:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143547299] [2023-08-30 10:20:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:20:54,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:20:54,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:20:54,420 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:20:54,421 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:20:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:20:54,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 10:20:54,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:20:54,569 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:20:54,646 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:54,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:20:54,663 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:20:54,684 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:20:54,747 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:20:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:20:54,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 16 treesize of output 18 [2023-08-30 10:20:54,833 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:20:54,833 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:20:54,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:20:54,903 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:20:54,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:20:54,982 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1560 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (or (< 0 (+ 2147483650 (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_1560)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1558) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)))) is different from false [2023-08-30 10:20:54,997 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1560 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1557))) (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_1560))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1558) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)))) is different from false [2023-08-30 10:20:55,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:20:55,020 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:20:55,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:20:55,028 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:20:55,032 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:20:57,274 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:20:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143547299] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:20:57,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:20:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 10:20:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630680517] [2023-08-30 10:20:57,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:20:57,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 10:20:57,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:20:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 10:20:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=354, Unknown=3, NotChecked=78, Total=506 [2023-08-30 10:20:57,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 548 [2023-08-30 10:20:57,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 157 transitions, 2117 flow. Second operand has 23 states, 23 states have (on average 180.34782608695653) internal successors, (4148), 23 states have internal predecessors, (4148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:20:57,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:20:57,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 548 [2023-08-30 10:20:57,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:01,573 INFO L130 PetriNetUnfolder]: 1568/3466 cut-off events. [2023-08-30 10:21:01,573 INFO L131 PetriNetUnfolder]: For 33444/33444 co-relation queries the response was YES. [2023-08-30 10:21:01,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20084 conditions, 3466 events. 1568/3466 cut-off events. For 33444/33444 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25891 event pairs, 174 based on Foata normal form. 49/3515 useless extension candidates. Maximal degree in co-relation 20032. Up to 1307 conditions per place. [2023-08-30 10:21:01,594 INFO L137 encePairwiseOnDemand]: 527/548 looper letters, 259 selfloop transitions, 177 changer transitions 0/442 dead transitions. [2023-08-30 10:21:01,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 442 transitions, 6032 flow [2023-08-30 10:21:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 10:21:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 10:21:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6345 transitions. [2023-08-30 10:21:01,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3405431515671962 [2023-08-30 10:21:01,599 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 6345 transitions. [2023-08-30 10:21:01,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 6345 transitions. [2023-08-30 10:21:01,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:01,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 6345 transitions. [2023-08-30 10:21:01,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 186.61764705882354) internal successors, (6345), 34 states have internal predecessors, (6345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:01,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 548.0) internal successors, (19180), 35 states have internal predecessors, (19180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:01,618 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 548.0) internal successors, (19180), 35 states have internal predecessors, (19180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:01,618 INFO L175 Difference]: Start difference. First operand has 176 places, 157 transitions, 2117 flow. Second operand 34 states and 6345 transitions. [2023-08-30 10:21:01,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 442 transitions, 6032 flow [2023-08-30 10:21:01,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 442 transitions, 5640 flow, removed 119 selfloop flow, removed 9 redundant places. [2023-08-30 10:21:01,697 INFO L231 Difference]: Finished difference. Result has 209 places, 273 transitions, 4185 flow [2023-08-30 10:21:01,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4185, PETRI_PLACES=209, PETRI_TRANSITIONS=273} [2023-08-30 10:21:01,697 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 126 predicate places. [2023-08-30 10:21:01,697 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 273 transitions, 4185 flow [2023-08-30 10:21:01,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 180.34782608695653) internal successors, (4148), 23 states have internal predecessors, (4148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:01,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:01,698 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:21:01,704 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:21:01,898 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,SelfDestructingSolverStorable36 [2023-08-30 10:21:01,899 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:01,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1511318849, now seen corresponding path program 1 times [2023-08-30 10:21:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:01,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213576930] [2023-08-30 10:21:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:02,203 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:21:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213576930] [2023-08-30 10:21:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213576930] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122776091] [2023-08-30 10:21:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:02,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:02,209 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:21:02,211 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:21:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:02,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:21:02,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:02,365 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:21:02,452 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:02,452 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:21:02,472 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:21:02,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 13 treesize of output 9 [2023-08-30 10:21:02,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:02,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 16 treesize of output 18 [2023-08-30 10:21:02,598 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:21:02,641 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:21:02,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:02,675 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:21:02,709 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:02,709 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:21:02,751 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:21:02,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:02,860 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1646 Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1644))) (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_1646))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 2147483647) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1647) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)))))) is different from false [2023-08-30 10:21:02,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:02,894 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:21:02,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:02,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 39 treesize of output 35 [2023-08-30 10:21:02,907 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:21:05,148 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:21:05,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122776091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:05,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 10:21:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873732962] [2023-08-30 10:21:05,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:05,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 10:21:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:05,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 10:21:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=357, Unknown=7, NotChecked=40, Total=506 [2023-08-30 10:21:05,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 548 [2023-08-30 10:21:05,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 273 transitions, 4185 flow. Second operand has 23 states, 23 states have (on average 180.34782608695653) internal successors, (4148), 23 states have internal predecessors, (4148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:05,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:05,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 548 [2023-08-30 10:21:05,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:07,390 INFO L130 PetriNetUnfolder]: 1612/3558 cut-off events. [2023-08-30 10:21:07,390 INFO L131 PetriNetUnfolder]: For 37657/37673 co-relation queries the response was YES. [2023-08-30 10:21:07,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21917 conditions, 3558 events. 1612/3558 cut-off events. For 37657/37673 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 26680 event pairs, 249 based on Foata normal form. 27/3585 useless extension candidates. Maximal degree in co-relation 21850. Up to 1990 conditions per place. [2023-08-30 10:21:07,416 INFO L137 encePairwiseOnDemand]: 534/548 looper letters, 270 selfloop transitions, 100 changer transitions 0/376 dead transitions. [2023-08-30 10:21:07,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 376 transitions, 5872 flow [2023-08-30 10:21:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 10:21:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 10:21:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3906 transitions. [2023-08-30 10:21:07,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33941605839416056 [2023-08-30 10:21:07,419 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3906 transitions. [2023-08-30 10:21:07,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3906 transitions. [2023-08-30 10:21:07,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:07,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3906 transitions. [2023-08-30 10:21:07,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 186.0) internal successors, (3906), 21 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:07,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 548.0) internal successors, (12056), 22 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:07,430 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 548.0) internal successors, (12056), 22 states have internal predecessors, (12056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:07,431 INFO L175 Difference]: Start difference. First operand has 209 places, 273 transitions, 4185 flow. Second operand 21 states and 3906 transitions. [2023-08-30 10:21:07,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 376 transitions, 5872 flow [2023-08-30 10:21:07,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 376 transitions, 5548 flow, removed 126 selfloop flow, removed 6 redundant places. [2023-08-30 10:21:07,540 INFO L231 Difference]: Finished difference. Result has 230 places, 285 transitions, 4342 flow [2023-08-30 10:21:07,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=3814, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4342, PETRI_PLACES=230, PETRI_TRANSITIONS=285} [2023-08-30 10:21:07,541 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 147 predicate places. [2023-08-30 10:21:07,541 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 285 transitions, 4342 flow [2023-08-30 10:21:07,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 180.34782608695653) internal successors, (4148), 23 states have internal predecessors, (4148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:07,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:07,542 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:21:07,548 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:21:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:07,742 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:07,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2006173279, now seen corresponding path program 1 times [2023-08-30 10:21:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274220982] [2023-08-30 10:21:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:08,020 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:21:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274220982] [2023-08-30 10:21:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274220982] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144535190] [2023-08-30 10:21:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:08,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:08,025 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:21:08,052 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:21:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:08,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 10:21:08,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:08,195 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:21:08,253 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:08,254 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:21:08,266 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:21:08,280 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:21:08,329 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:21:08,359 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:08,360 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:21:08,400 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:21:08,431 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:21:08,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:08,534 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:21:08,538 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:21:08,544 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1730 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1732 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1730) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1732) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 2147483647) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))) is different from false [2023-08-30 10:21:08,680 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:21:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144535190] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:08,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 10:21:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936348902] [2023-08-30 10:21:08,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:08,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:21:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:21:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=269, Unknown=3, NotChecked=34, Total=380 [2023-08-30 10:21:08,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 548 [2023-08-30 10:21:08,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 285 transitions, 4342 flow. Second operand has 20 states, 20 states have (on average 185.6) internal successors, (3712), 20 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:08,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:08,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 548 [2023-08-30 10:21:08,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:09,895 INFO L130 PetriNetUnfolder]: 1659/3665 cut-off events. [2023-08-30 10:21:09,895 INFO L131 PetriNetUnfolder]: For 38040/38062 co-relation queries the response was YES. [2023-08-30 10:21:09,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22766 conditions, 3665 events. 1659/3665 cut-off events. For 38040/38062 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 27775 event pairs, 359 based on Foata normal form. 12/3677 useless extension candidates. Maximal degree in co-relation 22693. Up to 2690 conditions per place. [2023-08-30 10:21:09,923 INFO L137 encePairwiseOnDemand]: 534/548 looper letters, 284 selfloop transitions, 56 changer transitions 0/346 dead transitions. [2023-08-30 10:21:09,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 346 transitions, 5666 flow [2023-08-30 10:21:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 10:21:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 10:21:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2483 transitions. [2023-08-30 10:21:09,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34854014598540145 [2023-08-30 10:21:09,926 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2483 transitions. [2023-08-30 10:21:09,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2483 transitions. [2023-08-30 10:21:09,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:09,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2483 transitions. [2023-08-30 10:21:09,928 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:21:09,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 548.0) internal successors, (7672), 14 states have internal predecessors, (7672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:09,932 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 548.0) internal successors, (7672), 14 states have internal predecessors, (7672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:09,932 INFO L175 Difference]: Start difference. First operand has 230 places, 285 transitions, 4342 flow. Second operand 13 states and 2483 transitions. [2023-08-30 10:21:09,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 346 transitions, 5666 flow [2023-08-30 10:21:10,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 346 transitions, 5496 flow, removed 36 selfloop flow, removed 12 redundant places. [2023-08-30 10:21:10,071 INFO L231 Difference]: Finished difference. Result has 236 places, 300 transitions, 4647 flow [2023-08-30 10:21:10,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=4156, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4647, PETRI_PLACES=236, PETRI_TRANSITIONS=300} [2023-08-30 10:21:10,071 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 153 predicate places. [2023-08-30 10:21:10,071 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 300 transitions, 4647 flow [2023-08-30 10:21:10,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 185.6) internal successors, (3712), 20 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:10,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:10,072 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:21:10,080 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:21:10,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-30 10:21:10,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:10,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -418410765, now seen corresponding path program 2 times [2023-08-30 10:21:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272684661] [2023-08-30 10:21:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:10,547 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:21:10,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272684661] [2023-08-30 10:21:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272684661] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:10,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550138027] [2023-08-30 10:21:10,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:21:10,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:10,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:10,549 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:21:10,582 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:21:10,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:21:10,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:21:10,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 10:21:10,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:10,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 7 treesize of output 6 [2023-08-30 10:21:10,847 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:10,848 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:21:10,868 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:21:10,891 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:21:10,914 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:21:10,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:10,961 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:21:10,994 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:10,994 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:21:11,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 18 treesize of output 13 [2023-08-30 10:21:11,061 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:21:11,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:11,127 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1817 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1816 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1816) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)) (< (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_1817)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 2147483647))) is different from false [2023-08-30 10:21:11,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:11,148 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:21:11,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:11,156 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:21:11,160 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:21:13,549 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:21:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550138027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:13,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:13,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 10:21:13,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758150093] [2023-08-30 10:21:13,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:13,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 10:21:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 10:21:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=385, Unknown=2, NotChecked=40, Total=506 [2023-08-30 10:21:13,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 548 [2023-08-30 10:21:13,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 300 transitions, 4647 flow. Second operand has 23 states, 23 states have (on average 184.34782608695653) internal successors, (4240), 23 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:13,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:13,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 548 [2023-08-30 10:21:13,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:15,769 INFO L130 PetriNetUnfolder]: 1748/3840 cut-off events. [2023-08-30 10:21:15,769 INFO L131 PetriNetUnfolder]: For 43013/43019 co-relation queries the response was YES. [2023-08-30 10:21:15,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24272 conditions, 3840 events. 1748/3840 cut-off events. For 43013/43019 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 29244 event pairs, 350 based on Foata normal form. 24/3864 useless extension candidates. Maximal degree in co-relation 24196. Up to 2479 conditions per place. [2023-08-30 10:21:15,802 INFO L137 encePairwiseOnDemand]: 534/548 looper letters, 301 selfloop transitions, 99 changer transitions 0/406 dead transitions. [2023-08-30 10:21:15,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 406 transitions, 6576 flow [2023-08-30 10:21:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 10:21:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 10:21:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4910 transitions. [2023-08-30 10:21:15,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34460976979225155 [2023-08-30 10:21:15,807 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4910 transitions. [2023-08-30 10:21:15,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4910 transitions. [2023-08-30 10:21:15,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:15,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4910 transitions. [2023-08-30 10:21:15,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 188.84615384615384) internal successors, (4910), 26 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:15,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 548.0) internal successors, (14796), 27 states have internal predecessors, (14796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:15,821 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 548.0) internal successors, (14796), 27 states have internal predecessors, (14796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:15,821 INFO L175 Difference]: Start difference. First operand has 236 places, 300 transitions, 4647 flow. Second operand 26 states and 4910 transitions. [2023-08-30 10:21:15,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 406 transitions, 6576 flow [2023-08-30 10:21:15,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 406 transitions, 6369 flow, removed 78 selfloop flow, removed 5 redundant places. [2023-08-30 10:21:15,992 INFO L231 Difference]: Finished difference. Result has 262 places, 320 transitions, 5120 flow [2023-08-30 10:21:15,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=4428, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5120, PETRI_PLACES=262, PETRI_TRANSITIONS=320} [2023-08-30 10:21:15,992 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 179 predicate places. [2023-08-30 10:21:15,992 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 320 transitions, 5120 flow [2023-08-30 10:21:15,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 184.34782608695653) internal successors, (4240), 23 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:15,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:15,993 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:21:15,999 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:21:16,196 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,SelfDestructingSolverStorable39 [2023-08-30 10:21:16,196 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:16,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1639240669, now seen corresponding path program 1 times [2023-08-30 10:21:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:16,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543981932] [2023-08-30 10:21:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:16,418 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:21:16,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:16,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543981932] [2023-08-30 10:21:16,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543981932] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:16,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992915984] [2023-08-30 10:21:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:16,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:16,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:16,421 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:21:16,426 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:21:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:16,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:21:16,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:16,574 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:21:16,663 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:16,664 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:21:16,682 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:21:16,712 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:21:16,731 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:21:16,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:16,773 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:21:16,794 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:21:16,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:16,818 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:21:16,843 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:16,843 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:21:16,872 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:21:16,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:16,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:16,997 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:21:17,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:17,006 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:21:17,011 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:21:19,453 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:21:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992915984] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:19,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-30 10:21:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973883641] [2023-08-30 10:21:19,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:19,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 10:21:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 10:21:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=357, Unknown=2, NotChecked=0, Total=462 [2023-08-30 10:21:22,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 10:21:23,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 548 [2023-08-30 10:21:23,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 320 transitions, 5120 flow. Second operand has 22 states, 22 states have (on average 186.45454545454547) internal successors, (4102), 22 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:23,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:23,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 548 [2023-08-30 10:21:23,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:25,279 INFO L130 PetriNetUnfolder]: 1791/3940 cut-off events. [2023-08-30 10:21:25,280 INFO L131 PetriNetUnfolder]: For 50939/50945 co-relation queries the response was YES. [2023-08-30 10:21:25,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25561 conditions, 3940 events. 1791/3940 cut-off events. For 50939/50945 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 30261 event pairs, 267 based on Foata normal form. 25/3965 useless extension candidates. Maximal degree in co-relation 25479. Up to 1750 conditions per place. [2023-08-30 10:21:25,317 INFO L137 encePairwiseOnDemand]: 533/548 looper letters, 293 selfloop transitions, 148 changer transitions 13/460 dead transitions. [2023-08-30 10:21:25,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 460 transitions, 7946 flow [2023-08-30 10:21:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 10:21:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 10:21:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3851 transitions. [2023-08-30 10:21:25,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3513686131386861 [2023-08-30 10:21:25,322 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3851 transitions. [2023-08-30 10:21:25,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3851 transitions. [2023-08-30 10:21:25,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:25,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3851 transitions. [2023-08-30 10:21:25,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 192.55) internal successors, (3851), 20 states have internal predecessors, (3851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:25,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 548.0) internal successors, (11508), 21 states have internal predecessors, (11508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:25,332 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 548.0) internal successors, (11508), 21 states have internal predecessors, (11508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:25,332 INFO L175 Difference]: Start difference. First operand has 262 places, 320 transitions, 5120 flow. Second operand 20 states and 3851 transitions. [2023-08-30 10:21:25,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 460 transitions, 7946 flow [2023-08-30 10:21:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 460 transitions, 7555 flow, removed 135 selfloop flow, removed 15 redundant places. [2023-08-30 10:21:25,525 INFO L231 Difference]: Finished difference. Result has 271 places, 360 transitions, 5999 flow [2023-08-30 10:21:25,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=4777, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5999, PETRI_PLACES=271, PETRI_TRANSITIONS=360} [2023-08-30 10:21:25,526 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 188 predicate places. [2023-08-30 10:21:25,526 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 360 transitions, 5999 flow [2023-08-30 10:21:25,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 186.45454545454547) internal successors, (4102), 22 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:25,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:25,527 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:21:25,532 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:21:25,727 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,SelfDestructingSolverStorable40 [2023-08-30 10:21:25,728 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:25,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash 733989494, now seen corresponding path program 2 times [2023-08-30 10:21:25,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:25,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506325556] [2023-08-30 10:21:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:26,055 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:21:26,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506325556] [2023-08-30 10:21:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506325556] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212646118] [2023-08-30 10:21:26,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:21:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:26,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:26,061 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:21:26,064 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:21:26,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:21:26,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:21:26,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:21:26,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:26,254 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:21:26,357 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:26,358 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:21:26,383 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:21:26,403 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:21:26,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:26,482 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:21:26,512 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:21:26,559 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:26,559 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:21:26,600 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:21:26,649 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:21:26,669 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:21:26,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:26,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:26,882 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:21:26,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:26,889 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:21:26,894 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:21:29,797 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:21:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212646118] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:29,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2023-08-30 10:21:29,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892070125] [2023-08-30 10:21:29,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:29,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 10:21:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:29,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 10:21:29,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=447, Unknown=19, NotChecked=0, Total=552 [2023-08-30 10:21:29,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 548 [2023-08-30 10:21:29,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 360 transitions, 5999 flow. Second operand has 24 states, 24 states have (on average 180.45833333333334) internal successors, (4331), 24 states have internal predecessors, (4331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:29,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:29,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 548 [2023-08-30 10:21:29,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:30,406 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) (and (forall ((v_ArrVal_1996 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1996) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_146| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_146|) 0)))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_146| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_146|) 0)) (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1996 (Array Int Int)) (v_ArrVal_1994 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (< 0 (+ (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_146| v_ArrVal_1989))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_89| v_ArrVal_1994))) |v_ULTIMATE.start_main_~#t_ids~0#1.base_146| v_ArrVal_1996) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 2147483650)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_89| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))))) (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1996 (Array Int Int)) (v_ArrVal_1994 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_89| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) (< 0 (+ (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1989))) (store .cse2 |c_~#a~0.base| (store (select .cse2 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_89| v_ArrVal_1994))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1996) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) 2147483650)))) .cse0 (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1996 (Array Int Int)) (v_ArrVal_1994 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (< 0 (+ 2147483650 (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_89| v_ArrVal_1994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1996) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_89| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))))) is different from false [2023-08-30 10:21:33,200 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1996 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1996) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_1996 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1992 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1992) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_91|)) 0)) (< 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_1994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1996) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))))) (forall ((v_ArrVal_1996 (Array Int Int)) (v_ArrVal_1994 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_91|)) 0)) (< 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_1994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1996) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))))))) is different from false [2023-08-30 10:21:33,935 INFO L130 PetriNetUnfolder]: 2164/5096 cut-off events. [2023-08-30 10:21:33,935 INFO L131 PetriNetUnfolder]: For 72063/72091 co-relation queries the response was YES. [2023-08-30 10:21:33,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33596 conditions, 5096 events. 2164/5096 cut-off events. For 72063/72091 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 44043 event pairs, 412 based on Foata normal form. 45/5141 useless extension candidates. Maximal degree in co-relation 33509. Up to 1914 conditions per place. [2023-08-30 10:21:33,980 INFO L137 encePairwiseOnDemand]: 529/548 looper letters, 462 selfloop transitions, 183 changer transitions 3/654 dead transitions. [2023-08-30 10:21:33,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 654 transitions, 11297 flow [2023-08-30 10:21:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-30 10:21:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-30 10:21:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5778 transitions. [2023-08-30 10:21:33,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34012243936896636 [2023-08-30 10:21:33,985 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5778 transitions. [2023-08-30 10:21:33,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5778 transitions. [2023-08-30 10:21:33,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:33,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5778 transitions. [2023-08-30 10:21:33,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 186.38709677419354) internal successors, (5778), 31 states have internal predecessors, (5778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:33,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 548.0) internal successors, (17536), 32 states have internal predecessors, (17536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:33,996 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 548.0) internal successors, (17536), 32 states have internal predecessors, (17536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:33,996 INFO L175 Difference]: Start difference. First operand has 271 places, 360 transitions, 5999 flow. Second operand 31 states and 5778 transitions. [2023-08-30 10:21:33,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 654 transitions, 11297 flow [2023-08-30 10:21:34,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 654 transitions, 11115 flow, removed 55 selfloop flow, removed 8 redundant places. [2023-08-30 10:21:34,318 INFO L231 Difference]: Finished difference. Result has 307 places, 454 transitions, 8286 flow [2023-08-30 10:21:34,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=5826, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8286, PETRI_PLACES=307, PETRI_TRANSITIONS=454} [2023-08-30 10:21:34,319 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 224 predicate places. [2023-08-30 10:21:34,319 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 454 transitions, 8286 flow [2023-08-30 10:21:34,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 180.45833333333334) internal successors, (4331), 24 states have internal predecessors, (4331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:34,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:34,320 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:21:34,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-08-30 10:21:34,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:34,525 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:34,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1087744182, now seen corresponding path program 2 times [2023-08-30 10:21:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753217580] [2023-08-30 10:21:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:34,758 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:21:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753217580] [2023-08-30 10:21:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753217580] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541478561] [2023-08-30 10:21:34,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:21:34,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:34,759 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:21:34,761 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:21:34,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:21:34,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:21:34,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 10:21:34,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:34,911 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:21:34,964 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:34,964 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:21:34,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 13 treesize of output 15 [2023-08-30 10:21:34,993 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:21:35,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:21:35,083 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:35,083 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:21:35,134 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:21:35,177 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:21:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 10:21:35,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:35,206 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2086) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483650))) is different from false [2023-08-30 10:21:35,312 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:21:35,316 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:21:35,321 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2085 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int) (v_ArrVal_2086 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_91| 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_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_2085)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2086) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_91|) 2147483650)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_91| |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) is different from false [2023-08-30 10:21:35,334 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2085 Int) (v_ArrVal_2080 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int) (v_ArrVal_2086 (Array Int 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_93|) (< 0 (+ (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2080))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_2085))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2086) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_91|) 2147483650)))) is different from false [2023-08-30 10:21:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 4 not checked. [2023-08-30 10:21:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541478561] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:35,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 18 [2023-08-30 10:21:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051602925] [2023-08-30 10:21:35,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:35,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:21:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:21:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=213, Unknown=4, NotChecked=96, Total=380 [2023-08-30 10:21:35,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 548 [2023-08-30 10:21:35,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 454 transitions, 8286 flow. Second operand has 20 states, 20 states have (on average 187.75) internal successors, (3755), 20 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:35,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:35,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 548 [2023-08-30 10:21:35,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:37,751 INFO L130 PetriNetUnfolder]: 2161/5087 cut-off events. [2023-08-30 10:21:37,751 INFO L131 PetriNetUnfolder]: For 83593/83599 co-relation queries the response was YES. [2023-08-30 10:21:37,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36353 conditions, 5087 events. 2161/5087 cut-off events. For 83593/83599 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 44023 event pairs, 441 based on Foata normal form. 18/5105 useless extension candidates. Maximal degree in co-relation 36251. Up to 2457 conditions per place. [2023-08-30 10:21:37,805 INFO L137 encePairwiseOnDemand]: 534/548 looper letters, 405 selfloop transitions, 133 changer transitions 7/551 dead transitions. [2023-08-30 10:21:37,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 551 transitions, 10610 flow [2023-08-30 10:21:37,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 10:21:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 10:21:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3297 transitions. [2023-08-30 10:21:37,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3539072563331902 [2023-08-30 10:21:37,808 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3297 transitions. [2023-08-30 10:21:37,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3297 transitions. [2023-08-30 10:21:37,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:37,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3297 transitions. [2023-08-30 10:21:37,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 193.94117647058823) internal successors, (3297), 17 states have internal predecessors, (3297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:37,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 548.0) internal successors, (9864), 18 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:37,816 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 548.0) internal successors, (9864), 18 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:37,816 INFO L175 Difference]: Start difference. First operand has 307 places, 454 transitions, 8286 flow. Second operand 17 states and 3297 transitions. [2023-08-30 10:21:37,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 551 transitions, 10610 flow [2023-08-30 10:21:38,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 551 transitions, 10428 flow, removed 55 selfloop flow, removed 11 redundant places. [2023-08-30 10:21:38,265 INFO L231 Difference]: Finished difference. Result has 316 places, 457 transitions, 8577 flow [2023-08-30 10:21:38,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=8033, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8577, PETRI_PLACES=316, PETRI_TRANSITIONS=457} [2023-08-30 10:21:38,265 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 233 predicate places. [2023-08-30 10:21:38,266 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 457 transitions, 8577 flow [2023-08-30 10:21:38,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 187.75) internal successors, (3755), 20 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:38,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:38,266 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:21:38,271 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:21:38,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:38,467 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:38,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1281355660, now seen corresponding path program 2 times [2023-08-30 10:21:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147052569] [2023-08-30 10:21:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:38,787 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:21:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147052569] [2023-08-30 10:21:38,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147052569] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:38,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668584676] [2023-08-30 10:21:38,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:21:38,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:38,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:38,789 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:21:38,818 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:21:38,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:21:38,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:21:38,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-30 10:21:38,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:38,999 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:21:39,054 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:39,054 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:21:39,065 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:21:39,086 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:21:39,110 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:21:39,149 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:39,149 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:21:39,209 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:21:39,255 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:21:39,273 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:21:39,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:39,286 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2176 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2176) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:21:39,349 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:21:39,353 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:21:39,358 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2174 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_95| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int) (v_ArrVal_2176 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_93| |v_t_funThread2of2ForFork0_~p~0#1.offset_95|) (< (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_93| v_ArrVal_2174)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2176) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_95|) 2147483647))) is different from false [2023-08-30 10:21:39,378 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2174 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_95| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int) (v_ArrVal_2176 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_93| |v_t_funThread2of2ForFork0_~p~0#1.offset_95|) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2171))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2174))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2176) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_95|) 2147483647))) is different from false [2023-08-30 10:21:39,548 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:21:39,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668584676] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:39,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 18 [2023-08-30 10:21:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064923156] [2023-08-30 10:21:39,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:39,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 10:21:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:39,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 10:21:39,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=208, Unknown=5, NotChecked=96, Total=380 [2023-08-30 10:21:39,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 548 [2023-08-30 10:21:39,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 457 transitions, 8577 flow. Second operand has 20 states, 20 states have (on average 181.45) internal successors, (3629), 20 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:39,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:39,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 548 [2023-08-30 10:21:39,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:41,368 INFO L130 PetriNetUnfolder]: 2155/5081 cut-off events. [2023-08-30 10:21:41,368 INFO L131 PetriNetUnfolder]: For 89209/89247 co-relation queries the response was YES. [2023-08-30 10:21:41,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36976 conditions, 5081 events. 2155/5081 cut-off events. For 89209/89247 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 44040 event pairs, 550 based on Foata normal form. 14/5095 useless extension candidates. Maximal degree in co-relation 36871. Up to 3772 conditions per place. [2023-08-30 10:21:41,419 INFO L137 encePairwiseOnDemand]: 535/548 looper letters, 450 selfloop transitions, 61 changer transitions 0/517 dead transitions. [2023-08-30 10:21:41,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 517 transitions, 10155 flow [2023-08-30 10:21:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 10:21:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 10:21:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2625 transitions. [2023-08-30 10:21:41,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34215328467153283 [2023-08-30 10:21:41,422 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2625 transitions. [2023-08-30 10:21:41,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2625 transitions. [2023-08-30 10:21:41,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:41,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2625 transitions. [2023-08-30 10:21:41,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 187.5) internal successors, (2625), 14 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:41,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 548.0) internal successors, (8220), 15 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:41,430 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 548.0) internal successors, (8220), 15 states have internal predecessors, (8220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:41,430 INFO L175 Difference]: Start difference. First operand has 316 places, 457 transitions, 8577 flow. Second operand 14 states and 2625 transitions. [2023-08-30 10:21:41,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 517 transitions, 10155 flow [2023-08-30 10:21:41,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 517 transitions, 9949 flow, removed 25 selfloop flow, removed 11 redundant places. [2023-08-30 10:21:41,874 INFO L231 Difference]: Finished difference. Result has 319 places, 458 transitions, 8556 flow [2023-08-30 10:21:41,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=8339, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8556, PETRI_PLACES=319, PETRI_TRANSITIONS=458} [2023-08-30 10:21:41,874 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 236 predicate places. [2023-08-30 10:21:41,874 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 458 transitions, 8556 flow [2023-08-30 10:21:41,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 181.45) internal successors, (3629), 20 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:41,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:41,875 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:21:41,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-30 10:21:42,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:42,075 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:42,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash 613377828, now seen corresponding path program 3 times [2023-08-30 10:21:42,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:42,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307225314] [2023-08-30 10:21:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:42,350 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:21:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307225314] [2023-08-30 10:21:42,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307225314] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160141027] [2023-08-30 10:21:42,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 10:21:42,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:42,353 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:21:42,355 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:21:42,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 10:21:42,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:21:42,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-30 10:21:42,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:42,600 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:21:42,746 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-30 10:21:42,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-30 10:21:42,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:21:42,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:21:42,875 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:21:42,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:42,961 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:21:43,045 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:21:43,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:21:43,132 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:21:43,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:43,143 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2266) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:21:43,199 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:21:43,201 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:21:43,206 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2264 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_95| Int) (v_ArrVal_2266 (Array Int Int))) (or (< (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_97| v_ArrVal_2264)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2266) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_95|) 2147483647) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_95| |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))) is different from false [2023-08-30 10:21:43,227 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2264 Int) (v_ArrVal_2266 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_95| Int) (v_ArrVal_2261 (Array Int Int))) (or (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2261))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_97| v_ArrVal_2264))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2266) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_95|) 2147483647) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_95| |v_t_funThread2of2ForFork0_~p~0#1.offset_97|))) is different from false [2023-08-30 10:21:43,384 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:21:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160141027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:43,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-30 10:21:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140753014] [2023-08-30 10:21:43,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 10:21:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 10:21:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=275, Unknown=6, NotChecked=108, Total=462 [2023-08-30 10:21:43,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 548 [2023-08-30 10:21:43,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 458 transitions, 8556 flow. Second operand has 22 states, 22 states have (on average 184.54545454545453) internal successors, (4060), 22 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:43,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:43,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 548 [2023-08-30 10:21:43,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:46,129 INFO L130 PetriNetUnfolder]: 2366/5562 cut-off events. [2023-08-30 10:21:46,130 INFO L131 PetriNetUnfolder]: For 96957/96995 co-relation queries the response was YES. [2023-08-30 10:21:46,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40611 conditions, 5562 events. 2366/5562 cut-off events. For 96957/96995 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 48940 event pairs, 569 based on Foata normal form. 11/5573 useless extension candidates. Maximal degree in co-relation 40507. Up to 3786 conditions per place. [2023-08-30 10:21:46,184 INFO L137 encePairwiseOnDemand]: 530/548 looper letters, 481 selfloop transitions, 159 changer transitions 0/646 dead transitions. [2023-08-30 10:21:46,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 646 transitions, 12567 flow [2023-08-30 10:21:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-30 10:21:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-30 10:21:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5483 transitions. [2023-08-30 10:21:46,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3450163604329222 [2023-08-30 10:21:46,189 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5483 transitions. [2023-08-30 10:21:46,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5483 transitions. [2023-08-30 10:21:46,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:46,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5483 transitions. [2023-08-30 10:21:46,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 189.06896551724137) internal successors, (5483), 29 states have internal predecessors, (5483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:46,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 548.0) internal successors, (16440), 30 states have internal predecessors, (16440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:46,200 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 548.0) internal successors, (16440), 30 states have internal predecessors, (16440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:46,200 INFO L175 Difference]: Start difference. First operand has 319 places, 458 transitions, 8556 flow. Second operand 29 states and 5483 transitions. [2023-08-30 10:21:46,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 646 transitions, 12567 flow [2023-08-30 10:21:46,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 646 transitions, 12433 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-08-30 10:21:46,683 INFO L231 Difference]: Finished difference. Result has 345 places, 524 transitions, 10247 flow [2023-08-30 10:21:46,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=8410, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10247, PETRI_PLACES=345, PETRI_TRANSITIONS=524} [2023-08-30 10:21:46,684 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 262 predicate places. [2023-08-30 10:21:46,684 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 524 transitions, 10247 flow [2023-08-30 10:21:46,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 184.54545454545453) internal successors, (4060), 22 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:46,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:46,685 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:21:46,689 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:21:46,885 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,SelfDestructingSolverStorable44 [2023-08-30 10:21:46,885 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:46,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -352943184, now seen corresponding path program 1 times [2023-08-30 10:21:46,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:46,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708713511] [2023-08-30 10:21:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:47,134 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:21:47,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:47,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708713511] [2023-08-30 10:21:47,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708713511] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:47,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179685396] [2023-08-30 10:21:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:47,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:47,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:47,137 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:21:47,140 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:21:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:47,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-30 10:21:47,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:47,343 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:21:47,412 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:47,412 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:21:47,431 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:21:47,454 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:21:47,475 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:21:47,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:47,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:21:47,531 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:21:47,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:47,556 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:21:47,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:47,566 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:21:47,598 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:47,599 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:21:47,631 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:21:47,656 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:21:47,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:47,721 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2367 Int)) (or (< 0 (+ (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_2367)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_97|) 2147483650)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2366) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_97| 4)) 0)))) is different from false [2023-08-30 10:21:47,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:47,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-30 10:21:47,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:47,761 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:21:47,763 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:21:50,147 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:21:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179685396] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:21:50,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:21:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-30 10:21:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543889016] [2023-08-30 10:21:50,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:21:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 10:21:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:21:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 10:21:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2023-08-30 10:21:50,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 548 [2023-08-30 10:21:50,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 524 transitions, 10247 flow. Second operand has 25 states, 25 states have (on average 180.64) internal successors, (4516), 25 states have internal predecessors, (4516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:50,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:21:50,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 548 [2023-08-30 10:21:50,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:21:55,923 INFO L130 PetriNetUnfolder]: 2368/5632 cut-off events. [2023-08-30 10:21:55,924 INFO L131 PetriNetUnfolder]: For 119958/119964 co-relation queries the response was YES. [2023-08-30 10:21:55,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44871 conditions, 5632 events. 2368/5632 cut-off events. For 119958/119964 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50124 event pairs, 414 based on Foata normal form. 68/5700 useless extension candidates. Maximal degree in co-relation 44758. Up to 2219 conditions per place. [2023-08-30 10:21:55,984 INFO L137 encePairwiseOnDemand]: 527/548 looper letters, 414 selfloop transitions, 296 changer transitions 7/723 dead transitions. [2023-08-30 10:21:55,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 723 transitions, 14657 flow [2023-08-30 10:21:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-08-30 10:21:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-08-30 10:21:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 8641 transitions. [2023-08-30 10:21:55,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33549464202515916 [2023-08-30 10:21:55,992 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 8641 transitions. [2023-08-30 10:21:55,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 8641 transitions. [2023-08-30 10:21:55,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:21:55,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 8641 transitions. [2023-08-30 10:21:56,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 183.85106382978722) internal successors, (8641), 47 states have internal predecessors, (8641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:56,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 548.0) internal successors, (26304), 48 states have internal predecessors, (26304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:56,016 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 548.0) internal successors, (26304), 48 states have internal predecessors, (26304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:56,016 INFO L175 Difference]: Start difference. First operand has 345 places, 524 transitions, 10247 flow. Second operand 47 states and 8641 transitions. [2023-08-30 10:21:56,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 723 transitions, 14657 flow [2023-08-30 10:21:56,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 723 transitions, 14479 flow, removed 61 selfloop flow, removed 11 redundant places. [2023-08-30 10:21:56,591 INFO L231 Difference]: Finished difference. Result has 393 places, 583 transitions, 11999 flow [2023-08-30 10:21:56,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=9832, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=11999, PETRI_PLACES=393, PETRI_TRANSITIONS=583} [2023-08-30 10:21:56,592 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 310 predicate places. [2023-08-30 10:21:56,592 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 583 transitions, 11999 flow [2023-08-30 10:21:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 180.64) internal successors, (4516), 25 states have internal predecessors, (4516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:21:56,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:21:56,593 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:21:56,597 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:21:56,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:56,793 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:21:56,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:21:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1035698695, now seen corresponding path program 1 times [2023-08-30 10:21:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:21:56,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893689997] [2023-08-30 10:21:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:21:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:57,188 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:21:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:21:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893689997] [2023-08-30 10:21:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893689997] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:21:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519541123] [2023-08-30 10:21:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:21:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:21:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:21:57,189 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:21:57,190 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:21:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:21:57,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 10:21:57,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:21:57,368 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:21:57,445 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:57,445 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:21:57,465 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:21:57,482 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:21:57,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:21:57,571 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:21:57,606 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:21:57,637 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:21:57,637 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:21:57,690 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:21:57,753 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:21:57,794 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:21:57,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:21:58,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_101| Int) (v_ArrVal_2467 Int) (v_ArrVal_2464 (Array Int Int)) (v_ArrVal_2466 Int) (v_ArrVal_2463 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2464))) (let ((.cse2 (select .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (<= 0 (+ 2147483647 (select (select (let ((.cse0 (store .cse1 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2466)))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_101| v_ArrVal_2467))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2463) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_101|)) 0)) (< v_ArrVal_2466 (+ (select .cse2 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-30 10:21:58,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:58,290 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:21:58,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:21:58,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-30 10:21:58,304 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:22:00,785 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:22:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519541123] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:22:00,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:22:00,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-30 10:22:00,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893175764] [2023-08-30 10:22:00,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:22:00,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 10:22:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:22:00,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 10:22:00,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=604, Unknown=2, NotChecked=50, Total=756 [2023-08-30 10:22:00,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 548 [2023-08-30 10:22:00,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 583 transitions, 11999 flow. Second operand has 28 states, 28 states have (on average 178.25) internal successors, (4991), 28 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call 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:00,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:22:00,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 548 [2023-08-30 10:22:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:22:06,574 WARN L222 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:22:14,879 WARN L222 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 125 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:22:23,139 WARN L222 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 114 DAG size of output: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:22:29,309 WARN L539 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:22:35,479 WARN L539 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:22:41,705 WARN L539 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:22:48,222 WARN L539 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:22:54,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:22:56,976 WARN L539 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:22:59,027 WARN L539 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:23:07,300 WARN L539 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:23:09,494 WARN L539 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:23:18,311 WARN L222 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 127 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:23:27,527 WARN L539 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:23:29,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:23:31,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:23:33,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:23:39,235 WARN L539 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:23:40,360 INFO L130 PetriNetUnfolder]: 2627/6252 cut-off events. [2023-08-30 10:23:40,360 INFO L131 PetriNetUnfolder]: For 164451/164457 co-relation queries the response was YES. [2023-08-30 10:23:40,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54344 conditions, 6252 events. 2627/6252 cut-off events. For 164451/164457 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 56726 event pairs, 579 based on Foata normal form. 25/6277 useless extension candidates. Maximal degree in co-relation 54218. Up to 3854 conditions per place. [2023-08-30 10:23:40,431 INFO L137 encePairwiseOnDemand]: 529/548 looper letters, 535 selfloop transitions, 201 changer transitions 34/776 dead transitions. [2023-08-30 10:23:40,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 776 transitions, 16933 flow [2023-08-30 10:23:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-30 10:23:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-30 10:23:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6055 transitions. [2023-08-30 10:23:40,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33482636584826364 [2023-08-30 10:23:40,436 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6055 transitions. [2023-08-30 10:23:40,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6055 transitions. [2023-08-30 10:23:40,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:23:40,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6055 transitions. [2023-08-30 10:23:40,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 183.4848484848485) internal successors, (6055), 33 states have internal predecessors, (6055), 0 states have call successors, (0), 0 states have call 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:40,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 548.0) internal successors, (18632), 34 states have internal predecessors, (18632), 0 states have call successors, (0), 0 states have call 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:40,453 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 548.0) internal successors, (18632), 34 states have internal predecessors, (18632), 0 states have call successors, (0), 0 states have call 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:40,453 INFO L175 Difference]: Start difference. First operand has 393 places, 583 transitions, 11999 flow. Second operand 33 states and 6055 transitions. [2023-08-30 10:23:40,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 776 transitions, 16933 flow [2023-08-30 10:23:41,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 776 transitions, 16211 flow, removed 160 selfloop flow, removed 13 redundant places. [2023-08-30 10:23:41,244 INFO L231 Difference]: Finished difference. Result has 427 places, 617 transitions, 12978 flow [2023-08-30 10:23:41,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=11328, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=12978, PETRI_PLACES=427, PETRI_TRANSITIONS=617} [2023-08-30 10:23:41,245 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 344 predicate places. [2023-08-30 10:23:41,245 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 617 transitions, 12978 flow [2023-08-30 10:23:41,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 178.25) internal successors, (4991), 28 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call 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,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:23:41,246 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:23:41,252 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:23:41,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:41,452 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:23:41,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:23:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash -73536751, now seen corresponding path program 1 times [2023-08-30 10:23:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:23:41,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129281310] [2023-08-30 10:23:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:23:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:41,897 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:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:23:41,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129281310] [2023-08-30 10:23:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129281310] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:23:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095578376] [2023-08-30 10:23:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:23:41,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:23:41,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:23:41,901 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:23:41,903 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:23:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:23:42,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 10:23:42,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:23:42,131 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,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:42,275 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,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 13 treesize of output 15 [2023-08-30 10:23:42,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 13 treesize of output 9 [2023-08-30 10:23:42,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:23:42,425 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,492 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,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:23:42,544 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,603 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,707 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:23:42,803 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:42,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:23:43,084 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2564 (Array Int Int)) (v_ArrVal_2566 Int) (v_ArrVal_2563 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_103| Int)) (or (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2564))) (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_2566))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_103|) 2147483649)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2563) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_103|)) 0)))) is different from false [2023-08-30 10:23:43,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:43,110 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:43,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:23:43,121 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:43,126 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:47,499 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:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095578376] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:23:47,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:23:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-08-30 10:23:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956889747] [2023-08-30 10:23:47,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:23:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 10:23:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:23:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 10:23:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=650, Unknown=2, NotChecked=52, Total=812 [2023-08-30 10:23:47,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 548 [2023-08-30 10:23:47,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 617 transitions, 12978 flow. Second operand has 29 states, 29 states have (on average 178.27586206896552) internal successors, (5170), 29 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call 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,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:23:47,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 548 [2023-08-30 10:23:47,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:23:59,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:24:09,252 INFO L130 PetriNetUnfolder]: 2598/6264 cut-off events. [2023-08-30 10:24:09,252 INFO L131 PetriNetUnfolder]: For 173218/173230 co-relation queries the response was YES. [2023-08-30 10:24:09,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54624 conditions, 6264 events. 2598/6264 cut-off events. For 173218/173230 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 57406 event pairs, 324 based on Foata normal form. 80/6344 useless extension candidates. Maximal degree in co-relation 54484. Up to 2484 conditions per place. [2023-08-30 10:24:09,330 INFO L137 encePairwiseOnDemand]: 527/548 looper letters, 499 selfloop transitions, 382 changer transitions 12/899 dead transitions. [2023-08-30 10:24:09,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 899 transitions, 19288 flow [2023-08-30 10:24:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-30 10:24:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-30 10:24:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 10746 transitions. [2023-08-30 10:24:09,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33236422120499814 [2023-08-30 10:24:09,336 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 10746 transitions. [2023-08-30 10:24:09,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 10746 transitions. [2023-08-30 10:24:09,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:24:09,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 10746 transitions. [2023-08-30 10:24:09,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 182.135593220339) internal successors, (10746), 59 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states have call 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,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 548.0) internal successors, (32880), 60 states have internal predecessors, (32880), 0 states have call successors, (0), 0 states have call 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,370 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 548.0) internal successors, (32880), 60 states have internal predecessors, (32880), 0 states have call successors, (0), 0 states have call 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,370 INFO L175 Difference]: Start difference. First operand has 427 places, 617 transitions, 12978 flow. Second operand 59 states and 10746 transitions. [2023-08-30 10:24:09,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 899 transitions, 19288 flow [2023-08-30 10:24:10,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 899 transitions, 18681 flow, removed 116 selfloop flow, removed 16 redundant places. [2023-08-30 10:24:10,387 INFO L231 Difference]: Finished difference. Result has 481 places, 682 transitions, 14842 flow [2023-08-30 10:24:10,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=12164, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=14842, PETRI_PLACES=481, PETRI_TRANSITIONS=682} [2023-08-30 10:24:10,388 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 398 predicate places. [2023-08-30 10:24:10,388 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 682 transitions, 14842 flow [2023-08-30 10:24:10,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 178.27586206896552) internal successors, (5170), 29 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call 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:10,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:24:10,389 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:10,396 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:24:10,593 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,SelfDestructingSolverStorable47 [2023-08-30 10:24:10,593 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:24:10,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:24:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1405921287, now seen corresponding path program 2 times [2023-08-30 10:24:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:24:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355852490] [2023-08-30 10:24:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:24:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:24:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:24:11,070 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:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:24:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355852490] [2023-08-30 10:24:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355852490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:24:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837410402] [2023-08-30 10:24:11,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 10:24:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:24:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:24:11,071 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:24:11,073 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:24:11,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 10:24:11,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:24:11,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 10:24:11,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:24:11,268 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:11,426 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:11,426 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:11,468 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:11,520 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:11,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 10:24:11,651 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:11,788 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:11,920 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:24:11,921 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:11,983 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:24:12,114 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:24:12,182 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:12,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:24:14,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:14,652 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:14,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 10:24:14,667 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:14,674 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:17,291 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:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837410402] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:24:17,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:24:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-30 10:24:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441503752] [2023-08-30 10:24:17,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:24:17,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 10:24:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:24:17,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 10:24:17,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=653, Unknown=6, NotChecked=0, Total=756 [2023-08-30 10:24:20,883 WARN L539 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:23,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:24:27,267 WARN L539 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:29,342 WARN L539 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:31,939 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:24:34,727 WARN L539 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:37,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:24:39,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 [1] [2023-08-30 10:24:43,402 WARN L539 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:45,539 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:24:46,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:24:48,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:24:50,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 [1] [2023-08-30 10:24:54,226 WARN L539 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:55,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 548 [2023-08-30 10:24:55,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 682 transitions, 14842 flow. Second operand has 28 states, 28 states have (on average 178.25) internal successors, (4991), 28 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call 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:55,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:24:55,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 548 [2023-08-30 10:24:55,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:25:07,002 WARN L222 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 123 DAG size of output: 112 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:25:13,449 WARN L222 SmtUtils]: Spent 6.20s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:25:15,930 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:25:18,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s 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:22,245 WARN L539 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:29,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s 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:31,707 WARN L539 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:44,468 WARN L222 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 141 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:26:01,737 WARN L222 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 134 DAG size of output: 113 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:26:21,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:27,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:33,261 WARN L539 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:35,304 WARN L539 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,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:40,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:42,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:26:45,813 WARN L539 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:52,100 WARN L539 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:54,202 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:58,425 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:00,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 [0, 1] [2023-08-30 10:27:02,450 WARN L539 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:04,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:06,507 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:08,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:27:21,828 WARN L539 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:24,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:26,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:28,664 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:30,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:27:32,771 WARN L539 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:34,900 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:37,135 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:27:39,282 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:41,379 WARN L539 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:43,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:27:46,476 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:48,582 WARN L539 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:51,066 WARN L539 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:57,864 WARN L222 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 133 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:28:00,770 WARN L539 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:07,662 WARN L539 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:09,852 WARN L539 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:22,064 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:36,641 WARN L222 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 104 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 10:28:45,251 WARN L539 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:49,323 INFO L130 PetriNetUnfolder]: 2609/6326 cut-off events. [2023-08-30 10:28:49,324 INFO L131 PetriNetUnfolder]: For 188877/188877 co-relation queries the response was YES. [2023-08-30 10:28:49,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57637 conditions, 6326 events. 2609/6326 cut-off events. For 188877/188877 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 58444 event pairs, 459 based on Foata normal form. 15/6341 useless extension candidates. Maximal degree in co-relation 57484. Up to 3365 conditions per place. [2023-08-30 10:28:49,405 INFO L137 encePairwiseOnDemand]: 531/548 looper letters, 537 selfloop transitions, 322 changer transitions 2/867 dead transitions. [2023-08-30 10:28:49,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 867 transitions, 19522 flow [2023-08-30 10:28:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-30 10:28:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-08-30 10:28:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8933 transitions. [2023-08-30 10:28:49,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33267540592879485 [2023-08-30 10:28:49,410 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 8933 transitions. [2023-08-30 10:28:49,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 8933 transitions. [2023-08-30 10:28:49,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:28:49,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8933 transitions. [2023-08-30 10:28:49,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 182.30612244897958) internal successors, (8933), 49 states have internal predecessors, (8933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:49,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 548.0) internal successors, (27400), 50 states have internal predecessors, (27400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:49,436 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 548.0) internal successors, (27400), 50 states have internal predecessors, (27400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:49,436 INFO L175 Difference]: Start difference. First operand has 481 places, 682 transitions, 14842 flow. Second operand 49 states and 8933 transitions. [2023-08-30 10:28:49,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 867 transitions, 19522 flow [2023-08-30 10:28:50,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 867 transitions, 18648 flow, removed 256 selfloop flow, removed 33 redundant places. [2023-08-30 10:28:50,642 INFO L231 Difference]: Finished difference. Result has 504 places, 706 transitions, 15524 flow [2023-08-30 10:28:50,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=13964, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=15524, PETRI_PLACES=504, PETRI_TRANSITIONS=706} [2023-08-30 10:28:50,643 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 421 predicate places. [2023-08-30 10:28:50,643 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 706 transitions, 15524 flow [2023-08-30 10:28:50,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 178.25) internal successors, (4991), 28 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:50,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:28:50,644 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:28:50,649 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:28:50,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-30 10:28:50,845 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:28:50,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:28:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash 710987694, now seen corresponding path program 1 times [2023-08-30 10:28:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:28:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359771524] [2023-08-30 10:28:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:28:50,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:28:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:28:51,392 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:28:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:28:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359771524] [2023-08-30 10:28:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359771524] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:28:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223804154] [2023-08-30 10:28:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:28:51,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:28:51,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:28:51,393 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:28:51,396 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:28:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:28:51,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 10:28:51,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:28:51,615 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:28:51,722 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:28:51,722 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:28:51,768 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:28:51,885 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:28:51,987 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:28:52,140 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:28:52,255 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:28:52,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:28:52,519 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2761 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2761) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-30 10:28:52,709 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:28:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223804154] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:28:52,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:28:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2023-08-30 10:28:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444213153] [2023-08-30 10:28:52,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:28:52,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-30 10:28:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:28:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-30 10:28:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=480, Unknown=1, NotChecked=46, Total=650 [2023-08-30 10:28:52,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 548 [2023-08-30 10:28:52,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 706 transitions, 15524 flow. Second operand has 26 states, 26 states have (on average 193.23076923076923) internal successors, (5024), 26 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:52,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:28:52,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 548 [2023-08-30 10:28:52,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:28:57,357 INFO L130 PetriNetUnfolder]: 2454/6131 cut-off events. [2023-08-30 10:28:57,357 INFO L131 PetriNetUnfolder]: For 188115/188266 co-relation queries the response was YES. [2023-08-30 10:28:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54555 conditions, 6131 events. 2454/6131 cut-off events. For 188115/188266 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 57586 event pairs, 423 based on Foata normal form. 88/6203 useless extension candidates. Maximal degree in co-relation 54400. Up to 3690 conditions per place. [2023-08-30 10:28:57,435 INFO L137 encePairwiseOnDemand]: 533/548 looper letters, 595 selfloop transitions, 171 changer transitions 0/788 dead transitions. [2023-08-30 10:28:57,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 788 transitions, 18425 flow [2023-08-30 10:28:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 10:28:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 10:28:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4336 transitions. [2023-08-30 10:28:57,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3596549435965494 [2023-08-30 10:28:57,438 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4336 transitions. [2023-08-30 10:28:57,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4336 transitions. [2023-08-30 10:28:57,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 10:28:57,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4336 transitions. [2023-08-30 10:28:57,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 197.0909090909091) internal successors, (4336), 22 states have internal predecessors, (4336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:57,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 548.0) internal successors, (12604), 23 states have internal predecessors, (12604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:57,446 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 548.0) internal successors, (12604), 23 states have internal predecessors, (12604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:57,446 INFO L175 Difference]: Start difference. First operand has 504 places, 706 transitions, 15524 flow. Second operand 22 states and 4336 transitions. [2023-08-30 10:28:57,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 788 transitions, 18425 flow [2023-08-30 10:28:58,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 788 transitions, 17831 flow, removed 59 selfloop flow, removed 30 redundant places. [2023-08-30 10:28:58,417 INFO L231 Difference]: Finished difference. Result has 497 places, 720 transitions, 15551 flow [2023-08-30 10:28:58,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=14853, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=15551, PETRI_PLACES=497, PETRI_TRANSITIONS=720} [2023-08-30 10:28:58,418 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 414 predicate places. [2023-08-30 10:28:58,418 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 720 transitions, 15551 flow [2023-08-30 10:28:58,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 193.23076923076923) internal successors, (5024), 26 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:28:58,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 10:28:58,419 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:28:58,426 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:28:58,625 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,SelfDestructingSolverStorable49 [2023-08-30 10:28:58,626 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-30 10:28:58,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 10:28:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1809187349, now seen corresponding path program 3 times [2023-08-30 10:28:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 10:28:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713406569] [2023-08-30 10:28:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 10:28:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 10:28:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 10:28:59,138 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:28:59,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 10:28:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713406569] [2023-08-30 10:28:59,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713406569] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 10:28:59,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727428097] [2023-08-30 10:28:59,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 10:28:59,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 10:28:59,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 10:28:59,140 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:28:59,141 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:28:59,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 10:28:59,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 10:28:59,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 10:28:59,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 10:28:59,328 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:28:59,422 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 10:28:59,422 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:28:59,458 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:28:59,567 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:28:59,697 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:28:59,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2023-08-30 10:28:59,965 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:28:59,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 10:29:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 10:29:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727428097] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 10:29:11,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 10:29:11,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-30 10:29:11,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423200902] [2023-08-30 10:29:11,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 10:29:11,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 10:29:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 10:29:11,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 10:29:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=612, Unknown=12, NotChecked=0, Total=756 [2023-08-30 10:29:13,394 WARN L539 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,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 [1] [2023-08-30 10:29:18,060 WARN L539 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,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:22,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:24,383 WARN L539 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:26,657 WARN L539 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:28,695 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:30,895 WARN L539 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:33,105 WARN L539 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:35,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:37,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:39,499 WARN L539 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:41,596 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:43,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:46,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:48,648 WARN L539 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:51,638 WARN L539 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:53,718 WARN L539 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:55,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:57,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:29:59,097 WARN L539 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:01,181 WARN L539 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:03,436 WARN L539 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:05,527 WARN L539 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:07,766 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:09,909 WARN L539 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:12,053 WARN L539 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:14,285 WARN L539 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:16,664 WARN L539 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:18,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:21,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:30:21,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 548 [2023-08-30 10:30:21,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 720 transitions, 15551 flow. Second operand has 28 states, 28 states have (on average 197.07142857142858) internal successors, (5518), 28 states have internal predecessors, (5518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 10:30:21,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 10:30:21,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 548 [2023-08-30 10:30:21,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 10:30:24,129 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:30:26,150 WARN L539 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:30:28,198 WARN L539 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:30:30,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:30:32,590 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:30:34,647 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:30:37,844 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:30:44,757 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 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_2858))) (let ((.cse2 (select .cse3 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (let ((.cse0 (store .cse3 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2860 (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_2861 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2858) |c_~#a~0.base|))) (let ((.cse5 (store .cse4 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860))) (or (< v_ArrVal_2860 (+ (select .cse4 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2861 (+ (select .cse5 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (store .cse5 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)))))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_155| Int)) (or (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse7 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_155| v_ArrVal_2858) |c_~#a~0.base|))) (let ((.cse6 (store .cse7 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860))) (or (< (+ v_ArrVal_2860 2147483648) 0) (< 0 (+ (select (store .cse6 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2860 (+ (select .cse7 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_2861 (+ (select .cse6 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_155|) 0))))) is different from false [2023-08-30 10:30:50,518 WARN L539 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:53,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:30:55,211 WARN L539 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:57,356 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:59,433 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:01,468 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:03,518 WARN L539 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:31:05,553 WARN L539 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:31:07,628 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:14,008 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:14,030 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 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_2858))) (let ((.cse2 (select .cse3 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (let ((.cse0 (store .cse3 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2860 (+ (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_2861 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2858) |c_~#a~0.base|))) (let ((.cse5 (store .cse4 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860))) (or (< v_ArrVal_2860 (+ (select .cse4 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2861 (+ (select .cse5 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (store .cse5 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648))))))) is different from false [2023-08-30 10:31:16,058 WARN L539 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:18,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:31:20,162 WARN L539 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:22,232 WARN L539 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:24,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:31:26,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s 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:28,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:31:30,962 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:31:33,003 WARN L539 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:31:35,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:31:37,033 WARN L539 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:31:39,047 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:31:41,884 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:31:43,995 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:31:46,314 WARN L539 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:48,454 WARN L539 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,465 WARN L539 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,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:31:54,600 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (< 0 (+ (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (or (< v_ArrVal_2860 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_2860 2147483648) 0) (< 0 (+ (select (select (store .cse1 |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2861 (+ (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int)) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse4 (select .cse3 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store .cse3 |c_~#a~0.base| (store .cse4 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2860 (+ |c_t_funThread1of2ForFork0_#t~post36#1| 1)) (< v_ArrVal_2861 (+ (select .cse4 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2858))) (let ((.cse7 (select .cse8 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (let ((.cse5 (store .cse8 |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse7 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse6 (select .cse5 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store .cse5 |c_~#a~0.base| (store .cse6 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2860 (+ (select .cse7 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_2861 (+ (select .cse6 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2858) |c_~#a~0.base|))) (let ((.cse10 (store .cse9 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860))) (or (< v_ArrVal_2860 (+ (select .cse9 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2861 (+ (select .cse10 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (store .cse10 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)))))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_155| Int)) (or (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse12 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_155| v_ArrVal_2858) |c_~#a~0.base|))) (let ((.cse11 (store .cse12 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860))) (or (< (+ v_ArrVal_2860 2147483648) 0) (< 0 (+ (select (store .cse11 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2860 (+ (select .cse12 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< v_ArrVal_2861 (+ (select .cse11 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_155|) 0)))))) is different from false [2023-08-30 10:31:58,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:00,320 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:02,359 WARN L539 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:05,004 WARN L539 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:07,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:16,499 WARN L539 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:18,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:18,745 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse2 (select .cse1 |c_~#a~0.base|))) (or (< v_ArrVal_2860 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_2860 2147483648) 0) (< 0 (+ (select (select (store .cse1 |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2861 (+ (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int)) (let ((.cse3 (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860)))) (let ((.cse4 (select .cse3 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store .cse3 |c_~#a~0.base| (store .cse4 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2860 (+ |c_t_funThread1of2ForFork0_#t~post36#1| 1)) (< v_ArrVal_2861 (+ (select .cse4 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) (forall ((v_ArrVal_2858 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2861 Int) (v_ArrVal_2860 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2858) |c_~#a~0.base|))) (let ((.cse6 (store .cse5 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2860))) (or (< v_ArrVal_2860 (+ (select .cse5 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< (+ v_ArrVal_2860 2147483648) 0) (< v_ArrVal_2861 (+ (select .cse6 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (store .cse6 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2861) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)))))))) is different from false [2023-08-30 10:32:20,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:22,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:25,003 WARN L539 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:27,011 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:29,058 WARN L539 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:31,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:32:33,100 WARN L539 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:35,113 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:37,193 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:32:39,227 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:32:41,250 WARN L539 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:32:43,299 WARN L539 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:32:45,347 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:32:47,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 10:32:49,427 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:32:51,469 WARN L539 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:32:53,510 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:32:57,927 WARN L539 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:59,934 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:33:01,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:33:03,558 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:33:05,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:33:08,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:33:10,607 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:33:12,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 10:33:14,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15