./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.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/pthread-ext/36_stack_cas_p0_vs_concur.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 e7fe0631e7f950e2868c8cb954edca4f6de3fdffbf6debba58771511fbac2e8b --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 08:34:02,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 08:34:02,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 08:34:02,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 08:34:02,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 08:34:02,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 08:34:02,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 08:34:02,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 08:34:02,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 08:34:02,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 08:34:02,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 08:34:02,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 08:34:02,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 08:34:02,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 08:34:02,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 08:34:02,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 08:34:02,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 08:34:02,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 08:34:02,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 08:34:02,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 08:34:02,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 08:34:02,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 08:34:02,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 08:34:02,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 08:34:02,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 08:34:02,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 08:34:02,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 08:34:02,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 08:34:02,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 08:34:02,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 08:34:02,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 08:34:02,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 08:34:02,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 08:34:02,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 08:34:02,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 08:34:02,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 08:34:02,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 08:34:02,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 08:34:02,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 08:34:02,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 08:34:02,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 08:34:02,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 08:34:02,343 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 08:34:02,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 08:34:02,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 08:34:02,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 08:34:02,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 08:34:02,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 08:34:02,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 08:34:02,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 08:34:02,346 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 08:34:02,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 08:34:02,347 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 08:34:02,348 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 08:34:02,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 08:34:02,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 08:34:02,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 08:34:02,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 08:34:02,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 08:34:02,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 08:34:02,349 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 08:34:02,349 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 08:34:02,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 08:34:02,349 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 08:34:02,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 08:34:02,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 08:34:02,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 08:34:02,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 08:34:02,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:34:02,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 08:34:02,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 08:34:02,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 08:34:02,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 08:34:02,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 08:34:02,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 08:34:02,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 08:34:02,352 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 08:34:02,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 08:34:02,352 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 08:34:02,352 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 -> e7fe0631e7f950e2868c8cb954edca4f6de3fdffbf6debba58771511fbac2e8b 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 08:34:02,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 08:34:02,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 08:34:02,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 08:34:02,651 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 08:34:02,652 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 08:34:02,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-08-30 08:34:03,744 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 08:34:03,984 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 08:34:03,985 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-08-30 08:34:03,996 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe545992/227283cdfb2f4e19b4843c43a09ce2ac/FLAG3b4531d80 [2023-08-30 08:34:04,009 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe545992/227283cdfb2f4e19b4843c43a09ce2ac [2023-08-30 08:34:04,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 08:34:04,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 08:34:04,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 08:34:04,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 08:34:04,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 08:34:04,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f838da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04, skipping insertion in model container [2023-08-30 08:34:04,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 08:34:04,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 08:34:04,400 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-08-30 08:34:04,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:34:04,414 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 08:34:04,463 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-08-30 08:34:04,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:34:04,561 INFO L208 MainTranslator]: Completed translation [2023-08-30 08:34:04,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04 WrapperNode [2023-08-30 08:34:04,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 08:34:04,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 08:34:04,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 08:34:04,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 08:34:04,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,619 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2023-08-30 08:34:04,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 08:34:04,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 08:34:04,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 08:34:04,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 08:34:04,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,655 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 08:34:04,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 08:34:04,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 08:34:04,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 08:34:04,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (1/1) ... [2023-08-30 08:34:04,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:34:04,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:04,714 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 08:34:04,733 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 08:34:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 08:34:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 08:34:04,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 08:34:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 08:34:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 08:34:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 08:34:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 08:34:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 08:34:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 08:34:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 08:34:04,748 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 08:34:04,910 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 08:34:04,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 08:34:05,146 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 08:34:05,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 08:34:05,223 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 08:34:05,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:34:05 BoogieIcfgContainer [2023-08-30 08:34:05,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 08:34:05,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 08:34:05,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 08:34:05,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 08:34:05,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:34:04" (1/3) ... [2023-08-30 08:34:05,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d45d07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:34:05, skipping insertion in model container [2023-08-30 08:34:05,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:34:04" (2/3) ... [2023-08-30 08:34:05,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d45d07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:34:05, skipping insertion in model container [2023-08-30 08:34:05,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:34:05" (3/3) ... [2023-08-30 08:34:05,231 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-08-30 08:34:05,237 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 08:34:05,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 08:34:05,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-30 08:34:05,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 08:34:05,299 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 08:34:05,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 104 transitions, 213 flow [2023-08-30 08:34:05,387 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2023-08-30 08:34:05,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:34:05,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 114 events. 10/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2023-08-30 08:34:05,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 104 transitions, 213 flow [2023-08-30 08:34:05,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 104 transitions, 213 flow [2023-08-30 08:34:05,399 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 08:34:05,407 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 104 transitions, 213 flow [2023-08-30 08:34:05,409 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 104 transitions, 213 flow [2023-08-30 08:34:05,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 104 transitions, 213 flow [2023-08-30 08:34:05,453 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2023-08-30 08:34:05,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:34:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 114 events. 10/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2023-08-30 08:34:05,456 INFO L119 LiptonReduction]: Number of co-enabled transitions 1950 [2023-08-30 08:34:07,377 INFO L134 LiptonReduction]: Checked pairs total: 2785 [2023-08-30 08:34:07,378 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-30 08:34:07,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 08:34:07,403 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;@66fe4444, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 08:34:07,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-08-30 08:34:07,406 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 08:34:07,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:34:07,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:07,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 08:34:07,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:07,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 494598822, now seen corresponding path program 1 times [2023-08-30 08:34:07,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:07,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105225178] [2023-08-30 08:34:07,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:07,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:07,597 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 08:34:07,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:07,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105225178] [2023-08-30 08:34:07,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105225178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:34:07,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:34:07,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 08:34:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228290910] [2023-08-30 08:34:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:34:07,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 08:34:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 08:34:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 08:34:07,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194 [2023-08-30 08:34:07,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:07,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194 [2023-08-30 08:34:07,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:07,724 INFO L130 PetriNetUnfolder]: 46/115 cut-off events. [2023-08-30 08:34:07,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:34:07,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 115 events. 46/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs, 37 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 212. Up to 108 conditions per place. [2023-08-30 08:34:07,728 INFO L137 encePairwiseOnDemand]: 187/194 looper letters, 25 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-30 08:34:07,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 115 flow [2023-08-30 08:34:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 08:34:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 08:34:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 204 transitions. [2023-08-30 08:34:07,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2023-08-30 08:34:07,743 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 204 transitions. [2023-08-30 08:34:07,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 204 transitions. [2023-08-30 08:34:07,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:07,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 204 transitions. [2023-08-30 08:34:07,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,756 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,758 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 81 flow. Second operand 2 states and 204 transitions. [2023-08-30 08:34:07,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 115 flow [2023-08-30 08:34:07,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 115 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 08:34:07,762 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 65 flow [2023-08-30 08:34:07,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=65, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2023-08-30 08:34:07,768 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-30 08:34:07,769 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 65 flow [2023-08-30 08:34:07,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:07,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 08:34:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 08:34:07,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:07,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1847305235, now seen corresponding path program 1 times [2023-08-30 08:34:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989551372] [2023-08-30 08:34:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:07,871 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 08:34:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989551372] [2023-08-30 08:34:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989551372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:34:07,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:34:07,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 08:34:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193994854] [2023-08-30 08:34:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:34:07,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:34:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:34:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:34:07,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 194 [2023-08-30 08:34:07,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:07,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 194 [2023-08-30 08:34:07,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:07,947 INFO L130 PetriNetUnfolder]: 49/127 cut-off events. [2023-08-30 08:34:07,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:34:07,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 127 events. 49/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 293 event pairs, 2 based on Foata normal form. 3/111 useless extension candidates. Maximal degree in co-relation 245. Up to 105 conditions per place. [2023-08-30 08:34:07,951 INFO L137 encePairwiseOnDemand]: 189/194 looper letters, 27 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-30 08:34:07,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 131 flow [2023-08-30 08:34:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:34:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:34:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-30 08:34:07,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49312714776632305 [2023-08-30 08:34:07,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-30 08:34:07,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-30 08:34:07,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:07,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-30 08:34:07,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,963 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 65 flow. Second operand 3 states and 287 transitions. [2023-08-30 08:34:07,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 131 flow [2023-08-30 08:34:07,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 131 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 08:34:07,964 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 81 flow [2023-08-30 08:34:07,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2023-08-30 08:34:07,965 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-08-30 08:34:07,965 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 81 flow [2023-08-30 08:34:07,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:07,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:07,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:07,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 08:34:07,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:07,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 174759459, now seen corresponding path program 1 times [2023-08-30 08:34:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316292062] [2023-08-30 08:34:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:07,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:08,235 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 08:34:08,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316292062] [2023-08-30 08:34:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316292062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:34:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:34:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 08:34:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838135735] [2023-08-30 08:34:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:34:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 08:34:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 08:34:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:34:08,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 194 [2023-08-30 08:34:08,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:08,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:08,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 194 [2023-08-30 08:34:08,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:08,414 INFO L130 PetriNetUnfolder]: 63/168 cut-off events. [2023-08-30 08:34:08,416 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 08:34:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 168 events. 63/168 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs, 2 based on Foata normal form. 3/149 useless extension candidates. Maximal degree in co-relation 347. Up to 116 conditions per place. [2023-08-30 08:34:08,419 INFO L137 encePairwiseOnDemand]: 183/194 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2023-08-30 08:34:08,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 191 flow [2023-08-30 08:34:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:34:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:34:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2023-08-30 08:34:08,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329896907216495 [2023-08-30 08:34:08,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 504 transitions. [2023-08-30 08:34:08,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 504 transitions. [2023-08-30 08:34:08,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:08,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 504 transitions. [2023-08-30 08:34:08,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:08,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:08,427 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:08,427 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 81 flow. Second operand 6 states and 504 transitions. [2023-08-30 08:34:08,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 191 flow [2023-08-30 08:34:08,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:34:08,429 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 141 flow [2023-08-30 08:34:08,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-30 08:34:08,430 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-30 08:34:08,430 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 141 flow [2023-08-30 08:34:08,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:08,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:08,431 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:08,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 08:34:08,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:08,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash -602331744, now seen corresponding path program 1 times [2023-08-30 08:34:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785394527] [2023-08-30 08:34:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:08,618 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 08:34:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785394527] [2023-08-30 08:34:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785394527] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092789494] [2023-08-30 08:34:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:08,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:08,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:08,622 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 08:34:08,634 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 08:34:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:08,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 08:34:08,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:08,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:08,841 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:08,842 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 08:34:08,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:08,960 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 08:34:08,981 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 7 [2023-08-30 08:34:08,992 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 08:34:08,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:09,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:09,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:09,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:09,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:09,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2023-08-30 08:34:09,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-30 08:34:09,167 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 5 treesize of output 3 [2023-08-30 08:34:09,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-08-30 08:34:09,181 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 27 treesize of output 25 [2023-08-30 08:34:09,324 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 08:34:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092789494] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:09,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:09,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-08-30 08:34:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837977782] [2023-08-30 08:34:09,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-30 08:34:09,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-30 08:34:09,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=224, Unknown=1, NotChecked=0, Total=272 [2023-08-30 08:34:09,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 194 [2023-08-30 08:34:09,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 141 flow. Second operand has 17 states, 17 states have (on average 52.94117647058823) internal successors, (900), 17 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:09,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:09,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 194 [2023-08-30 08:34:09,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:10,183 INFO L130 PetriNetUnfolder]: 103/274 cut-off events. [2023-08-30 08:34:10,183 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2023-08-30 08:34:10,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 274 events. 103/274 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 811 event pairs, 4 based on Foata normal form. 3/255 useless extension candidates. Maximal degree in co-relation 736. Up to 92 conditions per place. [2023-08-30 08:34:10,185 INFO L137 encePairwiseOnDemand]: 179/194 looper letters, 56 selfloop transitions, 28 changer transitions 0/86 dead transitions. [2023-08-30 08:34:10,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 469 flow [2023-08-30 08:34:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 08:34:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 08:34:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 750 transitions. [2023-08-30 08:34:10,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2973830293417922 [2023-08-30 08:34:10,191 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 750 transitions. [2023-08-30 08:34:10,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 750 transitions. [2023-08-30 08:34:10,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:10,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 750 transitions. [2023-08-30 08:34:10,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 57.69230769230769) internal successors, (750), 13 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 194.0) internal successors, (2716), 14 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,198 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 194.0) internal successors, (2716), 14 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,198 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 141 flow. Second operand 13 states and 750 transitions. [2023-08-30 08:34:10,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 469 flow [2023-08-30 08:34:10,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:34:10,203 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 364 flow [2023-08-30 08:34:10,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=364, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-08-30 08:34:10,204 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2023-08-30 08:34:10,204 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 364 flow [2023-08-30 08:34:10,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 52.94117647058823) internal successors, (900), 17 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:10,205 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:10,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 08:34:10,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:10,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:10,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash 969062124, now seen corresponding path program 1 times [2023-08-30 08:34:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869326534] [2023-08-30 08:34:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869326534] [2023-08-30 08:34:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869326534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:34:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:34:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 08:34:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921182446] [2023-08-30 08:34:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:34:10,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 08:34:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 08:34:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-08-30 08:34:10,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 194 [2023-08-30 08:34:10,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:10,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 194 [2023-08-30 08:34:10,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:10,969 INFO L130 PetriNetUnfolder]: 75/246 cut-off events. [2023-08-30 08:34:10,969 INFO L131 PetriNetUnfolder]: For 552/552 co-relation queries the response was YES. [2023-08-30 08:34:10,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 246 events. 75/246 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 787 event pairs, 5 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 874. Up to 111 conditions per place. [2023-08-30 08:34:10,971 INFO L137 encePairwiseOnDemand]: 181/194 looper letters, 53 selfloop transitions, 28 changer transitions 0/86 dead transitions. [2023-08-30 08:34:10,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 661 flow [2023-08-30 08:34:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 08:34:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 08:34:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 811 transitions. [2023-08-30 08:34:10,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38003748828491096 [2023-08-30 08:34:10,974 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 811 transitions. [2023-08-30 08:34:10,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 811 transitions. [2023-08-30 08:34:10,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:10,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 811 transitions. [2023-08-30 08:34:10,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 194.0) internal successors, (2328), 12 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,980 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 194.0) internal successors, (2328), 12 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,980 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 364 flow. Second operand 11 states and 811 transitions. [2023-08-30 08:34:10,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 661 flow [2023-08-30 08:34:10,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 86 transitions, 624 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 08:34:10,987 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 553 flow [2023-08-30 08:34:10,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=553, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-30 08:34:10,988 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2023-08-30 08:34:10,988 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 553 flow [2023-08-30 08:34:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:10,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:10,988 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 08:34:10,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:10,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1723457859, now seen corresponding path program 1 times [2023-08-30 08:34:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:10,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279855625] [2023-08-30 08:34:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279855625] [2023-08-30 08:34:11,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279855625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021087970] [2023-08-30 08:34:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:11,337 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 08:34:11,362 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 08:34:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:11,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-30 08:34:11,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:11,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:11,471 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:11,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:11,536 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 08:34:11,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 08:34:11,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:11,694 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 14 treesize of output 16 [2023-08-30 08:34:11,797 INFO L321 Elim1Store]: treesize reduction 82, result has 30.5 percent of original size [2023-08-30 08:34:11,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 149 [2023-08-30 08:34:11,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:11,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:11,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:11,951 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-08-30 08:34:11,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 23 [2023-08-30 08:34:11,986 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 08:34:11,987 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 1 case distinctions, treesize of input 21 treesize of output 5 [2023-08-30 08:34:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:12,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:12,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:12,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:12,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:12,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:12,324 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 98 treesize of output 86 [2023-08-30 08:34:12,329 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 138 treesize of output 130 [2023-08-30 08:34:12,339 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 126 treesize of output 124 [2023-08-30 08:34:12,344 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 124 treesize of output 122 [2023-08-30 08:34:12,348 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 122 treesize of output 120 [2023-08-30 08:34:12,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:12,427 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 46 treesize of output 50 [2023-08-30 08:34:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021087970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:12,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:12,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-30 08:34:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750819961] [2023-08-30 08:34:12,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:12,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 08:34:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 08:34:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=415, Unknown=1, NotChecked=0, Total=506 [2023-08-30 08:34:13,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 194 [2023-08-30 08:34:13,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 553 flow. Second operand has 23 states, 23 states have (on average 59.21739130434783) internal successors, (1362), 23 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:13,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:13,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 194 [2023-08-30 08:34:13,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:14,735 INFO L130 PetriNetUnfolder]: 73/250 cut-off events. [2023-08-30 08:34:14,736 INFO L131 PetriNetUnfolder]: For 727/727 co-relation queries the response was YES. [2023-08-30 08:34:14,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 250 events. 73/250 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 811 event pairs, 1 based on Foata normal form. 5/252 useless extension candidates. Maximal degree in co-relation 1011. Up to 68 conditions per place. [2023-08-30 08:34:14,738 INFO L137 encePairwiseOnDemand]: 178/194 looper letters, 75 selfloop transitions, 43 changer transitions 0/123 dead transitions. [2023-08-30 08:34:14,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 1077 flow [2023-08-30 08:34:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-30 08:34:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-30 08:34:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1179 transitions. [2023-08-30 08:34:14,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31985892566467716 [2023-08-30 08:34:14,742 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1179 transitions. [2023-08-30 08:34:14,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1179 transitions. [2023-08-30 08:34:14,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:14,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1179 transitions. [2023-08-30 08:34:14,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 62.05263157894737) internal successors, (1179), 19 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:14,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 194.0) internal successors, (3880), 20 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:14,752 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 194.0) internal successors, (3880), 20 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:14,752 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 553 flow. Second operand 19 states and 1179 transitions. [2023-08-30 08:34:14,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 1077 flow [2023-08-30 08:34:14,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 123 transitions, 1009 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-08-30 08:34:14,760 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 743 flow [2023-08-30 08:34:14,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=743, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2023-08-30 08:34:14,760 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 61 predicate places. [2023-08-30 08:34:14,761 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 743 flow [2023-08-30 08:34:14,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 59.21739130434783) internal successors, (1362), 23 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:14,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:14,762 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:14,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 08:34:14,968 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,SelfDestructingSolverStorable5 [2023-08-30 08:34:14,968 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:14,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash 10301461, now seen corresponding path program 2 times [2023-08-30 08:34:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274813459] [2023-08-30 08:34:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:15,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274813459] [2023-08-30 08:34:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274813459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:15,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118994031] [2023-08-30 08:34:15,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:34:15,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:15,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:15,361 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 08:34:15,384 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 08:34:15,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:34:15,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:34:15,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-30 08:34:15,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:15,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:15,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-30 08:34:15,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:34:15,567 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 08:34:15,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 08:34:15,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:15,888 INFO L321 Elim1Store]: treesize reduction 55, result has 33.7 percent of original size [2023-08-30 08:34:15,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 88 [2023-08-30 08:34:15,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:15,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:15,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-08-30 08:34:16,203 INFO L321 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2023-08-30 08:34:16,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 585 treesize of output 622 [2023-08-30 08:34:16,226 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 99 treesize of output 97 [2023-08-30 08:34:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:16,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:16,546 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_192 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_192) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_197) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))) (or (forall ((v_ArrVal_194 (Array Int Int)) (v_ArrVal_197 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_197) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) .cse0))) is different from false [2023-08-30 08:34:16,567 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_194 (Array Int Int)) (v_ArrVal_197 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_197) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_192 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_192) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_197) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)))) is different from false [2023-08-30 08:34:16,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:16,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:16,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:16,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:16,757 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 55 treesize of output 47 [2023-08-30 08:34:16,760 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 6 treesize of output 4 [2023-08-30 08:34:16,765 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 5 treesize of output 3 [2023-08-30 08:34:16,768 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 6 treesize of output 4 [2023-08-30 08:34:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118994031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:16,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:16,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2023-08-30 08:34:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911971953] [2023-08-30 08:34:16,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:16,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 08:34:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:16,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 08:34:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=625, Unknown=2, NotChecked=106, Total=870 [2023-08-30 08:34:16,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 194 [2023-08-30 08:34:16,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 743 flow. Second operand has 30 states, 30 states have (on average 47.63333333333333) internal successors, (1429), 30 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:16,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:16,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 194 [2023-08-30 08:34:16,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:18,212 INFO L130 PetriNetUnfolder]: 130/412 cut-off events. [2023-08-30 08:34:18,212 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2023-08-30 08:34:18,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 412 events. 130/412 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1544 event pairs, 0 based on Foata normal form. 5/411 useless extension candidates. Maximal degree in co-relation 1755. Up to 114 conditions per place. [2023-08-30 08:34:18,216 INFO L137 encePairwiseOnDemand]: 174/194 looper letters, 114 selfloop transitions, 69 changer transitions 0/188 dead transitions. [2023-08-30 08:34:18,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 188 transitions, 1757 flow [2023-08-30 08:34:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-30 08:34:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-30 08:34:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1375 transitions. [2023-08-30 08:34:18,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26250477281405116 [2023-08-30 08:34:18,223 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1375 transitions. [2023-08-30 08:34:18,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1375 transitions. [2023-08-30 08:34:18,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:18,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1375 transitions. [2023-08-30 08:34:18,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 50.925925925925924) internal successors, (1375), 27 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 194.0) internal successors, (5432), 28 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,235 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 194.0) internal successors, (5432), 28 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,235 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 743 flow. Second operand 27 states and 1375 transitions. [2023-08-30 08:34:18,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 188 transitions, 1757 flow [2023-08-30 08:34:18,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 188 transitions, 1721 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-30 08:34:18,247 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 1327 flow [2023-08-30 08:34:18,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1327, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2023-08-30 08:34:18,248 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 96 predicate places. [2023-08-30 08:34:18,249 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 1327 flow [2023-08-30 08:34:18,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 47.63333333333333) internal successors, (1429), 30 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:18,250 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:18,257 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 08:34:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:18,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:18,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1197837360, now seen corresponding path program 1 times [2023-08-30 08:34:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788598423] [2023-08-30 08:34:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788598423] [2023-08-30 08:34:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788598423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125071145] [2023-08-30 08:34:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:18,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:18,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:18,524 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 08:34:18,526 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 08:34:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:18,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 08:34:18,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:18,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:18,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:18,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:18,723 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 08:34:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125071145] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 08:34:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [2, 2] total 5 [2023-08-30 08:34:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395565343] [2023-08-30 08:34:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:34:18,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:34:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:34:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:34:18,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 194 [2023-08-30 08:34:18,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 1327 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:18,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 194 [2023-08-30 08:34:18,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:18,821 INFO L130 PetriNetUnfolder]: 116/387 cut-off events. [2023-08-30 08:34:18,822 INFO L131 PetriNetUnfolder]: For 1995/1996 co-relation queries the response was YES. [2023-08-30 08:34:18,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 387 events. 116/387 cut-off events. For 1995/1996 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1486 event pairs, 53 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 1998. Up to 325 conditions per place. [2023-08-30 08:34:18,825 INFO L137 encePairwiseOnDemand]: 192/194 looper letters, 117 selfloop transitions, 1 changer transitions 0/130 dead transitions. [2023-08-30 08:34:18,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 130 transitions, 1550 flow [2023-08-30 08:34:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:34:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:34:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-30 08:34:18,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48109965635738833 [2023-08-30 08:34:18,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-30 08:34:18,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-30 08:34:18,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:18,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-30 08:34:18,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,829 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 1327 flow. Second operand 3 states and 280 transitions. [2023-08-30 08:34:18,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 130 transitions, 1550 flow [2023-08-30 08:34:18,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 1456 flow, removed 22 selfloop flow, removed 8 redundant places. [2023-08-30 08:34:18,847 INFO L231 Difference]: Finished difference. Result has 125 places, 130 transitions, 1222 flow [2023-08-30 08:34:18,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=125, PETRI_TRANSITIONS=130} [2023-08-30 08:34:18,850 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 89 predicate places. [2023-08-30 08:34:18,850 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 130 transitions, 1222 flow [2023-08-30 08:34:18,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:18,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:18,850 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:18,858 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 08:34:19,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:19,056 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:19,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1197837361, now seen corresponding path program 1 times [2023-08-30 08:34:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:19,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601380716] [2023-08-30 08:34:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601380716] [2023-08-30 08:34:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601380716] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907508062] [2023-08-30 08:34:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:19,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:19,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:19,141 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 08:34:19,144 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 08:34:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:19,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 08:34:19,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:19,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:19,288 INFO L321 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2023-08-30 08:34:19,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 1 [2023-08-30 08:34:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:19,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907508062] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:19,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 08:34:19,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2023-08-30 08:34:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206570129] [2023-08-30 08:34:19,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:34:19,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:34:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:34:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 08:34:19,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 194 [2023-08-30 08:34:19,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 130 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:19,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:19,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 194 [2023-08-30 08:34:19,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:19,369 INFO L130 PetriNetUnfolder]: 107/369 cut-off events. [2023-08-30 08:34:19,369 INFO L131 PetriNetUnfolder]: For 1702/1703 co-relation queries the response was YES. [2023-08-30 08:34:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 369 events. 107/369 cut-off events. For 1702/1703 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1409 event pairs, 47 based on Foata normal form. 12/378 useless extension candidates. Maximal degree in co-relation 1815. Up to 307 conditions per place. [2023-08-30 08:34:19,373 INFO L137 encePairwiseOnDemand]: 191/194 looper letters, 113 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2023-08-30 08:34:19,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 1415 flow [2023-08-30 08:34:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:34:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:34:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-30 08:34:19,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793814432989691 [2023-08-30 08:34:19,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-30 08:34:19,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-30 08:34:19,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:19,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-30 08:34:19,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:19,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:19,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:19,378 INFO L175 Difference]: Start difference. First operand has 125 places, 130 transitions, 1222 flow. Second operand 3 states and 279 transitions. [2023-08-30 08:34:19,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 1415 flow [2023-08-30 08:34:19,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 1410 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 08:34:19,392 INFO L231 Difference]: Finished difference. Result has 122 places, 126 transitions, 1184 flow [2023-08-30 08:34:19,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=122, PETRI_TRANSITIONS=126} [2023-08-30 08:34:19,392 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 86 predicate places. [2023-08-30 08:34:19,393 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 126 transitions, 1184 flow [2023-08-30 08:34:19,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:19,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:19,393 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:19,401 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 08:34:19,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:19,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:19,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1081871130, now seen corresponding path program 1 times [2023-08-30 08:34:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:19,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483783079] [2023-08-30 08:34:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483783079] [2023-08-30 08:34:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483783079] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876839169] [2023-08-30 08:34:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:19,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:19,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:19,784 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 08:34:19,786 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 08:34:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:19,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 08:34:19,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:19,949 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 08:34:19,963 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 7 [2023-08-30 08:34:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:19,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:20,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:20,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:20,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:20,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:20,033 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 39 treesize of output 27 [2023-08-30 08:34:20,036 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 7 treesize of output 5 [2023-08-30 08:34:20,041 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 27 treesize of output 19 [2023-08-30 08:34:20,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:20,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:20,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876839169] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:20,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:20,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 10 [2023-08-30 08:34:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178565783] [2023-08-30 08:34:20,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:20,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 08:34:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 08:34:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-30 08:34:20,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 194 [2023-08-30 08:34:20,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 1184 flow. Second operand has 12 states, 12 states have (on average 78.41666666666667) internal successors, (941), 12 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:20,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:20,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 194 [2023-08-30 08:34:20,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:20,826 INFO L130 PetriNetUnfolder]: 169/578 cut-off events. [2023-08-30 08:34:20,827 INFO L131 PetriNetUnfolder]: For 2719/2719 co-relation queries the response was YES. [2023-08-30 08:34:20,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2942 conditions, 578 events. 169/578 cut-off events. For 2719/2719 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2026 event pairs, 2 based on Foata normal form. 22/598 useless extension candidates. Maximal degree in co-relation 2899. Up to 121 conditions per place. [2023-08-30 08:34:20,832 INFO L137 encePairwiseOnDemand]: 182/194 looper letters, 168 selfloop transitions, 78 changer transitions 0/255 dead transitions. [2023-08-30 08:34:20,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 255 transitions, 2853 flow [2023-08-30 08:34:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 08:34:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 08:34:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2104 transitions. [2023-08-30 08:34:20,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41712926249008725 [2023-08-30 08:34:20,838 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2104 transitions. [2023-08-30 08:34:20,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2104 transitions. [2023-08-30 08:34:20,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:20,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2104 transitions. [2023-08-30 08:34:20,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 80.92307692307692) internal successors, (2104), 26 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:20,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 194.0) internal successors, (5238), 27 states have internal predecessors, (5238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:20,851 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 194.0) internal successors, (5238), 27 states have internal predecessors, (5238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:20,851 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 1184 flow. Second operand 26 states and 2104 transitions. [2023-08-30 08:34:20,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 255 transitions, 2853 flow [2023-08-30 08:34:20,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 255 transitions, 2850 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 08:34:20,870 INFO L231 Difference]: Finished difference. Result has 155 places, 172 transitions, 1973 flow [2023-08-30 08:34:20,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1973, PETRI_PLACES=155, PETRI_TRANSITIONS=172} [2023-08-30 08:34:20,871 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 119 predicate places. [2023-08-30 08:34:20,871 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 172 transitions, 1973 flow [2023-08-30 08:34:20,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 78.41666666666667) internal successors, (941), 12 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:20,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:20,872 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:20,881 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 08:34:21,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:21,079 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:21,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash 679754305, now seen corresponding path program 1 times [2023-08-30 08:34:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447807602] [2023-08-30 08:34:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:21,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447807602] [2023-08-30 08:34:21,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447807602] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294878956] [2023-08-30 08:34:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:21,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:21,623 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 08:34:21,643 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 08:34:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:21,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 08:34:21,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:21,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:21,785 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:21,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:21,817 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:21,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:21,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:34:21,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:34:22,025 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:22,025 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 08:34:22,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:22,084 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 08:34:22,101 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 7 [2023-08-30 08:34:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:22,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:22,125 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_461) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483648)) is different from false [2023-08-30 08:34:22,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:22,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:22,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:22,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:22,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2023-08-30 08:34:22,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 5 treesize of output 3 [2023-08-30 08:34:22,205 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 5 treesize of output 3 [2023-08-30 08:34:22,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-08-30 08:34:22,212 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 27 treesize of output 25 [2023-08-30 08:34:22,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:22,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-30 08:34:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294878956] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:22,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-30 08:34:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114460740] [2023-08-30 08:34:22,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 08:34:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 08:34:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=811, Unknown=1, NotChecked=60, Total=1056 [2023-08-30 08:34:22,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 194 [2023-08-30 08:34:22,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 172 transitions, 1973 flow. Second operand has 33 states, 33 states have (on average 47.24242424242424) internal successors, (1559), 33 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:22,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:22,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 194 [2023-08-30 08:34:22,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:24,187 INFO L130 PetriNetUnfolder]: 213/721 cut-off events. [2023-08-30 08:34:24,188 INFO L131 PetriNetUnfolder]: For 4656/4656 co-relation queries the response was YES. [2023-08-30 08:34:24,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 721 events. 213/721 cut-off events. For 4656/4656 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2908 event pairs, 4 based on Foata normal form. 17/737 useless extension candidates. Maximal degree in co-relation 3923. Up to 148 conditions per place. [2023-08-30 08:34:24,198 INFO L137 encePairwiseOnDemand]: 177/194 looper letters, 203 selfloop transitions, 142 changer transitions 0/347 dead transitions. [2023-08-30 08:34:24,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 347 transitions, 4189 flow [2023-08-30 08:34:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-30 08:34:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-30 08:34:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2024 transitions. [2023-08-30 08:34:24,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26082474226804125 [2023-08-30 08:34:24,203 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 2024 transitions. [2023-08-30 08:34:24,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 2024 transitions. [2023-08-30 08:34:24,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:24,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2024 transitions. [2023-08-30 08:34:24,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 50.6) internal successors, (2024), 40 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:24,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 194.0) internal successors, (7954), 41 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:24,250 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 194.0) internal successors, (7954), 41 states have internal predecessors, (7954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:24,250 INFO L175 Difference]: Start difference. First operand has 155 places, 172 transitions, 1973 flow. Second operand 40 states and 2024 transitions. [2023-08-30 08:34:24,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 347 transitions, 4189 flow [2023-08-30 08:34:24,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 347 transitions, 4109 flow, removed 26 selfloop flow, removed 8 redundant places. [2023-08-30 08:34:24,281 INFO L231 Difference]: Finished difference. Result has 202 places, 243 transitions, 3176 flow [2023-08-30 08:34:24,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3176, PETRI_PLACES=202, PETRI_TRANSITIONS=243} [2023-08-30 08:34:24,282 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 166 predicate places. [2023-08-30 08:34:24,282 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 243 transitions, 3176 flow [2023-08-30 08:34:24,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 47.24242424242424) internal successors, (1559), 33 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:24,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:24,283 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:24,291 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 08:34:24,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:24,489 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:24,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 896272228, now seen corresponding path program 1 times [2023-08-30 08:34:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908035901] [2023-08-30 08:34:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908035901] [2023-08-30 08:34:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908035901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895212334] [2023-08-30 08:34:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:24,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:24,807 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 08:34:24,839 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 08:34:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:24,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-30 08:34:24,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:24,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:24,975 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:24,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:25,009 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:25,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:25,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:25,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-08-30 08:34:25,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:34:25,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:34:25,212 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:25,212 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 08:34:25,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:25,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 08:34:25,292 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 7 [2023-08-30 08:34:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:25,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:25,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:25,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:25,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:25,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:25,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2023-08-30 08:34:25,408 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 7 treesize of output 5 [2023-08-30 08:34:25,418 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 7 treesize of output 5 [2023-08-30 08:34:25,422 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 43 treesize of output 35 [2023-08-30 08:34:25,424 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 31 treesize of output 29 [2023-08-30 08:34:25,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:25,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:25,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:25,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:25,848 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 5 treesize of output 3 [2023-08-30 08:34:25,856 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 42 treesize of output 34 [2023-08-30 08:34:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895212334] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:26,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2023-08-30 08:34:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366260958] [2023-08-30 08:34:26,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:26,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 08:34:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 08:34:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=977, Unknown=3, NotChecked=0, Total=1190 [2023-08-30 08:34:27,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 194 [2023-08-30 08:34:27,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 243 transitions, 3176 flow. Second operand has 35 states, 35 states have (on average 47.114285714285714) internal successors, (1649), 35 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:27,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:27,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 194 [2023-08-30 08:34:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:29,103 INFO L130 PetriNetUnfolder]: 217/754 cut-off events. [2023-08-30 08:34:29,103 INFO L131 PetriNetUnfolder]: For 6820/6820 co-relation queries the response was YES. [2023-08-30 08:34:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 754 events. 217/754 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3089 event pairs, 11 based on Foata normal form. 25/778 useless extension candidates. Maximal degree in co-relation 4618. Up to 155 conditions per place. [2023-08-30 08:34:29,113 INFO L137 encePairwiseOnDemand]: 178/194 looper letters, 207 selfloop transitions, 135 changer transitions 0/344 dead transitions. [2023-08-30 08:34:29,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 344 transitions, 4809 flow [2023-08-30 08:34:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-30 08:34:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-30 08:34:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1947 transitions. [2023-08-30 08:34:29,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2573354480570975 [2023-08-30 08:34:29,121 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 1947 transitions. [2023-08-30 08:34:29,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 1947 transitions. [2023-08-30 08:34:29,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:29,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 1947 transitions. [2023-08-30 08:34:29,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 49.92307692307692) internal successors, (1947), 39 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:29,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 194.0) internal successors, (7760), 40 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:29,134 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 194.0) internal successors, (7760), 40 states have internal predecessors, (7760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:29,134 INFO L175 Difference]: Start difference. First operand has 202 places, 243 transitions, 3176 flow. Second operand 39 states and 1947 transitions. [2023-08-30 08:34:29,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 344 transitions, 4809 flow [2023-08-30 08:34:29,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 344 transitions, 4480 flow, removed 87 selfloop flow, removed 23 redundant places. [2023-08-30 08:34:29,184 INFO L231 Difference]: Finished difference. Result has 222 places, 252 transitions, 3419 flow [2023-08-30 08:34:29,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=3419, PETRI_PLACES=222, PETRI_TRANSITIONS=252} [2023-08-30 08:34:29,185 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 186 predicate places. [2023-08-30 08:34:29,185 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 252 transitions, 3419 flow [2023-08-30 08:34:29,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 47.114285714285714) internal successors, (1649), 35 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:29,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:29,186 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:29,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-30 08:34:29,394 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,SelfDestructingSolverStorable11 [2023-08-30 08:34:29,394 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:29,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2040667674, now seen corresponding path program 1 times [2023-08-30 08:34:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698280354] [2023-08-30 08:34:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698280354] [2023-08-30 08:34:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698280354] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77119672] [2023-08-30 08:34:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:30,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:30,139 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 08:34:30,141 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 08:34:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:30,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 08:34:30,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:30,263 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:30,264 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 08:34:30,456 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 08:34:30,507 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-30 08:34:30,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-08-30 08:34:30,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:30,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:30,552 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 16 treesize of output 5 [2023-08-30 08:34:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 08:34:30,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:30,649 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 6 treesize of output 4 [2023-08-30 08:34:30,674 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int))) (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_630) |c_~#top~0.base|) |c_~#top~0.offset|))) is different from false [2023-08-30 08:34:30,680 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int))) (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_630) |c_~#top~0.base|) |c_~#top~0.offset|))) is different from false [2023-08-30 08:34:30,682 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 18 treesize of output 14 [2023-08-30 08:34:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2023-08-30 08:34:30,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77119672] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:30,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 6] total 27 [2023-08-30 08:34:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352249294] [2023-08-30 08:34:30,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:30,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 08:34:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:30,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 08:34:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=572, Unknown=2, NotChecked=98, Total=756 [2023-08-30 08:34:30,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 194 [2023-08-30 08:34:30,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 252 transitions, 3419 flow. Second operand has 28 states, 28 states have (on average 43.107142857142854) internal successors, (1207), 28 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:30,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:30,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 194 [2023-08-30 08:34:30,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:32,416 INFO L130 PetriNetUnfolder]: 228/781 cut-off events. [2023-08-30 08:34:32,416 INFO L131 PetriNetUnfolder]: For 7386/7386 co-relation queries the response was YES. [2023-08-30 08:34:32,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 781 events. 228/781 cut-off events. For 7386/7386 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3262 event pairs, 10 based on Foata normal form. 4/784 useless extension candidates. Maximal degree in co-relation 4924. Up to 167 conditions per place. [2023-08-30 08:34:32,423 INFO L137 encePairwiseOnDemand]: 176/194 looper letters, 144 selfloop transitions, 166 changer transitions 0/312 dead transitions. [2023-08-30 08:34:32,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 312 transitions, 4735 flow [2023-08-30 08:34:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 08:34:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 08:34:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 1486 transitions. [2023-08-30 08:34:32,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22528805336567617 [2023-08-30 08:34:32,427 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 1486 transitions. [2023-08-30 08:34:32,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 1486 transitions. [2023-08-30 08:34:32,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:32,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 1486 transitions. [2023-08-30 08:34:32,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 43.705882352941174) internal successors, (1486), 34 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:32,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 194.0) internal successors, (6790), 35 states have internal predecessors, (6790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:32,438 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 194.0) internal successors, (6790), 35 states have internal predecessors, (6790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:32,438 INFO L175 Difference]: Start difference. First operand has 222 places, 252 transitions, 3419 flow. Second operand 34 states and 1486 transitions. [2023-08-30 08:34:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 312 transitions, 4735 flow [2023-08-30 08:34:32,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 312 transitions, 4484 flow, removed 59 selfloop flow, removed 18 redundant places. [2023-08-30 08:34:32,487 INFO L231 Difference]: Finished difference. Result has 241 places, 279 transitions, 4027 flow [2023-08-30 08:34:32,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=3153, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=4027, PETRI_PLACES=241, PETRI_TRANSITIONS=279} [2023-08-30 08:34:32,488 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 205 predicate places. [2023-08-30 08:34:32,488 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 279 transitions, 4027 flow [2023-08-30 08:34:32,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 43.107142857142854) internal successors, (1207), 28 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:32,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:32,489 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:32,496 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 08:34:32,694 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,SelfDestructingSolverStorable12 [2023-08-30 08:34:32,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:32,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1540716664, now seen corresponding path program 2 times [2023-08-30 08:34:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630133440] [2023-08-30 08:34:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630133440] [2023-08-30 08:34:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630133440] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930247733] [2023-08-30 08:34:33,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:34:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:33,270 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 08:34:33,298 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 08:34:33,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:34:33,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:34:33,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-30 08:34:33,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:33,422 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:33,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 08:34:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:33,922 INFO L321 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2023-08-30 08:34:33,922 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 2 case distinctions, treesize of input 43 treesize of output 33 [2023-08-30 08:34:34,028 INFO L321 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2023-08-30 08:34:34,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 71 [2023-08-30 08:34:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:34,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:34,383 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (forall ((v_ArrVal_729 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_729))) (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse5 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) .cse0)))) is different from false [2023-08-30 08:34:34,412 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (forall ((v_ArrVal_729 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_729))) (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse5 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) .cse0)))) is different from false [2023-08-30 08:34:34,431 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (forall ((v_ArrVal_729 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_729))) (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse5 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) .cse0)))) is different from false [2023-08-30 08:34:34,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:34,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:34,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:34,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:34,613 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 264 treesize of output 252 [2023-08-30 08:34:34,633 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 7 treesize of output 5 [2023-08-30 08:34:34,636 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 205 treesize of output 193 [2023-08-30 08:34:34,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:34,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-30 08:34:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930247733] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:34,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:34,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 35 [2023-08-30 08:34:34,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405357151] [2023-08-30 08:34:34,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:34,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 08:34:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:34,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 08:34:34,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=910, Unknown=3, NotChecked=192, Total=1260 [2023-08-30 08:34:34,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 194 [2023-08-30 08:34:34,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 279 transitions, 4027 flow. Second operand has 36 states, 36 states have (on average 47.666666666666664) internal successors, (1716), 36 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:34,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:34,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 194 [2023-08-30 08:34:34,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:37,875 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|))) (.cse6 (not (= |c_ULTIMATE.start_main_~#t~0#1.offset| 0))) (.cse5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| .cse5)))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (let ((.cse7 (+ c_~next_alloc_idx~0 2147483650))) (or .cse6 (< 0 .cse7) (< .cse7 0))) (or (forall ((v_ArrVal_729 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_729))) (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse8 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse8 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) .cse0) (or .cse6 (<= c_~next_alloc_idx~0 64)) (< 0 (+ 2147483650 .cse5))))) is different from false [2023-08-30 08:34:39,429 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse4 |c_~#top~0.offset|))) (.cse5 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| .cse5)))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (forall ((v_ArrVal_729 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_729))) (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse6 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) .cse0) (< 0 (+ 2147483650 .cse5))))) is different from false [2023-08-30 08:34:39,719 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (forall ((v_ArrVal_729 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_729))) (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse5 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int) (v_ArrVal_737 Int)) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse9 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse9 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))))) (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| v_ArrVal_737))))) (or (< 0 (+ 2147483650 (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (select .cse7 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))))) is different from false [2023-08-30 08:34:40,324 INFO L130 PetriNetUnfolder]: 265/936 cut-off events. [2023-08-30 08:34:40,324 INFO L131 PetriNetUnfolder]: For 11861/11861 co-relation queries the response was YES. [2023-08-30 08:34:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 936 events. 265/936 cut-off events. For 11861/11861 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4352 event pairs, 2 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 6525. Up to 200 conditions per place. [2023-08-30 08:34:40,334 INFO L137 encePairwiseOnDemand]: 175/194 looper letters, 213 selfloop transitions, 259 changer transitions 0/477 dead transitions. [2023-08-30 08:34:40,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 477 transitions, 7643 flow [2023-08-30 08:34:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-30 08:34:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-30 08:34:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 3392 transitions. [2023-08-30 08:34:40,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24977908689248896 [2023-08-30 08:34:40,340 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 3392 transitions. [2023-08-30 08:34:40,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 3392 transitions. [2023-08-30 08:34:40,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:40,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 3392 transitions. [2023-08-30 08:34:40,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 48.457142857142856) internal successors, (3392), 70 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:40,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 194.0) internal successors, (13774), 71 states have internal predecessors, (13774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:40,360 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 194.0) internal successors, (13774), 71 states have internal predecessors, (13774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:40,360 INFO L175 Difference]: Start difference. First operand has 241 places, 279 transitions, 4027 flow. Second operand 70 states and 3392 transitions. [2023-08-30 08:34:40,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 477 transitions, 7643 flow [2023-08-30 08:34:40,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 477 transitions, 7167 flow, removed 91 selfloop flow, removed 22 redundant places. [2023-08-30 08:34:40,420 INFO L231 Difference]: Finished difference. Result has 304 places, 403 transitions, 6102 flow [2023-08-30 08:34:40,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=3650, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=6102, PETRI_PLACES=304, PETRI_TRANSITIONS=403} [2023-08-30 08:34:40,421 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 268 predicate places. [2023-08-30 08:34:40,421 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 403 transitions, 6102 flow [2023-08-30 08:34:40,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 47.666666666666664) internal successors, (1716), 36 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:40,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:40,422 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-30 08:34:40,428 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 08:34:40,627 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,SelfDestructingSolverStorable13 [2023-08-30 08:34:40,628 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:40,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash -748619316, now seen corresponding path program 2 times [2023-08-30 08:34:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:40,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139662788] [2023-08-30 08:34:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:41,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139662788] [2023-08-30 08:34:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139662788] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164163214] [2023-08-30 08:34:41,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:34:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:41,369 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 08:34:41,391 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 08:34:41,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:34:41,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:34:41,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-30 08:34:41,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:41,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:41,567 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:41,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:41,603 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:41,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:41,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:34:41,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:34:41,801 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:41,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:41,845 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:34:41,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:34:41,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:34:41,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:34:42,017 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:42,017 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 08:34:42,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:42,092 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 08:34:42,113 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 7 [2023-08-30 08:34:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:42,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:42,149 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_862 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_862) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483648)) is different from false [2023-08-30 08:34:42,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:42,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:42,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:42,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:42,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2023-08-30 08:34:42,210 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 5 treesize of output 3 [2023-08-30 08:34:42,213 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 5 treesize of output 3 [2023-08-30 08:34:42,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-08-30 08:34:42,221 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 27 treesize of output 25 [2023-08-30 08:34:42,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:42,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:42,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:42,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-30 08:34:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164163214] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:43,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 43 [2023-08-30 08:34:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531333559] [2023-08-30 08:34:43,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-30 08:34:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-30 08:34:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1531, Unknown=1, NotChecked=84, Total=1980 [2023-08-30 08:34:43,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 194 [2023-08-30 08:34:43,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 403 transitions, 6102 flow. Second operand has 45 states, 45 states have (on average 47.577777777777776) internal successors, (2141), 45 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:43,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:43,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 194 [2023-08-30 08:34:43,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:45,584 INFO L130 PetriNetUnfolder]: 372/1333 cut-off events. [2023-08-30 08:34:45,584 INFO L131 PetriNetUnfolder]: For 22205/22205 co-relation queries the response was YES. [2023-08-30 08:34:45,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10573 conditions, 1333 events. 372/1333 cut-off events. For 22205/22205 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6246 event pairs, 5 based on Foata normal form. 19/1351 useless extension candidates. Maximal degree in co-relation 10490. Up to 283 conditions per place. [2023-08-30 08:34:45,596 INFO L137 encePairwiseOnDemand]: 178/194 looper letters, 463 selfloop transitions, 263 changer transitions 0/728 dead transitions. [2023-08-30 08:34:45,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 728 transitions, 12676 flow [2023-08-30 08:34:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-08-30 08:34:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-08-30 08:34:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 2812 transitions. [2023-08-30 08:34:45,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25883652430044185 [2023-08-30 08:34:45,601 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 2812 transitions. [2023-08-30 08:34:45,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 2812 transitions. [2023-08-30 08:34:45,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:34:45,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 2812 transitions. [2023-08-30 08:34:45,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 50.214285714285715) internal successors, (2812), 56 states have internal predecessors, (2812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:45,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 194.0) internal successors, (11058), 57 states have internal predecessors, (11058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:45,614 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 194.0) internal successors, (11058), 57 states have internal predecessors, (11058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:45,614 INFO L175 Difference]: Start difference. First operand has 304 places, 403 transitions, 6102 flow. Second operand 56 states and 2812 transitions. [2023-08-30 08:34:45,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 728 transitions, 12676 flow [2023-08-30 08:34:45,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 728 transitions, 11977 flow, removed 240 selfloop flow, removed 15 redundant places. [2023-08-30 08:34:45,704 INFO L231 Difference]: Finished difference. Result has 350 places, 494 transitions, 8017 flow [2023-08-30 08:34:45,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=5566, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=8017, PETRI_PLACES=350, PETRI_TRANSITIONS=494} [2023-08-30 08:34:45,705 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 314 predicate places. [2023-08-30 08:34:45,705 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 494 transitions, 8017 flow [2023-08-30 08:34:45,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 47.577777777777776) internal successors, (2141), 45 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:45,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:34:45,705 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 08:34:45,710 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 08:34:45,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 08:34:45,906 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:34:45,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:34:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash -128767538, now seen corresponding path program 1 times [2023-08-30 08:34:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:34:45,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321905392] [2023-08-30 08:34:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:34:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:34:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321905392] [2023-08-30 08:34:47,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321905392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:34:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67683507] [2023-08-30 08:34:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:34:47,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:34:47,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:34:47,049 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 08:34:47,051 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 08:34:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:34:47,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-30 08:34:47,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:34:47,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:34:47,499 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:34:47,500 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 08:34:47,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:34:47,768 INFO L321 Elim1Store]: treesize reduction 34, result has 47.7 percent of original size [2023-08-30 08:34:47,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 74 [2023-08-30 08:34:47,805 INFO L321 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2023-08-30 08:34:47,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 105 [2023-08-30 08:34:47,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:34:47,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 98 [2023-08-30 08:34:47,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2023-08-30 08:34:47,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 08:34:47,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-08-30 08:34:48,056 INFO L321 Elim1Store]: treesize reduction 30, result has 59.5 percent of original size [2023-08-30 08:34:48,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 104 [2023-08-30 08:34:48,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2023-08-30 08:34:48,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 50 treesize of output 53 [2023-08-30 08:34:48,208 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 7 treesize of output 5 [2023-08-30 08:34:48,215 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 15 treesize of output 11 [2023-08-30 08:34:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:48,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:34:48,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:48,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:34:48,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:48,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:34:48,983 INFO L321 Elim1Store]: treesize reduction 38, result has 56.8 percent of original size [2023-08-30 08:34:48,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2426 treesize of output 2389 [2023-08-30 08:34:49,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 500 treesize of output 501 [2023-08-30 08:34:49,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 607 treesize of output 621 [2023-08-30 08:34:49,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,126 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 557 treesize of output 554 [2023-08-30 08:34:49,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,152 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 552 treesize of output 556 [2023-08-30 08:34:49,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 555 treesize of output 551 [2023-08-30 08:34:49,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,251 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 541 treesize of output 518 [2023-08-30 08:34:49,269 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 511 treesize of output 499 [2023-08-30 08:34:49,621 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 5 treesize of output 3 [2023-08-30 08:34:49,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:49,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:34:49,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:34:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:34:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67683507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:34:49,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:34:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 39 [2023-08-30 08:34:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703402280] [2023-08-30 08:34:49,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:34:49,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-30 08:34:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:34:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-30 08:34:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1363, Unknown=47, NotChecked=0, Total=1640 [2023-08-30 08:34:50,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 194 [2023-08-30 08:34:50,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 494 transitions, 8017 flow. Second operand has 41 states, 41 states have (on average 42.36585365853659) internal successors, (1737), 41 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:34:50,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:34:50,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 194 [2023-08-30 08:34:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:34:59,501 WARN L222 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 102 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:34:59,776 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (<= c_~next_alloc_idx~0 64)) (.cse2 (= |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse5 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse8 |c_~#top~0.offset|))) (.cse3 (< (+ c_~next_alloc_idx~0 2147483650) 0)) (.cse4 (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| .cse0)) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1003) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= 0 (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))) (< (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))))) (and (< .cse0 2147483647) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123|) 0)) (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123|))) .cse1) (or .cse2 .cse1) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (not .cse2) .cse3) (or .cse4 (not .cse5)) (<= c_~next_alloc_idx~0 62) (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1000) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= (select (select .cse6 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (< (select (select .cse6 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))) .cse5) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 0)) .cse3) .cse4))) is different from false [2023-08-30 08:35:06,071 WARN L222 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 80 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:35:06,160 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (<= c_~next_alloc_idx~0 64)) (.cse3 (= |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse4 (< (+ c_~next_alloc_idx~0 2147483650) 0)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse8 |c_~#top~0.offset|))) (.cse1 (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| .cse6)) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1003) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= 0 (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))) (< (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))))) (and (or (not .cse0) .cse1) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123|) 0)) (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123|))) .cse2) (or .cse3 .cse2) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (not .cse3) .cse4) (<= c_~next_alloc_idx~0 62) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 0)) .cse4) (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1000) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (< (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))) .cse0) .cse1 (<= .cse6 5)))) is different from false [2023-08-30 08:35:10,562 WARN L539 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 08:35:14,681 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 08:35:16,825 WARN L539 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 08:35:18,893 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 [1] [2023-08-30 08:35:20,949 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 08:35:45,613 WARN L222 SmtUtils]: Spent 20.22s on a formula simplification. DAG size of input: 59 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:35:49,882 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 08:35:55,550 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse3 (= |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|)) (.cse4 (< (+ c_~next_alloc_idx~0 2147483650) 0)) (.cse2 (<= c_~next_alloc_idx~0 64)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse8 |c_~#top~0.offset|))) (.cse1 (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| .cse6)) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1003) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= 0 (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))) (< (select (select .cse7 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))))) (and (or (not .cse0) .cse1) (or (forall ((|v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123|) 0)) (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |v_thr1Thread1of1ForFork0_push_~#ret~0#1.base_123|))) .cse2) (or .cse3 .cse2) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (not .cse3) .cse4) (or (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) 0)) .cse4) .cse2 (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1000) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (< (select (select .cse5 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))) .cse0) .cse1 (<= .cse6 5)))) is different from false [2023-08-30 08:36:04,007 WARN L222 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 77 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:36:26,720 WARN L222 SmtUtils]: Spent 20.19s on a formula simplification. DAG size of input: 48 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:36:28,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:36:51,294 WARN L222 SmtUtils]: Spent 20.34s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:36:53,312 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 08:36:57,531 WARN L539 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 08:36:59,594 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 [1] [2023-08-30 08:37:01,669 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 [1] [2023-08-30 08:37:22,040 WARN L222 SmtUtils]: Spent 20.27s on a formula simplification. DAG size of input: 41 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 08:37:24,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:37:34,877 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse5 |c_~#top~0.offset|))) (.cse0 (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| .cse3)) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1003) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= 0 (select (select .cse4 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|))) (< (select (select .cse4 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))))) (and (or .cse0 (not .cse1)) (or (forall ((|ULTIMATE.start_main_~#t~0#1.base| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_1000) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1005))) (or (not (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (< (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 2147483647)))) .cse1) .cse0 (<= .cse3 5)))) is different from false [2023-08-30 08:37:37,887 INFO L130 PetriNetUnfolder]: 467/1745 cut-off events. [2023-08-30 08:37:37,887 INFO L131 PetriNetUnfolder]: For 29389/29389 co-relation queries the response was YES. [2023-08-30 08:37:37,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13976 conditions, 1745 events. 467/1745 cut-off events. For 29389/29389 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9345 event pairs, 2 based on Foata normal form. 28/1772 useless extension candidates. Maximal degree in co-relation 13887. Up to 334 conditions per place. [2023-08-30 08:37:37,906 INFO L137 encePairwiseOnDemand]: 173/194 looper letters, 421 selfloop transitions, 489 changer transitions 0/912 dead transitions. [2023-08-30 08:37:37,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 912 transitions, 16334 flow [2023-08-30 08:37:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-08-30 08:37:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2023-08-30 08:37:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 4904 transitions. [2023-08-30 08:37:37,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22173991680231506 [2023-08-30 08:37:37,925 INFO L72 ComplementDD]: Start complementDD. Operand 114 states and 4904 transitions. [2023-08-30 08:37:37,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 4904 transitions. [2023-08-30 08:37:37,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:37:37,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 114 states and 4904 transitions. [2023-08-30 08:37:37,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 115 states, 114 states have (on average 43.01754385964912) internal successors, (4904), 114 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:37:37,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 115 states, 115 states have (on average 194.0) internal successors, (22310), 115 states have internal predecessors, (22310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:37:37,962 INFO L81 ComplementDD]: Finished complementDD. Result has 115 states, 115 states have (on average 194.0) internal successors, (22310), 115 states have internal predecessors, (22310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:37:37,962 INFO L175 Difference]: Start difference. First operand has 350 places, 494 transitions, 8017 flow. Second operand 114 states and 4904 transitions. [2023-08-30 08:37:37,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 912 transitions, 16334 flow [2023-08-30 08:37:38,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 912 transitions, 15710 flow, removed 127 selfloop flow, removed 28 redundant places. [2023-08-30 08:37:38,166 INFO L231 Difference]: Finished difference. Result has 476 places, 723 transitions, 12575 flow [2023-08-30 08:37:38,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=7403, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=114, PETRI_FLOW=12575, PETRI_PLACES=476, PETRI_TRANSITIONS=723} [2023-08-30 08:37:38,167 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 440 predicate places. [2023-08-30 08:37:38,167 INFO L495 AbstractCegarLoop]: Abstraction has has 476 places, 723 transitions, 12575 flow [2023-08-30 08:37:38,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 42.36585365853659) internal successors, (1737), 41 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:37:38,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:37:38,168 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 08:37:38,173 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 08:37:38,369 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,SelfDestructingSolverStorable15 [2023-08-30 08:37:38,370 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:37:38,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:37:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 494827813, now seen corresponding path program 3 times [2023-08-30 08:37:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:37:38,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802700027] [2023-08-30 08:37:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:37:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:37:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:37:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:37:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:37:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802700027] [2023-08-30 08:37:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802700027] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:37:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645637520] [2023-08-30 08:37:39,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 08:37:39,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:37:39,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:37:39,601 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 08:37:39,655 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 08:37:39,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 08:37:39,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:37:39,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 70 conjunts are in the unsatisfiable core [2023-08-30 08:37:39,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:37:39,837 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 08:37:39,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 08:37:40,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:37:40,232 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:37:40,233 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 08:37:40,599 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-08-30 08:37:40,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 31 [2023-08-30 08:37:40,703 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 08:37:40,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-08-30 08:37:40,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 21 treesize of output 17 [2023-08-30 08:37:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-30 08:37:40,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:37:47,592 INFO L321 Elim1Store]: treesize reduction 73, result has 32.4 percent of original size [2023-08-30 08:37:47,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 63 [2023-08-30 08:37:47,606 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-08-30 08:37:47,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 76 [2023-08-30 08:37:47,624 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 08:37:47,624 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 14 treesize of output 13 [2023-08-30 08:37:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-30 08:37:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645637520] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:37:47,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:37:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 12] total 39 [2023-08-30 08:37:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667299563] [2023-08-30 08:37:47,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:37:47,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-30 08:37:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:37:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-30 08:37:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1318, Unknown=19, NotChecked=0, Total=1560 [2023-08-30 08:37:49,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:37:51,890 WARN L539 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 08:37:53,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:37:56,075 WARN L539 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 08:37:58,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:38:00,146 WARN L539 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 08:38:02,424 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 08:38:02,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 194 [2023-08-30 08:38:02,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 723 transitions, 12575 flow. Second operand has 40 states, 40 states have (on average 41.75) internal successors, (1670), 40 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:38:02,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:38:02,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 194 [2023-08-30 08:38:02,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:38:27,264 WARN L539 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 08:38:37,736 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 08:38:39,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:38:52,277 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 08:39:06,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:39:21,069 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 08:39:23,101 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 08:39:33,901 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 08:39:44,870 INFO L130 PetriNetUnfolder]: 432/1721 cut-off events. [2023-08-30 08:39:44,871 INFO L131 PetriNetUnfolder]: For 32198/32198 co-relation queries the response was YES. [2023-08-30 08:39:44,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14918 conditions, 1721 events. 432/1721 cut-off events. For 32198/32198 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9436 event pairs, 2 based on Foata normal form. 20/1740 useless extension candidates. Maximal degree in co-relation 14791. Up to 324 conditions per place. [2023-08-30 08:39:44,891 INFO L137 encePairwiseOnDemand]: 172/194 looper letters, 145 selfloop transitions, 655 changer transitions 0/802 dead transitions. [2023-08-30 08:39:44,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 802 transitions, 15498 flow [2023-08-30 08:39:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-08-30 08:39:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2023-08-30 08:39:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 4937 transitions. [2023-08-30 08:39:44,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21207044673539518 [2023-08-30 08:39:44,898 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 4937 transitions. [2023-08-30 08:39:44,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 4937 transitions. [2023-08-30 08:39:44,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:39:44,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 4937 transitions. [2023-08-30 08:39:44,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 121 states, 120 states have (on average 41.141666666666666) internal successors, (4937), 120 states have internal predecessors, (4937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:44,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 121 states, 121 states have (on average 194.0) internal successors, (23474), 121 states have internal predecessors, (23474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:44,995 INFO L81 ComplementDD]: Finished complementDD. Result has 121 states, 121 states have (on average 194.0) internal successors, (23474), 121 states have internal predecessors, (23474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:44,995 INFO L175 Difference]: Start difference. First operand has 476 places, 723 transitions, 12575 flow. Second operand 120 states and 4937 transitions. [2023-08-30 08:39:44,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 802 transitions, 15498 flow [2023-08-30 08:39:45,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 802 transitions, 14726 flow, removed 207 selfloop flow, removed 45 redundant places. [2023-08-30 08:39:45,239 INFO L231 Difference]: Finished difference. Result has 547 places, 750 transitions, 13383 flow [2023-08-30 08:39:45,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=10824, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=578, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=13383, PETRI_PLACES=547, PETRI_TRANSITIONS=750} [2023-08-30 08:39:45,240 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 511 predicate places. [2023-08-30 08:39:45,240 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 750 transitions, 13383 flow [2023-08-30 08:39:45,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 41.75) internal successors, (1670), 40 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:45,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:39:45,241 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-08-30 08:39:45,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-30 08:39:45,447 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,SelfDestructingSolverStorable16 [2023-08-30 08:39:45,447 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:39:45,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:39:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1950602482, now seen corresponding path program 1 times [2023-08-30 08:39:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:39:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789616564] [2023-08-30 08:39:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:39:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:39:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:39:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:39:45,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:39:45,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789616564] [2023-08-30 08:39:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789616564] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:39:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097881258] [2023-08-30 08:39:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:39:45,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:39:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:39:45,765 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 08:39:45,771 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 08:39:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:39:45,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-30 08:39:45,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:39:46,097 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 08:39:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:39:46,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:39:46,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:46,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:39:46,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:46,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:39:46,210 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 7 treesize of output 3 [2023-08-30 08:39:46,212 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 5 treesize of output 3 [2023-08-30 08:39:46,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:46,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:39:46,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:46,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:39:46,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:46,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:39:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:39:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097881258] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:39:46,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:39:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 17 [2023-08-30 08:39:46,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913306216] [2023-08-30 08:39:46,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:39:46,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 08:39:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:39:46,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 08:39:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-08-30 08:39:46,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 194 [2023-08-30 08:39:46,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 750 transitions, 13383 flow. Second operand has 19 states, 19 states have (on average 84.26315789473684) internal successors, (1601), 19 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:46,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:39:46,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 194 [2023-08-30 08:39:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:39:47,874 INFO L130 PetriNetUnfolder]: 470/1978 cut-off events. [2023-08-30 08:39:47,874 INFO L131 PetriNetUnfolder]: For 35311/35311 co-relation queries the response was YES. [2023-08-30 08:39:47,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17891 conditions, 1978 events. 470/1978 cut-off events. For 35311/35311 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10926 event pairs, 1 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 17772. Up to 372 conditions per place. [2023-08-30 08:39:47,894 INFO L137 encePairwiseOnDemand]: 182/194 looper letters, 753 selfloop transitions, 320 changer transitions 0/1098 dead transitions. [2023-08-30 08:39:47,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 1098 transitions, 21787 flow [2023-08-30 08:39:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-30 08:39:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-30 08:39:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3052 transitions. [2023-08-30 08:39:47,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369988545246277 [2023-08-30 08:39:47,898 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3052 transitions. [2023-08-30 08:39:47,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3052 transitions. [2023-08-30 08:39:47,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:39:47,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3052 transitions. [2023-08-30 08:39:47,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 84.77777777777777) internal successors, (3052), 36 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:47,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 194.0) internal successors, (7178), 37 states have internal predecessors, (7178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:47,908 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 194.0) internal successors, (7178), 37 states have internal predecessors, (7178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:47,908 INFO L175 Difference]: Start difference. First operand has 547 places, 750 transitions, 13383 flow. Second operand 36 states and 3052 transitions. [2023-08-30 08:39:47,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 1098 transitions, 21787 flow [2023-08-30 08:39:48,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 1098 transitions, 19415 flow, removed 430 selfloop flow, removed 70 redundant places. [2023-08-30 08:39:48,172 INFO L231 Difference]: Finished difference. Result has 511 places, 799 transitions, 13770 flow [2023-08-30 08:39:48,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=11778, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=13770, PETRI_PLACES=511, PETRI_TRANSITIONS=799} [2023-08-30 08:39:48,173 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 475 predicate places. [2023-08-30 08:39:48,174 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 799 transitions, 13770 flow [2023-08-30 08:39:48,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 84.26315789473684) internal successors, (1601), 19 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:39:48,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:39:48,174 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2023-08-30 08:39:48,181 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 08:39:48,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:39:48,375 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:39:48,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:39:48,375 INFO L85 PathProgramCache]: Analyzing trace with hash -425426083, now seen corresponding path program 2 times [2023-08-30 08:39:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:39:48,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993947206] [2023-08-30 08:39:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:39:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:39:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:39:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:39:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:39:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993947206] [2023-08-30 08:39:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993947206] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:39:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084338643] [2023-08-30 08:39:49,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:39:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:39:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:39:49,457 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 08:39:49,461 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 08:39:49,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:39:49,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:39:49,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 88 conjunts are in the unsatisfiable core [2023-08-30 08:39:49,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:39:49,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:39:49,698 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:39:49,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:39:49,732 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:39:49,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:39:49,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:39:49,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-08-30 08:39:49,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:39:49,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:39:49,963 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:39:49,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:39:50,005 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:39:50,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:39:50,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 08:39:50,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:39:50,166 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-30 08:39:50,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-30 08:39:50,209 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 08:39:50,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-08-30 08:39:50,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-08-30 08:39:50,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-08-30 08:39:50,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:39:50,415 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 08:39:50,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:39:50,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 14 treesize of output 16 [2023-08-30 08:39:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:39:50,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:39:50,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:50,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:39:50,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:50,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:39:50,606 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 62 treesize of output 54 [2023-08-30 08:39:50,614 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 50 treesize of output 48 [2023-08-30 08:39:50,617 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 48 treesize of output 46 [2023-08-30 08:39:50,620 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 46 treesize of output 44 [2023-08-30 08:39:50,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:50,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:39:52,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:39:52,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2023-08-30 08:40:21,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:40:21,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:40:21,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:40:21,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:40:21,916 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 431 treesize of output 419 [2023-08-30 08:40:21,950 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 5 treesize of output 3 [2023-08-30 08:40:21,980 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 423 treesize of output 415 [2023-08-30 08:40:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:40:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084338643] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:40:31,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 08:40:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 60 [2023-08-30 08:40:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203365498] [2023-08-30 08:40:31,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 08:40:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-08-30 08:40:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 08:40:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-08-30 08:40:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=3063, Unknown=14, NotChecked=0, Total=3782 [2023-08-30 08:40:31,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 194 [2023-08-30 08:40:31,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 799 transitions, 13770 flow. Second operand has 62 states, 62 states have (on average 47.596774193548384) internal successors, (2951), 62 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:40:31,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:40:31,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 194 [2023-08-30 08:40:31,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:40:36,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:40:42,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 08:43:16,171 INFO L130 PetriNetUnfolder]: 554/2191 cut-off events. [2023-08-30 08:43:16,171 INFO L131 PetriNetUnfolder]: For 37698/37698 co-relation queries the response was YES. [2023-08-30 08:43:16,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18196 conditions, 2191 events. 554/2191 cut-off events. For 37698/37698 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11890 event pairs, 11 based on Foata normal form. 27/2217 useless extension candidates. Maximal degree in co-relation 18095. Up to 388 conditions per place. [2023-08-30 08:43:16,191 INFO L137 encePairwiseOnDemand]: 177/194 looper letters, 870 selfloop transitions, 384 changer transitions 0/1256 dead transitions. [2023-08-30 08:43:16,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 1256 transitions, 23040 flow [2023-08-30 08:43:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-08-30 08:43:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-08-30 08:43:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 3237 transitions. [2023-08-30 08:43:16,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26071198453608246 [2023-08-30 08:43:16,196 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 3237 transitions. [2023-08-30 08:43:16,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 3237 transitions. [2023-08-30 08:43:16,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:16,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 3237 transitions. [2023-08-30 08:43:16,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 50.578125) internal successors, (3237), 64 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:16,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 194.0) internal successors, (12610), 65 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:16,209 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 194.0) internal successors, (12610), 65 states have internal predecessors, (12610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:16,209 INFO L175 Difference]: Start difference. First operand has 511 places, 799 transitions, 13770 flow. Second operand 64 states and 3237 transitions. [2023-08-30 08:43:16,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 1256 transitions, 23040 flow [2023-08-30 08:43:16,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 1256 transitions, 21911 flow, removed 73 selfloop flow, removed 24 redundant places. [2023-08-30 08:43:16,466 INFO L231 Difference]: Finished difference. Result has 562 places, 879 transitions, 15405 flow [2023-08-30 08:43:16,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=12726, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=15405, PETRI_PLACES=562, PETRI_TRANSITIONS=879} [2023-08-30 08:43:16,467 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 526 predicate places. [2023-08-30 08:43:16,467 INFO L495 AbstractCegarLoop]: Abstraction has has 562 places, 879 transitions, 15405 flow [2023-08-30 08:43:16,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 47.596774193548384) internal successors, (2951), 62 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:16,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:16,468 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 08:43:16,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-30 08:43:16,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:43:16,675 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:16,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1462893697, now seen corresponding path program 2 times [2023-08-30 08:43:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 08:43:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155492103] [2023-08-30 08:43:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 08:43:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:43:17,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 08:43:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155492103] [2023-08-30 08:43:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155492103] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 08:43:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287734607] [2023-08-30 08:43:17,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:43:17,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:43:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:43:17,936 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 08:43:17,937 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 08:43:18,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:43:18,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:43:18,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 83 conjunts are in the unsatisfiable core [2023-08-30 08:43:18,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:18,153 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-30 08:43:18,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 08:43:18,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-08-30 08:43:18,841 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 08:43:18,842 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 08:43:18,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:43:19,220 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-08-30 08:43:19,220 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 2 case distinctions, treesize of input 43 treesize of output 29 [2023-08-30 08:43:19,291 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-08-30 08:43:19,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 50 [2023-08-30 08:43:19,318 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 19 treesize of output 15 [2023-08-30 08:43:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:43:19,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:43:31,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:43:31,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2023-08-30 08:43:31,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:43:31,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:43:32,024 INFO L321 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-08-30 08:43:32,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 194 treesize of output 192 [2023-08-30 08:43:32,183 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-30 08:43:32,189 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 08:43:32,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 08:43:32,385 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:352) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-30 08:43:32,389 INFO L158 Benchmark]: Toolchain (without parser) took 568370.31ms. Allocated memory was 75.5MB in the beginning and 509.6MB in the end (delta: 434.1MB). Free memory was 51.9MB in the beginning and 125.9MB in the end (delta: -74.0MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. [2023-08-30 08:43:32,389 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 08:43:32,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.33ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 50.4MB in the end (delta: 1.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-08-30 08:43:32,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.98ms. Allocated memory is still 75.5MB. Free memory was 50.4MB in the beginning and 48.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 08:43:32,389 INFO L158 Benchmark]: Boogie Preprocessor took 51.21ms. Allocated memory is still 75.5MB. Free memory was 48.1MB in the beginning and 46.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 08:43:32,390 INFO L158 Benchmark]: RCFGBuilder took 552.99ms. Allocated memory is still 75.5MB. Free memory was 46.7MB in the beginning and 45.7MB in the end (delta: 1.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-08-30 08:43:32,390 INFO L158 Benchmark]: TraceAbstraction took 567162.45ms. Allocated memory was 75.5MB in the beginning and 509.6MB in the end (delta: 434.1MB). Free memory was 45.0MB in the beginning and 125.9MB in the end (delta: -80.9MB). Peak memory consumption was 351.4MB. Max. memory is 16.1GB. [2023-08-30 08:43:32,390 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.33ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 50.4MB in the end (delta: 1.4MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.98ms. Allocated memory is still 75.5MB. Free memory was 50.4MB in the beginning and 48.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.21ms. Allocated memory is still 75.5MB. Free memory was 48.1MB in the beginning and 46.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.99ms. Allocated memory is still 75.5MB. Free memory was 46.7MB in the beginning and 45.7MB in the end (delta: 1.0MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 567162.45ms. Allocated memory was 75.5MB in the beginning and 509.6MB in the end (delta: 434.1MB). Free memory was 45.0MB in the beginning and 125.9MB in the end (delta: -80.9MB). Peak memory consumption was 351.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 98 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 38 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 90 TotalNumberOfCompositions, 2785 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2098, independent: 1878, independent conditional: 0, independent unconditional: 1878, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1086, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2098, independent: 848, independent conditional: 0, independent unconditional: 848, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 1086, unknown conditional: 0, unknown unconditional: 1086] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-08-30 08:43:32,596 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-30 08:43:32,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 e7fe0631e7f950e2868c8cb954edca4f6de3fdffbf6debba58771511fbac2e8b --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 08:43:34,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 08:43:34,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 08:43:34,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 08:43:34,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 08:43:34,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 08:43:34,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 08:43:34,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 08:43:34,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 08:43:34,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 08:43:34,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 08:43:34,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 08:43:34,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 08:43:34,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 08:43:34,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 08:43:34,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 08:43:34,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 08:43:34,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 08:43:34,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 08:43:34,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 08:43:34,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 08:43:34,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 08:43:34,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 08:43:34,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 08:43:34,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 08:43:34,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 08:43:34,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 08:43:34,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 08:43:34,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 08:43:34,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 08:43:34,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 08:43:34,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 08:43:34,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 08:43:34,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 08:43:34,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 08:43:34,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 08:43:34,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 08:43:34,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 08:43:34,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 08:43:34,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 08:43:34,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 08:43:34,431 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-08-30 08:43:34,464 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 08:43:34,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 08:43:34,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 08:43:34,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 08:43:34,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 08:43:34,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 08:43:34,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 08:43:34,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 08:43:34,467 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 08:43:34,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 08:43:34,468 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 08:43:34,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 08:43:34,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 08:43:34,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 08:43:34,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 08:43:34,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 08:43:34,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 08:43:34,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 08:43:34,470 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 08:43:34,470 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 08:43:34,470 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 08:43:34,470 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 08:43:34,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 08:43:34,471 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 08:43:34,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 08:43:34,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 08:43:34,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 08:43:34,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 08:43:34,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:43:34,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 08:43:34,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 08:43:34,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 08:43:34,472 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 08:43:34,473 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 08:43:34,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 08:43:34,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 08:43:34,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 08:43:34,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 08:43:34,474 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 08:43:34,474 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 08:43:34,474 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 -> e7fe0631e7f950e2868c8cb954edca4f6de3fdffbf6debba58771511fbac2e8b 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 08:43:34,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 08:43:34,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 08:43:34,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 08:43:34,788 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 08:43:34,788 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 08:43:34,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-08-30 08:43:35,960 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 08:43:36,183 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 08:43:36,184 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-08-30 08:43:36,199 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/757e09952/34e1536e2dad451695b894b21bc97f98/FLAG5587128a5 [2023-08-30 08:43:36,211 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/757e09952/34e1536e2dad451695b894b21bc97f98 [2023-08-30 08:43:36,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 08:43:36,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 08:43:36,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 08:43:36,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 08:43:36,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 08:43:36,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb962e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36, skipping insertion in model container [2023-08-30 08:43:36,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 08:43:36,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 08:43:36,543 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-08-30 08:43:36,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:43:36,559 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 08:43:36,611 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-08-30 08:43:36,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 08:43:36,653 INFO L208 MainTranslator]: Completed translation [2023-08-30 08:43:36,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36 WrapperNode [2023-08-30 08:43:36,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 08:43:36,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 08:43:36,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 08:43:36,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 08:43:36,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,705 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2023-08-30 08:43:36,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 08:43:36,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 08:43:36,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 08:43:36,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 08:43:36,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,729 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 08:43:36,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 08:43:36,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 08:43:36,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 08:43:36,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (1/1) ... [2023-08-30 08:43:36,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 08:43:36,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 08:43:36,767 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 08:43:36,781 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 08:43:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 08:43:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 08:43:36,800 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 08:43:36,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 08:43:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 08:43:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 08:43:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 08:43:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 08:43:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 08:43:36,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 08:43:36,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 08:43:36,803 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 08:43:36,934 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 08:43:36,939 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 08:43:37,196 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 08:43:37,330 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 08:43:37,330 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 08:43:37,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:43:37 BoogieIcfgContainer [2023-08-30 08:43:37,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 08:43:37,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 08:43:37,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 08:43:37,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 08:43:37,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:43:36" (1/3) ... [2023-08-30 08:43:37,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2c57f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:43:37, skipping insertion in model container [2023-08-30 08:43:37,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:43:36" (2/3) ... [2023-08-30 08:43:37,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2c57f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:43:37, skipping insertion in model container [2023-08-30 08:43:37,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:43:37" (3/3) ... [2023-08-30 08:43:37,339 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-08-30 08:43:37,346 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 08:43:37,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 08:43:37,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-30 08:43:37,353 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 08:43:37,427 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 08:43:37,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 105 transitions, 215 flow [2023-08-30 08:43:37,526 INFO L130 PetriNetUnfolder]: 10/115 cut-off events. [2023-08-30 08:43:37,527 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:43:37,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 10/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2023-08-30 08:43:37,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 105 transitions, 215 flow [2023-08-30 08:43:37,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 105 transitions, 215 flow [2023-08-30 08:43:37,546 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 08:43:37,557 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 105 transitions, 215 flow [2023-08-30 08:43:37,559 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 105 transitions, 215 flow [2023-08-30 08:43:37,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 105 transitions, 215 flow [2023-08-30 08:43:37,580 INFO L130 PetriNetUnfolder]: 10/115 cut-off events. [2023-08-30 08:43:37,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:43:37,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 10/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2023-08-30 08:43:37,587 INFO L119 LiptonReduction]: Number of co-enabled transitions 1950 [2023-08-30 08:43:39,828 INFO L134 LiptonReduction]: Checked pairs total: 2665 [2023-08-30 08:43:39,828 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-30 08:43:39,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 08:43:39,844 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;@62e0d659, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 08:43:39,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-08-30 08:43:39,849 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 08:43:39,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:43:39,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:39,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 08:43:39,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:39,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 500231312, now seen corresponding path program 1 times [2023-08-30 08:43:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:39,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315865781] [2023-08-30 08:43:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:39,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:39,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:39,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:39,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 08:43:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:39,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 08:43:39,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:39,985 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 08:43:39,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:43:39,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315865781] [2023-08-30 08:43:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315865781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:43:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:43:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 08:43:39,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544260874] [2023-08-30 08:43:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:43:39,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 08:43:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 08:43:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 08:43:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 08:43:40,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-30 08:43:40,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 77 flow. Second operand has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:43:40,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-30 08:43:40,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:43:40,139 INFO L130 PetriNetUnfolder]: 38/94 cut-off events. [2023-08-30 08:43:40,139 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:43:40,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 94 events. 38/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 29 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 171. Up to 88 conditions per place. [2023-08-30 08:43:40,141 INFO L137 encePairwiseOnDemand]: 186/197 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-30 08:43:40,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 97 flow [2023-08-30 08:43:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 08:43:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 08:43:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-08-30 08:43:40,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076142131979695 [2023-08-30 08:43:40,156 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-08-30 08:43:40,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-08-30 08:43:40,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:40,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-08-30 08:43:40,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,169 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,171 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 77 flow. Second operand 2 states and 200 transitions. [2023-08-30 08:43:40,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 97 flow [2023-08-30 08:43:40,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 97 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 08:43:40,179 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 55 flow [2023-08-30 08:43:40,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=55, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2023-08-30 08:43:40,184 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -9 predicate places. [2023-08-30 08:43:40,184 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 55 flow [2023-08-30 08:43:40,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:40,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 08:43:40,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:40,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:40,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:40,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1672698631, now seen corresponding path program 1 times [2023-08-30 08:43:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126758455] [2023-08-30 08:43:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:40,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:40,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 08:43:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:40,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 08:43:40,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:40,476 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 08:43:40,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:43:40,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:40,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126758455] [2023-08-30 08:43:40,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126758455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:43:40,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:43:40,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 08:43:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287666956] [2023-08-30 08:43:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:43:40,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 08:43:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 08:43:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 08:43:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 08:43:40,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-30 08:43:40,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:43:40,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-30 08:43:40,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:43:40,565 INFO L130 PetriNetUnfolder]: 41/104 cut-off events. [2023-08-30 08:43:40,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 08:43:40,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 104 events. 41/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs, 2 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 202. Up to 85 conditions per place. [2023-08-30 08:43:40,569 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-30 08:43:40,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 113 flow [2023-08-30 08:43:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 08:43:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 08:43:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-30 08:43:40,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653130287648054 [2023-08-30 08:43:40,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-30 08:43:40,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-30 08:43:40,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:40,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-30 08:43:40,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,584 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 55 flow. Second operand 3 states and 275 transitions. [2023-08-30 08:43:40,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 113 flow [2023-08-30 08:43:40,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 113 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 08:43:40,586 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 67 flow [2023-08-30 08:43:40,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2023-08-30 08:43:40,587 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -6 predicate places. [2023-08-30 08:43:40,587 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 67 flow [2023-08-30 08:43:40,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:40,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:40,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:43:40,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:40,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:40,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:40,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1493920563, now seen corresponding path program 1 times [2023-08-30 08:43:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961889060] [2023-08-30 08:43:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:40,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:40,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:40,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:40,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 08:43:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:40,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 08:43:40,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:41,026 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 08:43:41,043 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 08:43:41,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:43:41,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961889060] [2023-08-30 08:43:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961889060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:43:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:43:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 08:43:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15294014] [2023-08-30 08:43:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:43:41,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 08:43:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 08:43:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 08:43:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 08:43:41,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-30 08:43:41,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:41,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:43:41,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-30 08:43:41,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:43:41,215 INFO L130 PetriNetUnfolder]: 53/142 cut-off events. [2023-08-30 08:43:41,215 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 08:43:41,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 142 events. 53/142 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 351 event pairs, 2 based on Foata normal form. 3/137 useless extension candidates. Maximal degree in co-relation 289. Up to 91 conditions per place. [2023-08-30 08:43:41,216 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 29 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-08-30 08:43:41,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 155 flow [2023-08-30 08:43:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 08:43:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 08:43:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-30 08:43:41,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403553299492386 [2023-08-30 08:43:41,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-30 08:43:41,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-30 08:43:41,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:41,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-30 08:43:41,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:41,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:41,222 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:41,222 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 67 flow. Second operand 4 states and 347 transitions. [2023-08-30 08:43:41,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 155 flow [2023-08-30 08:43:41,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:43:41,223 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 88 flow [2023-08-30 08:43:41,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-30 08:43:41,224 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2023-08-30 08:43:41,224 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 88 flow [2023-08-30 08:43:41,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:41,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:41,225 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:43:41,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:41,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:41,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:41,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash 863773358, now seen corresponding path program 1 times [2023-08-30 08:43:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:41,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99380683] [2023-08-30 08:43:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:41,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:41,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:41,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:41,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 08:43:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:41,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 08:43:41,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:41,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-08-30 08:43:41,598 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 08:43:41,598 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 13 treesize of output 13 [2023-08-30 08:43:41,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 08:43:41,736 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 08:43:41,749 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 08:43:41,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:43:41,777 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_48 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (bvadd ((_ sign_extend 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_48) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (_ bv1 33)) (_ bv2147483647 33))) is different from false [2023-08-30 08:43:41,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:43:41,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 71 [2023-08-30 08:43:41,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:43:41,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:43:41,978 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 71 treesize of output 59 [2023-08-30 08:43:41,995 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 8 treesize of output 6 [2023-08-30 08:43:42,005 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 8 treesize of output 6 [2023-08-30 08:43:42,016 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 51 treesize of output 43 [2023-08-30 08:43:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 08:43:42,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99380683] [2023-08-30 08:43:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99380683] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 08:43:42,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-30 08:43:42,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-30 08:43:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638853185] [2023-08-30 08:43:42,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-30 08:43:42,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 08:43:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 08:43:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 08:43:42,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2023-08-30 08:43:42,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 197 [2023-08-30 08:43:42,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 88 flow. Second operand has 10 states, 10 states have (on average 57.6) internal successors, (576), 10 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:42,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:43:42,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 197 [2023-08-30 08:43:42,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:43:42,869 INFO L130 PetriNetUnfolder]: 89/231 cut-off events. [2023-08-30 08:43:42,869 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-08-30 08:43:42,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 231 events. 89/231 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 591 event pairs, 6 based on Foata normal form. 5/229 useless extension candidates. Maximal degree in co-relation 550. Up to 84 conditions per place. [2023-08-30 08:43:42,871 INFO L137 encePairwiseOnDemand]: 189/197 looper letters, 52 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2023-08-30 08:43:42,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 302 flow [2023-08-30 08:43:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 08:43:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 08:43:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 449 transitions. [2023-08-30 08:43:42,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255982596084119 [2023-08-30 08:43:42,874 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 449 transitions. [2023-08-30 08:43:42,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 449 transitions. [2023-08-30 08:43:42,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:42,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 449 transitions. [2023-08-30 08:43:42,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 64.14285714285714) internal successors, (449), 7 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:42,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:42,879 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:42,879 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 88 flow. Second operand 7 states and 449 transitions. [2023-08-30 08:43:42,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 64 transitions, 302 flow [2023-08-30 08:43:42,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 08:43:42,881 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 159 flow [2023-08-30 08:43:42,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-30 08:43:42,882 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-08-30 08:43:42,882 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 159 flow [2023-08-30 08:43:42,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 57.6) internal successors, (576), 10 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:42,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:42,883 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:43:42,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:43,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:43,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:43,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1945512995, now seen corresponding path program 1 times [2023-08-30 08:43:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:43,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276736265] [2023-08-30 08:43:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:43,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:43,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 08:43:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:43,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 08:43:43,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:43,273 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-30 08:43:43,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-08-30 08:43:43,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:43:43,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:43:43,342 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 5 treesize of output 3 [2023-08-30 08:43:43,372 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-08-30 08:43:43,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 19 [2023-08-30 08:43:43,382 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 5 treesize of output 3 [2023-08-30 08:43:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:43:43,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:43:43,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276736265] [2023-08-30 08:43:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276736265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:43:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:43:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 08:43:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829469147] [2023-08-30 08:43:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:43:43,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 08:43:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 08:43:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 08:43:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 08:43:43,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 197 [2023-08-30 08:43:43,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:43,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:43:43,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 197 [2023-08-30 08:43:43,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:43:43,694 INFO L130 PetriNetUnfolder]: 61/201 cut-off events. [2023-08-30 08:43:43,695 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-30 08:43:43,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 201 events. 61/201 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs, 23 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 553. Up to 109 conditions per place. [2023-08-30 08:43:43,696 INFO L137 encePairwiseOnDemand]: 190/197 looper letters, 36 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2023-08-30 08:43:43,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 337 flow [2023-08-30 08:43:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 08:43:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 08:43:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2023-08-30 08:43:43,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131979695431472 [2023-08-30 08:43:43,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 407 transitions. [2023-08-30 08:43:43,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 407 transitions. [2023-08-30 08:43:43,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:43,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 407 transitions. [2023-08-30 08:43:43,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:43,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:43,702 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:43,702 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 159 flow. Second operand 5 states and 407 transitions. [2023-08-30 08:43:43,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 337 flow [2023-08-30 08:43:43,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 08:43:43,706 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 278 flow [2023-08-30 08:43:43,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-30 08:43:43,707 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-08-30 08:43:43,707 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 278 flow [2023-08-30 08:43:43,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:43,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:43,707 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:43:43,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:43,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:43,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:43,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash 20018494, now seen corresponding path program 1 times [2023-08-30 08:43:43,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801101736] [2023-08-30 08:43:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 08:43:43,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:43,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:43,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:43,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 08:43:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 08:43:44,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 08:43:44,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:44,031 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 08:43:44,031 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 13 treesize of output 13 [2023-08-30 08:43:44,134 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 08:43:44,221 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-30 08:43:44,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-08-30 08:43:44,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:43:44,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-30 08:43:44,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-30 08:43:44,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-08-30 08:43:44,289 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 5 treesize of output 3 [2023-08-30 08:43:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:43:44,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 08:43:44,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:44,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801101736] [2023-08-30 08:43:44,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801101736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 08:43:44,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 08:43:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 08:43:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161561495] [2023-08-30 08:43:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 08:43:44,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 08:43:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 08:43:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 08:43:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 08:43:44,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 197 [2023-08-30 08:43:44,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:44,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 08:43:44,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 197 [2023-08-30 08:43:44,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 08:43:44,694 INFO L130 PetriNetUnfolder]: 61/212 cut-off events. [2023-08-30 08:43:44,694 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2023-08-30 08:43:44,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 212 events. 61/212 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 25 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 682. Up to 96 conditions per place. [2023-08-30 08:43:44,696 INFO L137 encePairwiseOnDemand]: 189/197 looper letters, 34 selfloop transitions, 15 changer transitions 0/52 dead transitions. [2023-08-30 08:43:44,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 400 flow [2023-08-30 08:43:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 08:43:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 08:43:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 459 transitions. [2023-08-30 08:43:44,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3883248730964467 [2023-08-30 08:43:44,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 459 transitions. [2023-08-30 08:43:44,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 459 transitions. [2023-08-30 08:43:44,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 08:43:44,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 459 transitions. [2023-08-30 08:43:44,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:44,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:44,710 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:44,711 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 278 flow. Second operand 6 states and 459 transitions. [2023-08-30 08:43:44,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 400 flow [2023-08-30 08:43:44,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 396 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-30 08:43:44,717 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 321 flow [2023-08-30 08:43:44,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-30 08:43:44,720 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2023-08-30 08:43:44,720 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 321 flow [2023-08-30 08:43:44,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 08:43:44,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 08:43:44,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 08:43:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:44,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:44,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-30 08:43:44,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 08:43:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash -53267366, now seen corresponding path program 2 times [2023-08-30 08:43:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 08:43:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197916103] [2023-08-30 08:43:44,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 08:43:44,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 08:43:44,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 08:43:44,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 08:43:45,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 08:43:45,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 08:43:45,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 08:43:45,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 08:43:45,061 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 08:43:45,061 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 13 treesize of output 13 [2023-08-30 08:43:45,204 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 08:43:45,530 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-08-30 08:43:45,530 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 2 case distinctions, treesize of input 35 treesize of output 25 [2023-08-30 08:43:45,617 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-08-30 08:43:45,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 52 [2023-08-30 08:43:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 08:43:45,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 08:43:46,894 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_140))) (or (bvsle (bvadd ((_ sign_extend 1) (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)) (_ bv1 33)) (_ bv2147483647 33)) (not (= (_ bv0 32) (select (select .cse0 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|)))))) .cse1) (or (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_ArrVal_140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_140))) (or (not (= (select (select .cse2 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) (_ bv0 32))) (bvsle (bvadd (_ bv1 33) ((_ sign_extend 1) (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) (_ bv2147483647 33))))) (not .cse1))))) is different from false [2023-08-30 08:43:47,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:43:47,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 71 [2023-08-30 08:43:47,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 08:43:47,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-08-30 08:43:49,204 INFO L321 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-08-30 08:43:49,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 207 treesize of output 205 [2023-08-30 08:43:49,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 08:43:49,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197916103] [2023-08-30 08:43:49,568 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-30 08:43:49,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 08:43:49,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 08:43:49,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:352) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-30 08:43:49,773 INFO L158 Benchmark]: Toolchain (without parser) took 13559.41ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 52.2MB in the beginning and 102.5MB in the end (delta: -50.3MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2023-08-30 08:43:49,774 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 08:43:49,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.20ms. Allocated memory is still 77.6MB. Free memory was 52.0MB in the beginning and 49.8MB in the end (delta: 2.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 08:43:49,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.68ms. Allocated memory is still 77.6MB. Free memory was 49.8MB in the beginning and 47.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 08:43:49,775 INFO L158 Benchmark]: Boogie Preprocessor took 26.29ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 45.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 08:43:49,775 INFO L158 Benchmark]: RCFGBuilder took 597.47ms. Allocated memory is still 77.6MB. Free memory was 45.7MB in the beginning and 46.6MB in the end (delta: -915.9kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-08-30 08:43:49,776 INFO L158 Benchmark]: TraceAbstraction took 12439.00ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 46.1MB in the beginning and 102.5MB in the end (delta: -56.4MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2023-08-30 08:43:49,778 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.20ms. Allocated memory is still 77.6MB. Free memory was 52.0MB in the beginning and 49.8MB in the end (delta: 2.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.68ms. Allocated memory is still 77.6MB. Free memory was 49.8MB in the beginning and 47.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.29ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 45.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 597.47ms. Allocated memory is still 77.6MB. Free memory was 45.7MB in the beginning and 46.6MB in the end (delta: -915.9kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12439.00ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 46.1MB in the beginning and 102.5MB in the end (delta: -56.4MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 99 PlacesBefore, 35 PlacesAfterwards, 105 TransitionsBefore, 36 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 5 FixpointIterations, 15 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 92 TotalNumberOfCompositions, 2665 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2017, independent: 1834, independent conditional: 0, independent unconditional: 1834, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1045, independent: 1002, independent conditional: 0, independent unconditional: 1002, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2017, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1045, unknown conditional: 0, unknown unconditional: 1045] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-08-30 08:43:49,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index