/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 00:09:07,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 00:09:07,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 00:09:07,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 00:09:07,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 00:09:07,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 00:09:07,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 00:09:07,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 00:09:07,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 00:09:07,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 00:09:07,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 00:09:07,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 00:09:07,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 00:09:07,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 00:09:07,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 00:09:07,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 00:09:07,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 00:09:07,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 00:09:07,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 00:09:07,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 00:09:07,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 00:09:07,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 00:09:07,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 00:09:07,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 00:09:07,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 00:09:07,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 00:09:07,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 00:09:07,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 00:09:07,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 00:09:07,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 00:09:07,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 00:09:07,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 00:09:07,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 00:09:07,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 00:09:07,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 00:09:07,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 00:09:07,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 00:09:07,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 00:09:07,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 00:09:07,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 00:09:07,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 00:09:07,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 00:09:07,649 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 00:09:07,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 00:09:07,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 00:09:07,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 00:09:07,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 00:09:07,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 00:09:07,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 00:09:07,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 00:09:07,652 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 00:09:07,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 00:09:07,653 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 00:09:07,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 00:09:07,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 00:09:07,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 00:09:07,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 00:09:07,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 00:09:07,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 00:09:07,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:09:07,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 00:09:07,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 00:09:07,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 00:09:07,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 00:09:07,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 00:09:07,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 00:09:07,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 00:09:07,656 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 00:09:07,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 00:09:07,656 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 00:09:07,656 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 [2023-03-31 00:09:07,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 00:09:07,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 00:09:07,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 00:09:07,889 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 00:09:07,890 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 00:09:07,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-03-31 00:09:09,248 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 00:09:09,504 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 00:09:09,505 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-03-31 00:09:09,517 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81b51235/cabc6995feff4a51a424f729374a37d6/FLAGcd3e4860d [2023-03-31 00:09:09,530 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f81b51235/cabc6995feff4a51a424f729374a37d6 [2023-03-31 00:09:09,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 00:09:09,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 00:09:09,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 00:09:09,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 00:09:09,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 00:09:09,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176c67bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09, skipping insertion in model container [2023-03-31 00:09:09,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 00:09:09,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 00:09:09,803 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-03-31 00:09:09,819 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-03-31 00:09:09,821 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-03-31 00:09:09,823 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-03-31 00:09:09,826 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-03-31 00:09:09,830 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-03-31 00:09:09,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:09:09,850 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 00:09:09,884 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-03-31 00:09:09,886 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-03-31 00:09:09,887 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-03-31 00:09:09,888 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-03-31 00:09:09,889 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-03-31 00:09:09,890 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-03-31 00:09:09,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:09:09,915 INFO L208 MainTranslator]: Completed translation [2023-03-31 00:09:09,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09 WrapperNode [2023-03-31 00:09:09,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 00:09:09,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 00:09:09,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 00:09:09,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 00:09:09,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,965 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 00:09:09,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 00:09:09,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 00:09:09,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 00:09:09,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (1/1) ... [2023-03-31 00:09:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:09:09,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:10,012 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-03-31 00:09:10,018 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-03-31 00:09:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 00:09:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 00:09:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 00:09:10,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-03-31 00:09:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-03-31 00:09:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-03-31 00:09:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-03-31 00:09:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-03-31 00:09:10,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-03-31 00:09:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-03-31 00:09:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-03-31 00:09:10,050 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-03-31 00:09:10,051 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-03-31 00:09:10,052 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-03-31 00:09:10,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 00:09:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-03-31 00:09:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 00:09:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 00:09:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 00:09:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 00:09:10,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 00:09:10,285 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 00:09:10,287 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 00:09:10,539 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 00:09:10,548 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 00:09:10,548 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-03-31 00:09:10,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:09:10 BoogieIcfgContainer [2023-03-31 00:09:10,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 00:09:10,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 00:09:10,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 00:09:10,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 00:09:10,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 12:09:09" (1/3) ... [2023-03-31 00:09:10,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338ac0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:09:10, skipping insertion in model container [2023-03-31 00:09:10,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:09:09" (2/3) ... [2023-03-31 00:09:10,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338ac0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:09:10, skipping insertion in model container [2023-03-31 00:09:10,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:09:10" (3/3) ... [2023-03-31 00:09:10,560 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-03-31 00:09:10,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 00:09:10,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-03-31 00:09:10,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 00:09:10,653 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;@3e0bae2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 00:09:10,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-03-31 00:09:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 44 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-31 00:09:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-03-31 00:09:10,668 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:10,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:10,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:10,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 364969828, now seen corresponding path program 1 times [2023-03-31 00:09:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660884340] [2023-03-31 00:09:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660884340] [2023-03-31 00:09:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660884340] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:10,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-31 00:09:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236321493] [2023-03-31 00:09:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:11,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 00:09:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 00:09:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 00:09:11,052 INFO L87 Difference]: Start difference. First operand has 49 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 44 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:11,178 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2023-03-31 00:09:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 00:09:11,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-03-31 00:09:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:11,201 INFO L225 Difference]: With dead ends: 92 [2023-03-31 00:09:11,201 INFO L226 Difference]: Without dead ends: 43 [2023-03-31 00:09:11,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 00:09:11,208 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:11,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 10 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-03-31 00:09:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-03-31 00:09:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 39 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2023-03-31 00:09:11,265 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2023-03-31 00:09:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:11,266 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2023-03-31 00:09:11,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2023-03-31 00:09:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-03-31 00:09:11,269 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:11,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:11,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 00:09:11,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:11,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:11,271 INFO L85 PathProgramCache]: Analyzing trace with hash 364203207, now seen corresponding path program 1 times [2023-03-31 00:09:11,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:11,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074979664] [2023-03-31 00:09:11,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:11,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:11,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074979664] [2023-03-31 00:09:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074979664] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 00:09:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169442611] [2023-03-31 00:09:11,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:11,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:09:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:11,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:09:11,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:09:11,681 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:11,830 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2023-03-31 00:09:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:09:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-03-31 00:09:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:11,833 INFO L225 Difference]: With dead ends: 43 [2023-03-31 00:09:11,833 INFO L226 Difference]: Without dead ends: 41 [2023-03-31 00:09:11,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:09:11,835 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:11,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 16 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-03-31 00:09:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-03-31 00:09:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2023-03-31 00:09:11,849 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2023-03-31 00:09:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:11,850 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2023-03-31 00:09:11,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2023-03-31 00:09:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-03-31 00:09:11,851 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:11,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:11,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 00:09:11,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:11,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1594645978, now seen corresponding path program 1 times [2023-03-31 00:09:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382088150] [2023-03-31 00:09:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:12,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:12,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382088150] [2023-03-31 00:09:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382088150] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:12,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:12,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 00:09:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319790579] [2023-03-31 00:09:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:12,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:09:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:12,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:09:12,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:09:12,073 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:12,221 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2023-03-31 00:09:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 00:09:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-03-31 00:09:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:12,225 INFO L225 Difference]: With dead ends: 67 [2023-03-31 00:09:12,226 INFO L226 Difference]: Without dead ends: 65 [2023-03-31 00:09:12,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 00:09:12,229 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:12,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 17 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-03-31 00:09:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2023-03-31 00:09:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-03-31 00:09:12,272 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2023-03-31 00:09:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:12,272 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-03-31 00:09:12,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-03-31 00:09:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-03-31 00:09:12,273 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:12,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:12,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 00:09:12,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:12,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1812212429, now seen corresponding path program 1 times [2023-03-31 00:09:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087154265] [2023-03-31 00:09:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:12,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087154265] [2023-03-31 00:09:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087154265] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:12,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:12,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 00:09:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614645737] [2023-03-31 00:09:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:12,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:09:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:09:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:09:12,455 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:12,622 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-03-31 00:09:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:09:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-03-31 00:09:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:12,624 INFO L225 Difference]: With dead ends: 39 [2023-03-31 00:09:12,624 INFO L226 Difference]: Without dead ends: 37 [2023-03-31 00:09:12,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-03-31 00:09:12,630 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:12,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-03-31 00:09:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-03-31 00:09:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-03-31 00:09:12,643 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2023-03-31 00:09:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:12,643 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-03-31 00:09:12,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-03-31 00:09:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-03-31 00:09:12,644 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:12,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:12,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 00:09:12,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:12,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1812174693, now seen corresponding path program 1 times [2023-03-31 00:09:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992656679] [2023-03-31 00:09:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:13,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992656679] [2023-03-31 00:09:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992656679] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 00:09:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157997664] [2023-03-31 00:09:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:09:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:09:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:09:13,570 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:13,772 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2023-03-31 00:09:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:09:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-03-31 00:09:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:13,774 INFO L225 Difference]: With dead ends: 72 [2023-03-31 00:09:13,774 INFO L226 Difference]: Without dead ends: 48 [2023-03-31 00:09:13,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-03-31 00:09:13,776 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 58 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:13,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 20 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-03-31 00:09:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2023-03-31 00:09:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2023-03-31 00:09:13,785 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2023-03-31 00:09:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:13,785 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2023-03-31 00:09:13,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2023-03-31 00:09:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-03-31 00:09:13,790 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:13,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:13,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 00:09:13,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:13,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash -499005925, now seen corresponding path program 1 times [2023-03-31 00:09:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:13,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651122124] [2023-03-31 00:09:13,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651122124] [2023-03-31 00:09:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651122124] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-03-31 00:09:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345428474] [2023-03-31 00:09:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:15,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 00:09:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 00:09:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-03-31 00:09:15,875 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:16,094 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-03-31 00:09:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 00:09:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-03-31 00:09:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:16,096 INFO L225 Difference]: With dead ends: 54 [2023-03-31 00:09:16,096 INFO L226 Difference]: Without dead ends: 52 [2023-03-31 00:09:16,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-03-31 00:09:16,097 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 60 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:16,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 24 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:09:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-03-31 00:09:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-03-31 00:09:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-03-31 00:09:16,108 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2023-03-31 00:09:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:16,108 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-03-31 00:09:16,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-03-31 00:09:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-03-31 00:09:16,110 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:16,110 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:16,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 00:09:16,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:16,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -834365180, now seen corresponding path program 1 times [2023-03-31 00:09:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401591883] [2023-03-31 00:09:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401591883] [2023-03-31 00:09:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401591883] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706363203] [2023-03-31 00:09:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:17,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:17,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:17,230 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-03-31 00:09:17,254 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-03-31 00:09:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:17,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 47 conjunts are in the unsatisfiable core [2023-03-31 00:09:17,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:09:17,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 00:09:17,616 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-03-31 00:09:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:17,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-03-31 00:09:17,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-03-31 00:09:17,705 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 63 treesize of output 39 [2023-03-31 00:09:17,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:17,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:17,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:09:17,717 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 17 treesize of output 16 [2023-03-31 00:09:17,725 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 18 treesize of output 16 [2023-03-31 00:09:17,741 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-31 00:09:17,742 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-03-31 00:09:17,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:17,882 INFO L321 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2023-03-31 00:09:17,882 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 3 case distinctions, treesize of input 35 treesize of output 36 [2023-03-31 00:09:17,903 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-03-31 00:09:17,904 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-03-31 00:09:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:17,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:09:17,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:17,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-03-31 00:09:17,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 71 treesize of output 51 [2023-03-31 00:09:17,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-03-31 00:09:18,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:18,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 139 [2023-03-31 00:09:18,414 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 284 treesize of output 220 [2023-03-31 00:09:18,422 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 181 treesize of output 173 [2023-03-31 00:09:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706363203] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:09:22,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:09:22,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2023-03-31 00:09:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589074951] [2023-03-31 00:09:22,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:09:22,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 00:09:22,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 00:09:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2023-03-31 00:09:22,031 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:22,565 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2023-03-31 00:09:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:09:22,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-03-31 00:09:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:22,567 INFO L225 Difference]: With dead ends: 62 [2023-03-31 00:09:22,567 INFO L226 Difference]: Without dead ends: 60 [2023-03-31 00:09:22,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=57, Invalid=152, Unknown=1, NotChecked=0, Total=210 [2023-03-31 00:09:22,568 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 93 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:22,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 36 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-03-31 00:09:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-03-31 00:09:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2023-03-31 00:09:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-03-31 00:09:22,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2023-03-31 00:09:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:22,576 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-03-31 00:09:22,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-03-31 00:09:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 00:09:22,578 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:22,578 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:22,598 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-03-31 00:09:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:22,779 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:22,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1656330756, now seen corresponding path program 1 times [2023-03-31 00:09:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602990674] [2023-03-31 00:09:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:24,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602990674] [2023-03-31 00:09:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602990674] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:24,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468768879] [2023-03-31 00:09:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:24,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:24,004 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-03-31 00:09:24,006 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-03-31 00:09:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:24,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 48 conjunts are in the unsatisfiable core [2023-03-31 00:09:24,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:09:24,256 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-03-31 00:09:24,261 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-03-31 00:09:24,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:24,307 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-03-31 00:09:24,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-03-31 00:09:24,322 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 63 treesize of output 39 [2023-03-31 00:09:24,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:24,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:24,329 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:09:24,330 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 17 treesize of output 16 [2023-03-31 00:09:24,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 18 treesize of output 16 [2023-03-31 00:09:24,354 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-31 00:09:24,355 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-03-31 00:09:24,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:24,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:24,449 INFO L321 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2023-03-31 00:09:24,450 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 3 case distinctions, treesize of input 35 treesize of output 36 [2023-03-31 00:09:24,461 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-03-31 00:09:24,462 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-03-31 00:09:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:24,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:09:24,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:24,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-03-31 00:09:24,520 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 74 treesize of output 54 [2023-03-31 00:09:24,523 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 47 treesize of output 45 [2023-03-31 00:09:24,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:24,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 70 [2023-03-31 00:09:24,664 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 129 treesize of output 97 [2023-03-31 00:09:24,668 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 90 treesize of output 86 [2023-03-31 00:09:30,989 WARN L223 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 61 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-03-31 00:09:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468768879] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:09:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 6] total 14 [2023-03-31 00:09:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183447166] [2023-03-31 00:09:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-03-31 00:09:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:31,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-03-31 00:09:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2023-03-31 00:09:31,061 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:33,276 WARN L539 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-03-31 00:09:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:34,322 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-03-31 00:09:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 00:09:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-03-31 00:09:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:34,323 INFO L225 Difference]: With dead ends: 72 [2023-03-31 00:09:34,323 INFO L226 Difference]: Without dead ends: 56 [2023-03-31 00:09:34,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=54, Invalid=217, Unknown=1, NotChecked=0, Total=272 [2023-03-31 00:09:34,324 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:34,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 115 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-03-31 00:09:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-03-31 00:09:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-03-31 00:09:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2023-03-31 00:09:34,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2023-03-31 00:09:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:34,332 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2023-03-31 00:09:34,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2023-03-31 00:09:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-03-31 00:09:34,333 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:34,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:34,355 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-03-31 00:09:34,541 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,SelfDestructingSolverStorable7 [2023-03-31 00:09:34,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:34,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 183709644, now seen corresponding path program 1 times [2023-03-31 00:09:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659409916] [2023-03-31 00:09:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659409916] [2023-03-31 00:09:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659409916] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:09:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:09:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 00:09:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948595725] [2023-03-31 00:09:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:09:34,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:09:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:09:34,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:09:34,635 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:34,785 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-03-31 00:09:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:09:34,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-03-31 00:09:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:34,786 INFO L225 Difference]: With dead ends: 54 [2023-03-31 00:09:34,786 INFO L226 Difference]: Without dead ends: 35 [2023-03-31 00:09:34,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-03-31 00:09:34,787 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:34,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 20 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-03-31 00:09:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-03-31 00:09:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-03-31 00:09:34,793 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 26 [2023-03-31 00:09:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:34,794 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-03-31 00:09:34,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-03-31 00:09:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-03-31 00:09:34,794 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:34,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:34,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 00:09:34,795 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:34,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:34,795 INFO L85 PathProgramCache]: Analyzing trace with hash 601446547, now seen corresponding path program 1 times [2023-03-31 00:09:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:34,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697050687] [2023-03-31 00:09:34,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697050687] [2023-03-31 00:09:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697050687] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434277512] [2023-03-31 00:09:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:38,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:38,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:38,633 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-03-31 00:09:38,646 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-03-31 00:09:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:38,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 90 conjunts are in the unsatisfiable core [2023-03-31 00:09:38,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:09:38,914 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-03-31 00:09:38,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-03-31 00:09:38,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-03-31 00:09:38,973 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-03-31 00:09:38,974 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 2 case distinctions, treesize of input 90 treesize of output 78 [2023-03-31 00:09:38,980 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-03-31 00:09:38,999 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-03-31 00:09:38,999 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 25 treesize of output 29 [2023-03-31 00:09:39,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:39,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:39,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:09:39,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2023-03-31 00:09:39,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:39,249 INFO L321 Elim1Store]: treesize reduction 117, result has 25.0 percent of original size [2023-03-31 00:09:39,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 201 treesize of output 237 [2023-03-31 00:09:39,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:39,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:39,297 INFO L321 Elim1Store]: treesize reduction 55, result has 38.2 percent of original size [2023-03-31 00:09:39,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 140 [2023-03-31 00:09:39,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2023-03-31 00:09:39,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:39,354 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-03-31 00:09:39,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 79 [2023-03-31 00:09:39,378 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 35 treesize of output 37 [2023-03-31 00:09:39,417 INFO L321 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-03-31 00:09:39,417 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 28 treesize of output 38 [2023-03-31 00:09:39,440 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 93 treesize of output 87 [2023-03-31 00:09:39,463 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 279 treesize of output 267 [2023-03-31 00:09:39,491 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 276 treesize of output 264 [2023-03-31 00:09:39,502 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 82 treesize of output 84 [2023-03-31 00:09:39,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:09:39,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 00:09:39,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2023-03-31 00:09:39,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-03-31 00:09:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:39,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:09:39,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:39,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2023-03-31 00:09:39,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:39,797 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 86 treesize of output 81 [2023-03-31 00:09:39,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:39,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 900 treesize of output 836 [2023-03-31 00:09:39,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:39,827 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 406 treesize of output 400 [2023-03-31 00:09:39,838 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 149 treesize of output 118 [2023-03-31 00:09:39,856 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 179 treesize of output 117 [2023-03-31 00:09:39,951 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-03-31 00:09:39,957 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-03-31 00:09:40,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:40,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 458 [2023-03-31 00:09:40,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:40,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 449 treesize of output 338 [2023-03-31 00:09:40,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:40,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14238 treesize of output 10105 [2023-03-31 00:09:40,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:40,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32711 treesize of output 30342 [2023-03-31 00:09:41,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 3706 treesize of output 3702 [2023-03-31 00:09:41,452 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 3702 treesize of output 3386 [2023-03-31 00:09:41,527 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 3386 treesize of output 3222 [2023-03-31 00:09:41,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:41,604 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 3222 treesize of output 3231 [2023-03-31 00:09:41,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:41,661 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 3206 treesize of output 3203 [2023-03-31 00:09:41,706 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 3194 treesize of output 3158 [2023-03-31 00:09:41,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:41,769 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 3158 treesize of output 3135 [2023-03-31 00:09:41,817 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 3126 treesize of output 3114 [2023-03-31 00:09:41,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:41,877 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 3114 treesize of output 3027 [2023-03-31 00:09:41,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:41,950 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 3018 treesize of output 2787 [2023-03-31 00:09:42,006 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 2762 treesize of output 2738 [2023-03-31 00:09:42,083 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 2738 treesize of output 2690 [2023-03-31 00:09:42,135 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 2690 treesize of output 2680 [2023-03-31 00:09:42,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:42,213 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 2680 treesize of output 2631 [2023-03-31 00:09:42,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:42,293 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 2606 treesize of output 2567 [2023-03-31 00:09:42,354 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 2558 treesize of output 2534 [2023-03-31 00:09:42,413 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 2534 treesize of output 2522 [2023-03-31 00:09:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434277512] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:09:57,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:09:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2023-03-31 00:09:57,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408436505] [2023-03-31 00:09:57,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:09:57,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-31 00:09:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-31 00:09:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-03-31 00:09:57,099 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:57,527 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-03-31 00:09:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-03-31 00:09:57,528 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-03-31 00:09:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:57,528 INFO L225 Difference]: With dead ends: 70 [2023-03-31 00:09:57,528 INFO L226 Difference]: Without dead ends: 54 [2023-03-31 00:09:57,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2023-03-31 00:09:57,529 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:57,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 44 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-31 00:09:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-03-31 00:09:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-03-31 00:09:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2023-03-31 00:09:57,538 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 26 [2023-03-31 00:09:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:57,538 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-03-31 00:09:57,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2023-03-31 00:09:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-03-31 00:09:57,539 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:57,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:57,551 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-03-31 00:09:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:57,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-03-31 00:09:57,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1505098259, now seen corresponding path program 1 times [2023-03-31 00:09:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:57,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200117630] [2023-03-31 00:09:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:10:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:10:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:10:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:10:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:10:00,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200117630] [2023-03-31 00:10:00,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200117630] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:10:00,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719575314] [2023-03-31 00:10:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:10:00,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:10:00,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:10:00,574 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-03-31 00:10:00,575 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-03-31 00:10:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:10:00,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 87 conjunts are in the unsatisfiable core [2023-03-31 00:10:00,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:10:00,849 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-03-31 00:10:00,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-03-31 00:10:00,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-03-31 00:10:00,911 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-03-31 00:10:00,911 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 2 case distinctions, treesize of input 90 treesize of output 78 [2023-03-31 00:10:00,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-03-31 00:10:00,944 INFO L321 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2023-03-31 00:10:00,944 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 51 treesize of output 69 [2023-03-31 00:10:00,953 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-03-31 00:10:00,957 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-03-31 00:10:00,975 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-03-31 00:10:00,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 25 treesize of output 29 [2023-03-31 00:10:01,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:10:01,202 INFO L321 Elim1Store]: treesize reduction 117, result has 25.0 percent of original size [2023-03-31 00:10:01,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 330 treesize of output 350 [2023-03-31 00:10:01,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:10:01,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:10:01,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:10:01,265 INFO L321 Elim1Store]: treesize reduction 55, result has 38.2 percent of original size [2023-03-31 00:10:01,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 186 [2023-03-31 00:10:01,333 INFO L321 Elim1Store]: treesize reduction 72, result has 48.9 percent of original size [2023-03-31 00:10:01,333 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 128 [2023-03-31 00:10:01,349 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 91 treesize of output 81 [2023-03-31 00:10:01,367 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 33 treesize of output 35 [2023-03-31 00:10:01,383 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 49 treesize of output 39 [2023-03-31 00:10:01,415 INFO L321 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-03-31 00:10:01,416 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 28 treesize of output 38 [2023-03-31 00:10:01,432 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 276 treesize of output 264 [2023-03-31 00:10:01,438 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 82 treesize of output 84 [2023-03-31 00:10:01,469 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 97 treesize of output 87 [2023-03-31 00:10:01,475 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 62 treesize of output 52 [2023-03-31 00:10:01,524 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 16 treesize of output 15 [2023-03-31 00:10:01,687 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-03-31 00:10:01,697 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-03-31 00:10:01,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:10:01,899 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:124) 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:296) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) 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.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) 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-03-31 00:10:01,903 INFO L158 Benchmark]: Toolchain (without parser) took 52369.43ms. Allocated memory was 320.9MB in the beginning and 791.7MB in the end (delta: 470.8MB). Free memory was 270.4MB in the beginning and 432.7MB in the end (delta: -162.2MB). Peak memory consumption was 310.0MB. Max. memory is 8.0GB. [2023-03-31 00:10:01,904 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 189.8MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 00:10:01,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.54ms. Allocated memory is still 320.9MB. Free memory was 270.4MB in the beginning and 252.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-03-31 00:10:01,904 INFO L158 Benchmark]: Boogie Preprocessor took 54.30ms. Allocated memory is still 320.9MB. Free memory was 252.2MB in the beginning and 249.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-31 00:10:01,904 INFO L158 Benchmark]: RCFGBuilder took 579.19ms. Allocated memory is still 320.9MB. Free memory was 249.4MB in the beginning and 224.9MB in the end (delta: 24.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-03-31 00:10:01,904 INFO L158 Benchmark]: TraceAbstraction took 51349.81ms. Allocated memory was 320.9MB in the beginning and 791.7MB in the end (delta: 470.8MB). Free memory was 224.3MB in the beginning and 432.7MB in the end (delta: -208.4MB). Peak memory consumption was 263.9MB. Max. memory is 8.0GB. [2023-03-31 00:10:01,905 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 189.8MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 379.54ms. Allocated memory is still 320.9MB. Free memory was 270.4MB in the beginning and 252.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.30ms. Allocated memory is still 320.9MB. Free memory was 252.2MB in the beginning and 249.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.19ms. Allocated memory is still 320.9MB. Free memory was 249.4MB in the beginning and 224.9MB in the end (delta: 24.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 51349.81ms. Allocated memory was 320.9MB in the beginning and 791.7MB in the end (delta: 470.8MB). Free memory was 224.3MB in the beginning and 432.7MB in the end (delta: -208.4MB). Peak memory consumption was 263.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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-03-31 00:10:01,941 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 0 Received shutdown request...